./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cb09d658 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-cb09d65-m [2024-01-27 23:08:01,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 23:08:01,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 23:08:01,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 23:08:01,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 23:08:01,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 23:08:01,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 23:08:01,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 23:08:01,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 23:08:01,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 23:08:01,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 23:08:01,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 23:08:01,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 23:08:01,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 23:08:01,732 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 23:08:01,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 23:08:01,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 23:08:01,733 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 23:08:01,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 23:08:01,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 23:08:01,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 23:08:01,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 23:08:01,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 23:08:01,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 23:08:01,735 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 23:08:01,735 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 23:08:01,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 23:08:01,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 23:08:01,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 23:08:01,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 23:08:01,736 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 23:08:01,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 23:08:01,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:01,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 23:08:01,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 23:08:01,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 23:08:01,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 23:08:01,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 23:08:01,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 23:08:01,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 23:08:01,738 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 23:08:01,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 23:08:01,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 23:08:01,738 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-27 23:08:01,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 23:08:01,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 23:08:01,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 23:08:01,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 23:08:01,970 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 23:08:01,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-27 23:08:02,913 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 23:08:03,064 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 23:08:03,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-27 23:08:03,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311509f3e/a14d044e620d4a44b3a8cf61dc8e9ed9/FLAG5c1202e5f [2024-01-27 23:08:03,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311509f3e/a14d044e620d4a44b3a8cf61dc8e9ed9 [2024-01-27 23:08:03,460 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-27 23:08:03,461 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-27 23:08:03,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml [2024-01-27 23:08:03,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 23:08:03,573 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-27 23:08:03,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:03,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 23:08:03,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 23:08:03,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:03" (1/2) ... [2024-01-27 23:08:03,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713db8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:03, skipping insertion in model container [2024-01-27 23:08:03,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 11:08:03" (1/2) ... [2024-01-27 23:08:03,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7af17874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 11:08:03, skipping insertion in model container [2024-01-27 23:08:03,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:03" (2/2) ... [2024-01-27 23:08:03,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713db8c4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03, skipping insertion in model container [2024-01-27 23:08:03,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:03" (2/2) ... [2024-01-27 23:08:03,581 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-27 23:08:03,615 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-27 23:08:03,616 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-27 23:08:03,616 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-27 23:08:03,616 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,617 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_11 == 0 [2024-01-27 23:08:03,617 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-27 23:08:03,617 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_10 == 0 [2024-01-27 23:08:03,617 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_9 == 0 [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] b != 0 [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] b <= -1 [2024-01-27 23:08:03,618 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] val == (_Bool)0 || val == (_Bool)1 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_11 == 0 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_9 == 0 [2024-01-27 23:08:03,619 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_10 == 0 [2024-01-27 23:08:03,620 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,620 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-27 23:08:03,620 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-27 23:08:03,620 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] b != 0 [2024-01-27 23:08:03,620 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] 1 <= b [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_9 == 0 [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_11 == 0 [2024-01-27 23:08:03,621 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_10 == 0 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_9 == 0 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,622 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_10 == 0 [2024-01-27 23:08:03,623 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] result_11 == 0 [2024-01-27 23:08:03,623 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_7 == 0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] is_null_0 == (_Bool)0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,624 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,625 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,625 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_11 == 0 [2024-01-27 23:08:03,625 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_10 == 0 [2024-01-27 23:08:03,625 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,625 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,626 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,626 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-27 23:08:03,626 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_9 == 0 [2024-01-27 23:08:03,626 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,627 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-27 23:08:03,627 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_8 == (_Bool)0 || filename_is_null_8 == (_Bool)1 [2024-01-27 23:08:03,628 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,628 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_9 == 0 [2024-01-27 23:08:03,628 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-27 23:08:03,628 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1 [2024-01-27 23:08:03,628 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_11 == 0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_10 == 0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_10 == 0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_11 == 0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] result_9 == 0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_0 == (_Bool)0 [2024-01-27 23:08:03,629 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_7 == 0 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1 [2024-01-27 23:08:03,630 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_11 == 0 [2024-01-27 23:08:03,631 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_10 == 0 [2024-01-27 23:08:03,631 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_9 == 0 [2024-01-27 23:08:03,631 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1 [2024-01-27 23:08:03,631 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,631 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,632 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,632 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_7 == 0 [2024-01-27 23:08:03,635 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_9 == 0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] is_null_0 == (_Bool)0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_1 == 0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_4 == 0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_10 == 0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] result_11 == 0 [2024-01-27 23:08:03,636 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_9 == 0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_10 == 0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_11 == 0 [2024-01-27 23:08:03,637 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1 [2024-01-27 23:08:03,638 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,638 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_4 == 0 [2024-01-27 23:08:03,638 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_7 == 0 [2024-01-27 23:08:03,639 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_9 == 0 [2024-01-27 23:08:03,639 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_10 == 0 [2024-01-27 23:08:03,639 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_0 == (_Bool)0 [2024-01-27 23:08:03,640 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,640 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,640 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] result_11 == 0 [2024-01-27 23:08:03,640 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,640 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,641 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_2 == (_Bool)0 [2024-01-27 23:08:03,641 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_6 == (_Bool)0 [2024-01-27 23:08:03,641 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_11 == 0 [2024-01-27 23:08:03,641 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_0 == (_Bool)0 [2024-01-27 23:08:03,641 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_8 == (_Bool)0 [2024-01-27 23:08:03,642 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_10 == 0 [2024-01-27 23:08:03,642 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] is_null_3 == (_Bool)0 [2024-01-27 23:08:03,642 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_9 == 0 [2024-01-27 23:08:03,642 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] filename_is_null_5 == (_Bool)0 [2024-01-27 23:08:03,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 23:08:03,815 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] [2024-01-27 23:08:03,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:03,830 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 23:08:03,838 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-27 23:08:03,839 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:08:03,911 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-27 23:08:03,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 23:08:03,929 INFO L206 MainTranslator]: Completed translation [2024-01-27 23:08:03,931 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03 WrapperNode [2024-01-27 23:08:03,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 23:08:03,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:03,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 23:08:03,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 23:08:03,938 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 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:03,951 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 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:03,992 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 319 [2024-01-27 23:08:03,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 23:08:03,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 23:08:03,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 23:08:03,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 23:08:04,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,029 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 23:08:04,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 23:08:04,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 23:08:04,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 23:08:04,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 23:08:04,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (1/1) ... [2024-01-27 23:08:04,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 23:08:04,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 23:08:04,118 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-27 23:08:04,144 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-27 23:08:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 23:08:04,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 23:08:04,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 23:08:04,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 23:08:04,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 23:08:04,164 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 23:08:04,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 23:08:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 23:08:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 23:08:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 23:08:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 23:08:04,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 23:08:04,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 23:08:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 23:08:04,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 23:08:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 23:08:04,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 23:08:04,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 23:08:04,175 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 23:08:04,269 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 23:08:04,271 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 23:08:04,740 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 23:08:04,741 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 23:08:04,940 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 23:08:04,940 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 23:08:04,940 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:04 BoogieIcfgContainer [2024-01-27 23:08:04,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 23:08:04,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 23:08:04,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 23:08:04,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 23:08:04,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 11:08:03" (1/4) ... [2024-01-27 23:08:04,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3203f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 11:08:04, skipping insertion in model container [2024-01-27 23:08:04,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.01 11:08:03" (2/4) ... [2024-01-27 23:08:04,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3203f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:08:04, skipping insertion in model container [2024-01-27 23:08:04,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.01 11:08:03" (3/4) ... [2024-01-27 23:08:04,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3203f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.01 11:08:04, skipping insertion in model container [2024-01-27 23:08:04,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 11:08:04" (4/4) ... [2024-01-27 23:08:04,951 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-01-27 23:08:04,965 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 23:08:04,966 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2024-01-27 23:08:04,966 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 23:08:05,032 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 23:08:05,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 279 transitions, 579 flow [2024-01-27 23:08:05,157 INFO L124 PetriNetUnfolderBase]: 12/276 cut-off events. [2024-01-27 23:08:05,158 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 23:08:05,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 276 events. 12/276 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 247. Up to 2 conditions per place. [2024-01-27 23:08:05,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 279 transitions, 579 flow [2024-01-27 23:08:05,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 275 transitions, 568 flow [2024-01-27 23:08:05,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 23:08:05,186 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;@5966a81b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 23:08:05,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-01-27 23:08:05,188 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 23:08:05,188 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-27 23:08:05,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 23:08:05,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:05,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-27 23:08:05,189 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:05,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash 31413, now seen corresponding path program 1 times [2024-01-27 23:08:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:05,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330507152] [2024-01-27 23:08:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:05,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:05,360 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-27 23:08:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:05,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330507152] [2024-01-27 23:08:05,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330507152] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:05,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293486652] [2024-01-27 23:08:05,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:05,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:05,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 279 [2024-01-27 23:08:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-27 23:08:05,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:05,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 279 [2024-01-27 23:08:05,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:06,560 INFO L124 PetriNetUnfolderBase]: 4522/7508 cut-off events. [2024-01-27 23:08:06,560 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-01-27 23:08:06,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13957 conditions, 7508 events. 4522/7508 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 58805 event pairs, 2958 based on Foata normal form. 0/6104 useless extension candidates. Maximal degree in co-relation 12584. Up to 4919 conditions per place. [2024-01-27 23:08:06,622 INFO L140 encePairwiseOnDemand]: 267/279 looper letters, 81 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-01-27 23:08:06,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 288 transitions, 766 flow [2024-01-27 23:08:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-27 23:08:06,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8566308243727598 [2024-01-27 23:08:06,639 INFO L175 Difference]: Start difference. First operand has 273 places, 275 transitions, 568 flow. Second operand 3 states and 717 transitions. [2024-01-27 23:08:06,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 288 transitions, 766 flow [2024-01-27 23:08:06,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 288 transitions, 750 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 23:08:06,652 INFO L231 Difference]: Finished difference. Result has 259 places, 265 transitions, 540 flow [2024-01-27 23:08:06,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=540, PETRI_PLACES=259, PETRI_TRANSITIONS=265} [2024-01-27 23:08:06,656 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -14 predicate places. [2024-01-27 23:08:06,657 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 265 transitions, 540 flow [2024-01-27 23:08:06,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-27 23:08:06,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:06,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-27 23:08:06,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 23:08:06,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:06,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:06,658 INFO L85 PathProgramCache]: Analyzing trace with hash 974770, now seen corresponding path program 1 times [2024-01-27 23:08:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:06,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93017694] [2024-01-27 23:08:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:06,709 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-27 23:08:06,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:06,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93017694] [2024-01-27 23:08:06,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93017694] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:06,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:06,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:06,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960138408] [2024-01-27 23:08:06,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:06,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:06,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:06,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:06,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 279 [2024-01-27 23:08:06,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-27 23:08:06,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:06,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 279 [2024-01-27 23:08:06,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:07,599 INFO L124 PetriNetUnfolderBase]: 4522/7496 cut-off events. [2024-01-27 23:08:07,599 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-01-27 23:08:07,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13944 conditions, 7496 events. 4522/7496 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 59108 event pairs, 2878 based on Foata normal form. 0/6142 useless extension candidates. Maximal degree in co-relation 11085. Up to 4783 conditions per place. [2024-01-27 23:08:07,644 INFO L140 encePairwiseOnDemand]: 267/279 looper letters, 81 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-01-27 23:08:07,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 278 transitions, 736 flow [2024-01-27 23:08:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-01-27 23:08:07,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8566308243727598 [2024-01-27 23:08:07,646 INFO L175 Difference]: Start difference. First operand has 259 places, 265 transitions, 540 flow. Second operand 3 states and 717 transitions. [2024-01-27 23:08:07,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 278 transitions, 736 flow [2024-01-27 23:08:07,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 278 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:07,653 INFO L231 Difference]: Finished difference. Result has 249 places, 255 transitions, 520 flow [2024-01-27 23:08:07,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=249, PETRI_TRANSITIONS=255} [2024-01-27 23:08:07,657 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -24 predicate places. [2024-01-27 23:08:07,657 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 255 transitions, 520 flow [2024-01-27 23:08:07,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-27 23:08:07,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:07,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-27 23:08:07,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 23:08:07,659 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:07,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash 30218940, now seen corresponding path program 1 times [2024-01-27 23:08:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33190235] [2024-01-27 23:08:07,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:07,712 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-27 23:08:07,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:07,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33190235] [2024-01-27 23:08:07,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33190235] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:07,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:07,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060418372] [2024-01-27 23:08:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:07,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:07,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:07,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-27 23:08:07,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 255 transitions, 520 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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-27 23:08:07,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:07,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-27 23:08:07,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:08,459 INFO L124 PetriNetUnfolderBase]: 4522/7476 cut-off events. [2024-01-27 23:08:08,459 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-01-27 23:08:08,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13932 conditions, 7476 events. 4522/7476 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58430 event pairs, 3768 based on Foata normal form. 0/6084 useless extension candidates. Maximal degree in co-relation 10753. Up to 6160 conditions per place. [2024-01-27 23:08:08,497 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-01-27 23:08:08,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 253 transitions, 620 flow [2024-01-27 23:08:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-01-27 23:08:08,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8673835125448028 [2024-01-27 23:08:08,499 INFO L175 Difference]: Start difference. First operand has 249 places, 255 transitions, 520 flow. Second operand 3 states and 726 transitions. [2024-01-27 23:08:08,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 253 transitions, 620 flow [2024-01-27 23:08:08,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 253 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:08,503 INFO L231 Difference]: Finished difference. Result has 247 places, 253 transitions, 516 flow [2024-01-27 23:08:08,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=247, PETRI_TRANSITIONS=253} [2024-01-27 23:08:08,505 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -26 predicate places. [2024-01-27 23:08:08,506 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 253 transitions, 516 flow [2024-01-27 23:08:08,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 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-27 23:08:08,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:08,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-27 23:08:08,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 23:08:08,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:08,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 936788089, now seen corresponding path program 1 times [2024-01-27 23:08:08,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245813156] [2024-01-27 23:08:08,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:08,559 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-27 23:08:08,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245813156] [2024-01-27 23:08:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245813156] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:08,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:08,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:08,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978747645] [2024-01-27 23:08:08,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:08,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:08,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:08,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:08,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-27 23:08:08,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 253 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:08,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:08,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-27 23:08:08,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:09,317 INFO L124 PetriNetUnfolderBase]: 4522/7475 cut-off events. [2024-01-27 23:08:09,318 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:09,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13733 conditions, 7475 events. 4522/7475 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58351 event pairs, 3768 based on Foata normal form. 0/6084 useless extension candidates. Maximal degree in co-relation 13684. Up to 6161 conditions per place. [2024-01-27 23:08:09,353 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-27 23:08:09,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 616 flow [2024-01-27 23:08:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2024-01-27 23:08:09,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8721624850657109 [2024-01-27 23:08:09,355 INFO L175 Difference]: Start difference. First operand has 247 places, 253 transitions, 516 flow. Second operand 3 states and 730 transitions. [2024-01-27 23:08:09,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 616 flow [2024-01-27 23:08:09,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 252 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:09,359 INFO L231 Difference]: Finished difference. Result has 246 places, 252 transitions, 514 flow [2024-01-27 23:08:09,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=246, PETRI_TRANSITIONS=252} [2024-01-27 23:08:09,360 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -27 predicate places. [2024-01-27 23:08:09,360 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 252 transitions, 514 flow [2024-01-27 23:08:09,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:09,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:09,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 23:08:09,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 23:08:09,361 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:09,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1024339501, now seen corresponding path program 1 times [2024-01-27 23:08:09,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:09,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779939275] [2024-01-27 23:08:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:09,400 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-27 23:08:09,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779939275] [2024-01-27 23:08:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779939275] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:09,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:09,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942119980] [2024-01-27 23:08:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:09,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:09,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:09,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:09,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:09,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:09,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:09,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:10,144 INFO L124 PetriNetUnfolderBase]: 4522/7471 cut-off events. [2024-01-27 23:08:10,144 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:10,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13734 conditions, 7471 events. 4522/7471 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58391 event pairs, 3768 based on Foata normal form. 4/6090 useless extension candidates. Maximal degree in co-relation 13707. Up to 6164 conditions per place. [2024-01-27 23:08:10,195 INFO L140 encePairwiseOnDemand]: 273/279 looper letters, 54 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-27 23:08:10,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 248 transitions, 618 flow [2024-01-27 23:08:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:10,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:10,197 INFO L175 Difference]: Start difference. First operand has 246 places, 252 transitions, 514 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:10,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 248 transitions, 618 flow [2024-01-27 23:08:10,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 248 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:10,200 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 506 flow [2024-01-27 23:08:10,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=242, PETRI_TRANSITIONS=248} [2024-01-27 23:08:10,201 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -31 predicate places. [2024-01-27 23:08:10,202 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 506 flow [2024-01-27 23:08:10,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:10,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:10,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:10,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 23:08:10,203 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:10,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1689752552, now seen corresponding path program 1 times [2024-01-27 23:08:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:10,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939679373] [2024-01-27 23:08:10,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:10,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:10,221 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-27 23:08:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:10,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939679373] [2024-01-27 23:08:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939679373] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:10,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:10,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:10,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073343636] [2024-01-27 23:08:10,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:10,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:10,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:10,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 279 [2024-01-27 23:08:10,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:10,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:10,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 279 [2024-01-27 23:08:10,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:10,912 INFO L124 PetriNetUnfolderBase]: 4501/7468 cut-off events. [2024-01-27 23:08:10,912 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 23:08:10,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13734 conditions, 7468 events. 4501/7468 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 59122 event pairs, 2654 based on Foata normal form. 0/6181 useless extension candidates. Maximal degree in co-relation 13654. Up to 4397 conditions per place. [2024-01-27 23:08:11,081 INFO L140 encePairwiseOnDemand]: 266/279 looper letters, 79 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2024-01-27 23:08:11,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 261 transitions, 698 flow [2024-01-27 23:08:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:11,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:11,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-01-27 23:08:11,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8590203106332138 [2024-01-27 23:08:11,083 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 506 flow. Second operand 3 states and 719 transitions. [2024-01-27 23:08:11,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 261 transitions, 698 flow [2024-01-27 23:08:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 261 transitions, 694 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:11,086 INFO L231 Difference]: Finished difference. Result has 232 places, 238 transitions, 488 flow [2024-01-27 23:08:11,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=232, PETRI_TRANSITIONS=238} [2024-01-27 23:08:11,087 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -41 predicate places. [2024-01-27 23:08:11,087 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 238 transitions, 488 flow [2024-01-27 23:08:11,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:11,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:11,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:11,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 23:08:11,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:11,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -842720565, now seen corresponding path program 1 times [2024-01-27 23:08:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511918785] [2024-01-27 23:08:11,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:11,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:11,120 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-27 23:08:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511918785] [2024-01-27 23:08:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511918785] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:11,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352262632] [2024-01-27 23:08:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:11,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:11,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:11,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:11,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 238 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:11,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:11,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:11,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:11,765 INFO L124 PetriNetUnfolderBase]: 4522/7456 cut-off events. [2024-01-27 23:08:11,765 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2024-01-27 23:08:11,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13900 conditions, 7456 events. 4522/7456 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58205 event pairs, 3768 based on Foata normal form. 3/6087 useless extension candidates. Maximal degree in co-relation 9967. Up to 6162 conditions per place. [2024-01-27 23:08:11,801 INFO L140 encePairwiseOnDemand]: 272/279 looper letters, 53 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-01-27 23:08:11,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 233 transitions, 588 flow [2024-01-27 23:08:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:11,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:11,804 INFO L175 Difference]: Start difference. First operand has 232 places, 238 transitions, 488 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:11,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 233 transitions, 588 flow [2024-01-27 23:08:11,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 233 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:11,807 INFO L231 Difference]: Finished difference. Result has 227 places, 233 transitions, 476 flow [2024-01-27 23:08:11,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=227, PETRI_TRANSITIONS=233} [2024-01-27 23:08:11,807 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -46 predicate places. [2024-01-27 23:08:11,808 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 233 transitions, 476 flow [2024-01-27 23:08:11,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:11,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:11,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 23:08:11,809 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:11,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -354532890, now seen corresponding path program 1 times [2024-01-27 23:08:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566379189] [2024-01-27 23:08:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:11,838 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-27 23:08:11,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:11,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566379189] [2024-01-27 23:08:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566379189] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:11,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:11,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332778402] [2024-01-27 23:08:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:11,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:11,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:11,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:11,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:11,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 233 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:11,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:11,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:11,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:12,534 INFO L124 PetriNetUnfolderBase]: 4522/7447 cut-off events. [2024-01-27 23:08:12,534 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:12,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13705 conditions, 7447 events. 4522/7447 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58382 event pairs, 3768 based on Foata normal form. 9/6091 useless extension candidates. Maximal degree in co-relation 13623. Up to 6154 conditions per place. [2024-01-27 23:08:12,569 INFO L140 encePairwiseOnDemand]: 268/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-01-27 23:08:12,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 224 transitions, 560 flow [2024-01-27 23:08:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:12,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:12,571 INFO L175 Difference]: Start difference. First operand has 227 places, 233 transitions, 476 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:12,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 224 transitions, 560 flow [2024-01-27 23:08:12,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 224 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:12,576 INFO L231 Difference]: Finished difference. Result has 218 places, 224 transitions, 458 flow [2024-01-27 23:08:12,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=218, PETRI_TRANSITIONS=224} [2024-01-27 23:08:12,578 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -55 predicate places. [2024-01-27 23:08:12,579 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 224 transitions, 458 flow [2024-01-27 23:08:12,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:12,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:12,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:12,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 23:08:12,580 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:12,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1894383370, now seen corresponding path program 1 times [2024-01-27 23:08:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136803931] [2024-01-27 23:08:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:12,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:12,633 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-27 23:08:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136803931] [2024-01-27 23:08:12,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136803931] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:12,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618360074] [2024-01-27 23:08:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:12,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:12,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:12,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:12,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:12,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:12,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 224 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:12,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:12,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:12,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:13,309 INFO L124 PetriNetUnfolderBase]: 4522/7439 cut-off events. [2024-01-27 23:08:13,309 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:13,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13698 conditions, 7439 events. 4522/7439 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58238 event pairs, 3768 based on Foata normal form. 7/6089 useless extension candidates. Maximal degree in co-relation 13563. Up to 6156 conditions per place. [2024-01-27 23:08:13,342 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-01-27 23:08:13,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 216 transitions, 546 flow [2024-01-27 23:08:13,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:13,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:13,344 INFO L175 Difference]: Start difference. First operand has 218 places, 224 transitions, 458 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 216 transitions, 546 flow [2024-01-27 23:08:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 216 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:13,347 INFO L231 Difference]: Finished difference. Result has 210 places, 216 transitions, 442 flow [2024-01-27 23:08:13,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=210, PETRI_TRANSITIONS=216} [2024-01-27 23:08:13,347 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -63 predicate places. [2024-01-27 23:08:13,348 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 216 transitions, 442 flow [2024-01-27 23:08:13,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:13,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:13,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:13,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 23:08:13,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1403656769, now seen corresponding path program 1 times [2024-01-27 23:08:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031070869] [2024-01-27 23:08:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:13,390 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-27 23:08:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:13,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031070869] [2024-01-27 23:08:13,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031070869] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:13,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:13,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:13,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478701257] [2024-01-27 23:08:13,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:13,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:13,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:13,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:13,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:13,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:13,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 216 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:13,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:13,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:13,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:14,079 INFO L124 PetriNetUnfolderBase]: 4522/7432 cut-off events. [2024-01-27 23:08:14,079 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:14,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13692 conditions, 7432 events. 4522/7432 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58432 event pairs, 3768 based on Foata normal form. 6/6088 useless extension candidates. Maximal degree in co-relation 13579. Up to 6158 conditions per place. [2024-01-27 23:08:14,118 INFO L140 encePairwiseOnDemand]: 270/279 looper letters, 51 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-01-27 23:08:14,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 209 transitions, 534 flow [2024-01-27 23:08:14,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:14,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:14,120 INFO L175 Difference]: Start difference. First operand has 210 places, 216 transitions, 442 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:14,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 209 transitions, 534 flow [2024-01-27 23:08:14,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 209 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:14,122 INFO L231 Difference]: Finished difference. Result has 203 places, 209 transitions, 428 flow [2024-01-27 23:08:14,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=203, PETRI_TRANSITIONS=209} [2024-01-27 23:08:14,123 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -70 predicate places. [2024-01-27 23:08:14,123 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 209 transitions, 428 flow [2024-01-27 23:08:14,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:14,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:14,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:14,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 23:08:14,124 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:14,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash -563685832, now seen corresponding path program 1 times [2024-01-27 23:08:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684481234] [2024-01-27 23:08:14,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:14,165 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-27 23:08:14,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684481234] [2024-01-27 23:08:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684481234] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:14,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25826976] [2024-01-27 23:08:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:14,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:14,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:14,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:14,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-27 23:08:14,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 209 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:14,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:14,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-27 23:08:14,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:14,842 INFO L124 PetriNetUnfolderBase]: 4522/7426 cut-off events. [2024-01-27 23:08:14,843 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:14,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13687 conditions, 7426 events. 4522/7426 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58302 event pairs, 3768 based on Foata normal form. 6/6087 useless extension candidates. Maximal degree in co-relation 13594. Up to 6160 conditions per place. [2024-01-27 23:08:14,878 INFO L140 encePairwiseOnDemand]: 271/279 looper letters, 52 selfloop transitions, 2 changer transitions 0/203 dead transitions. [2024-01-27 23:08:14,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 203 transitions, 524 flow [2024-01-27 23:08:14,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-01-27 23:08:14,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8530465949820788 [2024-01-27 23:08:14,880 INFO L175 Difference]: Start difference. First operand has 203 places, 209 transitions, 428 flow. Second operand 3 states and 714 transitions. [2024-01-27 23:08:14,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 203 transitions, 524 flow [2024-01-27 23:08:14,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 203 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:14,883 INFO L231 Difference]: Finished difference. Result has 197 places, 203 transitions, 416 flow [2024-01-27 23:08:14,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=197, PETRI_TRANSITIONS=203} [2024-01-27 23:08:14,885 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -76 predicate places. [2024-01-27 23:08:14,885 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 203 transitions, 416 flow [2024-01-27 23:08:14,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 23:08:14,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:14,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:14,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-27 23:08:14,886 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:14,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash -294390705, now seen corresponding path program 1 times [2024-01-27 23:08:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:14,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296589990] [2024-01-27 23:08:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 23:08:14,900 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-27 23:08:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 23:08:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296589990] [2024-01-27 23:08:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296589990] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 23:08:14,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 23:08:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 23:08:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369169142] [2024-01-27 23:08:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 23:08:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 23:08:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 23:08:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 23:08:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 23:08:14,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 279 [2024-01-27 23:08:14,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 203 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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-27 23:08:14,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 23:08:14,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 279 [2024-01-27 23:08:14,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 23:08:15,611 INFO L124 PetriNetUnfolderBase]: 4522/7423 cut-off events. [2024-01-27 23:08:15,611 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-27 23:08:15,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13682 conditions, 7423 events. 4522/7423 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58497 event pairs, 3768 based on Foata normal form. 0/6078 useless extension candidates. Maximal degree in co-relation 13604. Up to 6159 conditions per place. [2024-01-27 23:08:15,649 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-01-27 23:08:15,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 514 flow [2024-01-27 23:08:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 23:08:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 23:08:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-27 23:08:15,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8649940262843488 [2024-01-27 23:08:15,652 INFO L175 Difference]: Start difference. First operand has 197 places, 203 transitions, 416 flow. Second operand 3 states and 724 transitions. [2024-01-27 23:08:15,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 514 flow [2024-01-27 23:08:15,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 23:08:15,655 INFO L231 Difference]: Finished difference. Result has 194 places, 200 transitions, 410 flow [2024-01-27 23:08:15,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=194, PETRI_TRANSITIONS=200} [2024-01-27 23:08:15,655 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -79 predicate places. [2024-01-27 23:08:15,655 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 200 transitions, 410 flow [2024-01-27 23:08:15,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 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-27 23:08:15,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 23:08:15,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 23:08:15,657 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-27 23:08:15,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 23:08:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1603199291, now seen corresponding path program 1 times [2024-01-27 23:08:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 23:08:15,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049892789] [2024-01-27 23:08:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 23:08:15,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 23:08:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:15,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 23:08:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 23:08:15,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 23:08:15,689 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 23:08:15,690 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONWITNESS_INVARIANT (129 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (128 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (127 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (126 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (125 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (124 of 130 remaining) [2024-01-27 23:08:15,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (123 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (122 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (121 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (120 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (119 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (118 of 130 remaining) [2024-01-27 23:08:15,693 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (117 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (116 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (115 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (114 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (113 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (112 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (111 of 130 remaining) [2024-01-27 23:08:15,694 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (110 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (109 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (108 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (107 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT (106 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT (105 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT (104 of 130 remaining) [2024-01-27 23:08:15,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONWITNESS_INVARIANT (103 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONWITNESS_INVARIANT (102 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT (101 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT (100 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT (99 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT (98 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT (97 of 130 remaining) [2024-01-27 23:08:15,696 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT (96 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONWITNESS_INVARIANT (95 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONWITNESS_INVARIANT (94 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONWITNESS_INVARIANT (93 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT (92 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONWITNESS_INVARIANT (91 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT (90 of 130 remaining) [2024-01-27 23:08:15,697 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT (89 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT (88 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT (87 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT (86 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT (85 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT (84 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT (83 of 130 remaining) [2024-01-27 23:08:15,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONWITNESS_INVARIANT (82 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONWITNESS_INVARIANT (81 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT (80 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT (79 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT (78 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONWITNESS_INVARIANT (77 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT (76 of 130 remaining) [2024-01-27 23:08:15,699 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT (75 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONWITNESS_INVARIANT (74 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONWITNESS_INVARIANT (73 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONWITNESS_INVARIANT (72 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONWITNESS_INVARIANT (71 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONWITNESS_INVARIANT (70 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONWITNESS_INVARIANT (69 of 130 remaining) [2024-01-27 23:08:15,700 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONWITNESS_INVARIANT (68 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONWITNESS_INVARIANT (67 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONWITNESS_INVARIANT (66 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONWITNESS_INVARIANT (65 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONWITNESS_INVARIANT (64 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONWITNESS_INVARIANT (63 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONWITNESS_INVARIANT (62 of 130 remaining) [2024-01-27 23:08:15,701 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONWITNESS_INVARIANT (61 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONWITNESS_INVARIANT (60 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONWITNESS_INVARIANT (59 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONWITNESS_INVARIANT (58 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONWITNESS_INVARIANT (57 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONWITNESS_INVARIANT (56 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONWITNESS_INVARIANT (55 of 130 remaining) [2024-01-27 23:08:15,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONWITNESS_INVARIANT (54 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONWITNESS_INVARIANT (53 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONWITNESS_INVARIANT (52 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONWITNESS_INVARIANT (51 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONWITNESS_INVARIANT (50 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONWITNESS_INVARIANT (49 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONWITNESS_INVARIANT (48 of 130 remaining) [2024-01-27 23:08:15,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONWITNESS_INVARIANT (47 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONWITNESS_INVARIANT (46 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONWITNESS_INVARIANT (45 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONWITNESS_INVARIANT (44 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONWITNESS_INVARIANT (43 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONWITNESS_INVARIANT (42 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONWITNESS_INVARIANT (41 of 130 remaining) [2024-01-27 23:08:15,704 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONWITNESS_INVARIANT (40 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONWITNESS_INVARIANT (39 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONWITNESS_INVARIANT (38 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONWITNESS_INVARIANT (37 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 130 remaining) [2024-01-27 23:08:15,705 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 130 remaining) [2024-01-27 23:08:15,706 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 130 remaining) [2024-01-27 23:08:15,707 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONERROR_FUNCTION (18 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 130 remaining) [2024-01-27 23:08:15,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 130 remaining) [2024-01-27 23:08:15,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 130 remaining) [2024-01-27 23:08:15,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err4ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 130 remaining) [2024-01-27 23:08:15,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 130 remaining) [2024-01-27 23:08:15,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 130 remaining) [2024-01-27 23:08:15,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 130 remaining) [2024-01-27 23:08:15,710 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 130 remaining) [2024-01-27 23:08:15,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 23:08:15,711 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 23:08:15,716 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 23:08:15,717 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 23:08:15,776 INFO L503 ceAbstractionStarter]: Automizer considered 111 witness invariants [2024-01-27 23:08:15,777 INFO L504 ceAbstractionStarter]: WitnessConsidered=111 [2024-01-27 23:08:15,777 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 11:08:15 BasicIcfg [2024-01-27 23:08:15,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 23:08:15,778 INFO L158 Benchmark]: Toolchain (without parser) took 12205.24ms. Allocated memory was 174.1MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 134.1MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 23:08:15,778 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:15,778 INFO L158 Benchmark]: Witness Parser took 0.08ms. Allocated memory is still 174.1MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 23:08:15,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.56ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 109.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 23:08:15,779 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.81ms. Allocated memory is still 174.1MB. Free memory was 109.8MB in the beginning and 106.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:15,779 INFO L158 Benchmark]: Boogie Preprocessor took 58.67ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 104.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 23:08:15,779 INFO L158 Benchmark]: RCFGBuilder took 887.78ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 115.4MB in the end (delta: -11.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-01-27 23:08:15,779 INFO L158 Benchmark]: TraceAbstraction took 10833.98ms. Allocated memory was 174.1MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 114.4MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 23:08:15,781 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.14ms. Allocated memory is still 119.5MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.08ms. Allocated memory is still 174.1MB. Free memory is still 140.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.56ms. Allocated memory is still 174.1MB. Free memory was 133.7MB in the beginning and 109.8MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.81ms. Allocated memory is still 174.1MB. Free memory was 109.8MB in the beginning and 106.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.67ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 104.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 887.78ms. Allocated memory is still 174.1MB. Free memory was 103.5MB in the beginning and 115.4MB in the end (delta: -11.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 10833.98ms. Allocated memory was 174.1MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 114.4MB in the beginning and 8.1GB in the end (delta: -8.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 68]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] int filename_1, filename_4, filename_7, result_9, result_10, result_11; [L39] _Bool is_null_0, is_null_3, is_null_6, filename_is_null_2, filename_is_null_5, filename_is_null_8; [L62] pthread_t t1, t2, t3; VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_1],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L64] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] [L64] filename_1 = __VERIFIER_nondet_int() [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_4],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L65] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L65] filename_4 = __VERIFIER_nondet_int() [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_7],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L66] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L66] filename_7 = __VERIFIER_nondet_int() [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_5],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_9],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_3],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_10],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_8],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[result_11],IntegerLiteral[0]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[is_null_6],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=0, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] [L67] CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[filename_is_null_2],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]]]] [L67] is_null_0 = __VERIFIER_nondet_bool() [L68] CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[is_null_0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [filename_1=0, filename_4=0, filename_7=0, filename_is_null_2=0, filename_is_null_5=0, filename_is_null_8=0, is_null_0=2, is_null_3=0, is_null_6=0, result_10=0, result_11=0, result_9=0, t1={6:0}, t2={3:0}, t3={5:0}] - UnprovableResult [Line: 46]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 58]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 90]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 91]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 84]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 331 locations, 130 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1302 IncrementalHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 43 mSDtfsCounter, 1302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=568occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 234 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 23:08:15,803 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