./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 8857f20b Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/chl-file-item-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-8857f20-m [2024-01-29 22:56:27,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-29 22:56:27,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-29 22:56:27,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-29 22:56:27,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-29 22:56:27,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-29 22:56:27,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-29 22:56:27,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-29 22:56:27,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-29 22:56:27,761 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-29 22:56:27,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-29 22:56:27,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-29 22:56:27,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-29 22:56:27,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-29 22:56:27,763 INFO L153 SettingsManager]: * Use SBE=true [2024-01-29 22:56:27,763 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-29 22:56:27,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-29 22:56:27,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-29 22:56:27,764 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-29 22:56:27,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-29 22:56:27,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-29 22:56:27,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-29 22:56:27,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-29 22:56:27,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-29 22:56:27,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-29 22:56:27,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-29 22:56:27,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-29 22:56:27,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-29 22:56:27,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-29 22:56:27,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-29 22:56:27,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-29 22:56:27,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-29 22:56:27,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:27,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-29 22:56:27,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-29 22:56:27,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-29 22:56:27,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-29 22:56:27,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-29 22:56:27,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-29 22:56:27,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-29 22:56:27,769 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-29 22:56:27,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-29 22:56:27,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-29 22:56:27,770 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-29 22:56:27,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-29 22:56:28,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-29 22:56:28,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-29 22:56:28,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-29 22:56:28,012 INFO L274 PluginConnector]: CDTParser initialized [2024-01-29 22:56:28,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-29 22:56:29,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-29 22:56:29,195 INFO L384 CDTParser]: Found 1 translation units. [2024-01-29 22:56:29,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c [2024-01-29 22:56:29,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f985438/9fff26e53206468c8f7b03e093e54d7b/FLAG28306175f [2024-01-29 22:56:29,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7f985438/9fff26e53206468c8f7b03e093e54d7b [2024-01-29 22:56:29,213 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-29 22:56:29,213 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-29 22:56:29,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-file-item-subst.wvr.yml/witness.yml [2024-01-29 22:56:29,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-29 22:56:29,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-29 22:56:29,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:29,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-29 22:56:29,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-29 22:56:29,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:29" (1/2) ... [2024-01-29 22:56:29,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab4a0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 10:56:29" (1/2) ... [2024-01-29 22:56:29,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48c541d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/2) ... [2024-01-29 22:56:29,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab4a0d9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29, skipping insertion in model container [2024-01-29 22:56:29,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/2) ... [2024-01-29 22:56:29,338 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-29 22:56:29,376 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-29 22:56:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-29 22:56:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] filename_1 == 0 [2024-01-29 22:56:29,378 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (result_9 == 0) [2024-01-29 22:56:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (is_null_0 == (_Bool)0) [2024-01-29 22:56:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (filename_4 == 0) [2024-01-29 22:56:29,379 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (result_10 == 0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((filename_1 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((filename_1 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (filename_7 == 0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] (filename_1 == 0) && (result_11 == 0) [2024-01-29 22:56:29,380 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] result_9 == 0 [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,381 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L70-L70] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((result_9 == 0) && (result_11 == 0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_9 == 0) && (result_11 == 0) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((result_9 == 0) && (result_11 == 0)) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((result_9 == 0) && (result_11 == 0)) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,382 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((result_9 == 0) && (result_11 == 0)) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] result_9 == 0 [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((result_9 == 0) && (result_11 == 0)) && (is_null_0 == (_Bool)0) [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (((result_9 == 0) && (result_11 == 0)) && (filename_is_null_5 == (_Bool)0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] b <= -1 [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L91-L91] (b <= -1) && (b != 0) [2024-01-29 22:56:29,383 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] (1 <= b) && (b != 0) [2024-01-29 22:56:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L90-L90] 1 <= b [2024-01-29 22:56:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-29 22:56:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L46-L46] (unsigned long )_argptr == 0UL [2024-01-29 22:56:29,384 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_7 == 0) && (result_10 == 0) [2024-01-29 22:56:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0) [2024-01-29 22:56:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,385 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] filename_7 == 0 [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (filename_7 == 0) && (result_9 == 0) [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((filename_7 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0)) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,386 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0)) && (is_null_3 == (_Bool)0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0) [2024-01-29 22:56:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (filename_4 == 0) && (result_10 == 0) [2024-01-29 22:56:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] filename_4 == 0 [2024-01-29 22:56:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((filename_4 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,387 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0)) && (is_null_3 == (_Bool)0)) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,388 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (filename_4 == 0) && (filename_7 == 0) [2024-01-29 22:56:29,388 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (filename_4 == 0) && (result_9 == 0) [2024-01-29 22:56:29,388 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0)) && (is_null_3 == (_Bool)0)) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] ((((filename_4 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0)) && (is_null_3 == (_Bool)0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1)) && (filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1) [2024-01-29 22:56:29,389 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_9 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] (((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1)) && (filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] result_9 == 0 [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_9 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (val == (_Bool)0 || val == (_Bool)1) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_9 == 0) && (result_11 == 0) [2024-01-29 22:56:29,390 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] result_9 == 0 [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] ((result_9 == 0) && (result_11 == 0)) && (filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1) [2024-01-29 22:56:29,391 INFO L98 nessWitnessExtractor]: Location invariant after [L18-L19] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] filename_7 == 0 [2024-01-29 22:56:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (result_11 == 0) [2024-01-29 22:56:29,392 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((filename_7 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (result_9 == 0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (is_null_0 == (_Bool)0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (result_10 == 0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((filename_7 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (filename_7 == 0) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,393 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0 || filename_is_null_8 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] result_9 == 0 [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_5 == (_Bool)0 || filename_is_null_5 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1) [2024-01-29 22:56:29,394 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_2 == (_Bool)0 || filename_is_null_2 == (_Bool)1) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] result_9 == 0 [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0 || is_null_6 == (_Bool)1) [2024-01-29 22:56:29,395 INFO L98 nessWitnessExtractor]: Location invariant before [L71-L71] ((result_9 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,396 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] result_9 == 0 [2024-01-29 22:56:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,397 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (is_null_3 == (_Bool)0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((result_9 == 0) && (result_10 == 0)) && (result_11 == 0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_9 == 0) && (filename_is_null_2 == (_Bool)0) [2024-01-29 22:56:29,398 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] result_9 == 0 [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_9 == 0) && (result_11 == 0) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_9 == 0) && (filename_is_null_2 == (_Bool)0)) && (is_null_0 == (_Bool)0 || is_null_0 == (_Bool)1) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_9 == 0) && (filename_is_null_2 == (_Bool)0)) && (is_null_3 == (_Bool)0 || is_null_3 == (_Bool)1) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_9 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_5 == (_Bool)0) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_9 == 0) && (result_10 == 0) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] ((result_9 == 0) && (filename_is_null_2 == (_Bool)0)) && (filename_is_null_8 == (_Bool)0) [2024-01-29 22:56:29,399 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (result_9 == 0) && (is_null_6 == (_Bool)0) [2024-01-29 22:56:29,417 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-29 22:56:29,531 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] [2024-01-29 22:56:29,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:29,541 INFO L202 MainTranslator]: Completed pre-run [2024-01-29 22:56:29,548 WARN L424 MainDispatcher]: Unable to annotate __assert_fail(const char *__assertion, const char *__file, unsigned int __line, const char *__function) with a witness entry [2024-01-29 22:56:29,550 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:29,677 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-subst.wvr.c[3054,3067] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-29 22:56:29,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-29 22:56:29,697 INFO L206 MainTranslator]: Completed translation [2024-01-29 22:56:29,698 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29 WrapperNode [2024-01-29 22:56:29,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-29 22:56:29,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:29,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-29 22:56:29,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-29 22:56:29,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,760 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 319 [2024-01-29 22:56:29,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-29 22:56:29,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-29 22:56:29,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-29 22:56:29,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-29 22:56:29,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,800 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-29 22:56:29,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-29 22:56:29,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-29 22:56:29,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-29 22:56:29,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-29 22:56:29,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (1/1) ... [2024-01-29 22:56:29,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-29 22:56:29,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-29 22:56:29,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-29 22:56:29,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-29 22:56:29,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-29 22:56:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-29 22:56:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-29 22:56:29,903 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-29 22:56:29,903 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-29 22:56:29,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-29 22:56:29,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-29 22:56:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-29 22:56:29,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-29 22:56:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-29 22:56:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-29 22:56:29,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-29 22:56:29,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-29 22:56:29,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-29 22:56:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-29 22:56:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-29 22:56:29,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-29 22:56:29,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-29 22:56:29,916 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-29 22:56:30,025 INFO L244 CfgBuilder]: Building ICFG [2024-01-29 22:56:30,029 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-29 22:56:30,524 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-29 22:56:30,524 INFO L293 CfgBuilder]: Performing block encoding [2024-01-29 22:56:30,689 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-29 22:56:30,689 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-29 22:56:30,691 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:30 BoogieIcfgContainer [2024-01-29 22:56:30,691 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-29 22:56:30,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-29 22:56:30,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-29 22:56:30,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-29 22:56:30,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 10:56:29" (1/4) ... [2024-01-29 22:56:30,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d77c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 29.01 10:56:29" (2/4) ... [2024-01-29 22:56:30,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d77c61 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 29.01 10:56:29" (3/4) ... [2024-01-29 22:56:30,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62d77c61 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 29.01 10:56:30, skipping insertion in model container [2024-01-29 22:56:30,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 10:56:30" (4/4) ... [2024-01-29 22:56:30,700 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2024-01-29 22:56:30,713 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-29 22:56:30,714 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 112 error locations. [2024-01-29 22:56:30,714 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-29 22:56:30,774 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-29 22:56:30,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 279 transitions, 579 flow [2024-01-29 22:56:30,848 INFO L124 PetriNetUnfolderBase]: 12/276 cut-off events. [2024-01-29 22:56:30,848 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-29 22:56:30,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 276 events. 12/276 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 376 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 247. Up to 2 conditions per place. [2024-01-29 22:56:30,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 277 places, 279 transitions, 579 flow [2024-01-29 22:56:30,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 273 places, 275 transitions, 568 flow [2024-01-29 22:56:30,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-29 22:56:30,868 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;@440387e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-29 22:56:30,868 INFO L358 AbstractCegarLoop]: Starting to check reachability of 130 error locations. [2024-01-29 22:56:30,870 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-29 22:56:30,870 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-29 22:56:30,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-29 22:56:30,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:30,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-29 22:56:30,871 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:30,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 31413, now seen corresponding path program 1 times [2024-01-29 22:56:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380792146] [2024-01-29 22:56:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380792146] [2024-01-29 22:56:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380792146] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:31,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:31,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053639385] [2024-01-29 22:56:31,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:31,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:31,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:31,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:31,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 22:56:31,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 275 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:31,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:31,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 22:56:31,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:32,126 INFO L124 PetriNetUnfolderBase]: 4522/7496 cut-off events. [2024-01-29 22:56:32,126 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-01-29 22:56:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13936 conditions, 7496 events. 4522/7496 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58361 event pairs, 3768 based on Foata normal form. 1/6085 useless extension candidates. Maximal degree in co-relation 12584. Up to 6161 conditions per place. [2024-01-29 22:56:32,178 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2024-01-29 22:56:32,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 666 flow [2024-01-29 22:56:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:32,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-01-29 22:56:32,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8697729988052568 [2024-01-29 22:56:32,196 INFO L175 Difference]: Start difference. First operand has 273 places, 275 transitions, 568 flow. Second operand 3 states and 728 transitions. [2024-01-29 22:56:32,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 666 flow [2024-01-29 22:56:32,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 654 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-29 22:56:32,212 INFO L231 Difference]: Finished difference. Result has 267 places, 273 transitions, 556 flow [2024-01-29 22:56:32,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=267, PETRI_TRANSITIONS=273} [2024-01-29 22:56:32,216 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -6 predicate places. [2024-01-29 22:56:32,217 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 273 transitions, 556 flow [2024-01-29 22:56:32,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:32,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:32,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-29 22:56:32,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-29 22:56:32,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:32,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:32,219 INFO L85 PathProgramCache]: Analyzing trace with hash 974770, now seen corresponding path program 1 times [2024-01-29 22:56:32,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:32,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372631945] [2024-01-29 22:56:32,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:32,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:32,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372631945] [2024-01-29 22:56:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372631945] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:32,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:32,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:32,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171154186] [2024-01-29 22:56:32,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:32,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:32,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:32,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:32,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:32,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-29 22:56:32,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 273 transitions, 556 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-29 22:56:32,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:32,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-29 22:56:32,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:33,164 INFO L124 PetriNetUnfolderBase]: 4522/7495 cut-off events. [2024-01-29 22:56:33,165 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:33,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13754 conditions, 7495 events. 4522/7495 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58446 event pairs, 3768 based on Foata normal form. 0/6085 useless extension candidates. Maximal degree in co-relation 13724. Up to 6162 conditions per place. [2024-01-29 22:56:33,210 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-01-29 22:56:33,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 272 transitions, 658 flow [2024-01-29 22:56:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:33,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8661887694145759 [2024-01-29 22:56:33,213 INFO L175 Difference]: Start difference. First operand has 267 places, 273 transitions, 556 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 272 transitions, 658 flow [2024-01-29 22:56:33,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 272 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:33,219 INFO L231 Difference]: Finished difference. Result has 266 places, 272 transitions, 554 flow [2024-01-29 22:56:33,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=266, PETRI_TRANSITIONS=272} [2024-01-29 22:56:33,222 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -7 predicate places. [2024-01-29 22:56:33,223 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 272 transitions, 554 flow [2024-01-29 22:56:33,223 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-29 22:56:33,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:33,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-29 22:56:33,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-29 22:56:33,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:33,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 30218940, now seen corresponding path program 1 times [2024-01-29 22:56:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806597978] [2024-01-29 22:56:33,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:33,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806597978] [2024-01-29 22:56:33,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806597978] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:33,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:33,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:33,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422798972] [2024-01-29 22:56:33,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:33,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:33,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:33,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:33,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:33,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 22:56:33,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 272 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:33,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:33,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 22:56:33,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:34,113 INFO L124 PetriNetUnfolderBase]: 4522/7493 cut-off events. [2024-01-29 22:56:34,114 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:34,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13750 conditions, 7493 events. 4522/7493 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58358 event pairs, 3768 based on Foata normal form. 2/6085 useless extension candidates. Maximal degree in co-relation 13723. Up to 6161 conditions per place. [2024-01-29 22:56:34,147 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-01-29 22:56:34,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 270 transitions, 650 flow [2024-01-29 22:56:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:34,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685782556750299 [2024-01-29 22:56:34,150 INFO L175 Difference]: Start difference. First operand has 266 places, 272 transitions, 554 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:34,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 270 transitions, 650 flow [2024-01-29 22:56:34,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 270 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:34,153 INFO L231 Difference]: Finished difference. Result has 264 places, 270 transitions, 550 flow [2024-01-29 22:56:34,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=264, PETRI_TRANSITIONS=270} [2024-01-29 22:56:34,155 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -9 predicate places. [2024-01-29 22:56:34,155 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 270 transitions, 550 flow [2024-01-29 22:56:34,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:34,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-29 22:56:34,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-29 22:56:34,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:34,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash 936788089, now seen corresponding path program 1 times [2024-01-29 22:56:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:34,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259524938] [2024-01-29 22:56:34,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:34,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:34,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259524938] [2024-01-29 22:56:34,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259524938] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:34,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:34,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629542758] [2024-01-29 22:56:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:34,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 279 [2024-01-29 22:56:34,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 270 transitions, 550 flow. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:34,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:34,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 279 [2024-01-29 22:56:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:35,262 INFO L124 PetriNetUnfolderBase]: 5679/10337 cut-off events. [2024-01-29 22:56:35,262 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-01-29 22:56:35,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17995 conditions, 10337 events. 5679/10337 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 89127 event pairs, 4657 based on Foata normal form. 0/7851 useless extension candidates. Maximal degree in co-relation 17967. Up to 7540 conditions per place. [2024-01-29 22:56:35,315 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 62 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-01-29 22:56:35,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 269 transitions, 676 flow [2024-01-29 22:56:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 698 transitions. [2024-01-29 22:56:35,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8339307048984468 [2024-01-29 22:56:35,318 INFO L175 Difference]: Start difference. First operand has 264 places, 270 transitions, 550 flow. Second operand 3 states and 698 transitions. [2024-01-29 22:56:35,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 269 transitions, 676 flow [2024-01-29 22:56:35,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 269 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:35,321 INFO L231 Difference]: Finished difference. Result has 263 places, 269 transitions, 548 flow [2024-01-29 22:56:35,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=263, PETRI_TRANSITIONS=269} [2024-01-29 22:56:35,322 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -10 predicate places. [2024-01-29 22:56:35,323 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 269 transitions, 548 flow [2024-01-29 22:56:35,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:35,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-29 22:56:35,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-29 22:56:35,324 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:35,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:35,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1024339501, now seen corresponding path program 1 times [2024-01-29 22:56:35,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:35,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98721309] [2024-01-29 22:56:35,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:35,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98721309] [2024-01-29 22:56:35,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98721309] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:35,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607348958] [2024-01-29 22:56:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:35,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:35,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:35,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-29 22:56:35,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 269 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:35,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:35,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-29 22:56:35,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:36,044 INFO L124 PetriNetUnfolderBase]: 4522/7491 cut-off events. [2024-01-29 22:56:36,044 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:36,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13748 conditions, 7491 events. 4522/7491 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58356 event pairs, 3768 based on Foata normal form. 1/6084 useless extension candidates. Maximal degree in co-relation 13723. Up to 6161 conditions per place. [2024-01-29 22:56:36,088 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-01-29 22:56:36,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 268 transitions, 646 flow [2024-01-29 22:56:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:36,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2024-01-29 22:56:36,090 INFO L175 Difference]: Start difference. First operand has 263 places, 269 transitions, 548 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:36,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 268 transitions, 646 flow [2024-01-29 22:56:36,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 268 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:36,093 INFO L231 Difference]: Finished difference. Result has 262 places, 268 transitions, 546 flow [2024-01-29 22:56:36,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=262, PETRI_TRANSITIONS=268} [2024-01-29 22:56:36,094 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -11 predicate places. [2024-01-29 22:56:36,094 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 268 transitions, 546 flow [2024-01-29 22:56:36,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:36,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:36,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:36,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-29 22:56:36,095 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:36,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1689752552, now seen corresponding path program 1 times [2024-01-29 22:56:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:36,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643964106] [2024-01-29 22:56:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643964106] [2024-01-29 22:56:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643964106] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80480909] [2024-01-29 22:56:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:36,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:36,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-29 22:56:36,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 268 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:36,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:36,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-29 22:56:36,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,052 INFO L124 PetriNetUnfolderBase]: 4522/7490 cut-off events. [2024-01-29 22:56:37,053 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:37,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 7490 events. 4522/7490 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58508 event pairs, 3768 based on Foata normal form. 1/6084 useless extension candidates. Maximal degree in co-relation 13723. Up to 6161 conditions per place. [2024-01-29 22:56:37,090 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-01-29 22:56:37,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 267 transitions, 644 flow [2024-01-29 22:56:37,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:37,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2024-01-29 22:56:37,092 INFO L175 Difference]: Start difference. First operand has 262 places, 268 transitions, 546 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:37,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 267 transitions, 644 flow [2024-01-29 22:56:37,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 267 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,096 INFO L231 Difference]: Finished difference. Result has 261 places, 267 transitions, 544 flow [2024-01-29 22:56:37,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=261, PETRI_TRANSITIONS=267} [2024-01-29 22:56:37,097 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -12 predicate places. [2024-01-29 22:56:37,097 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 267 transitions, 544 flow [2024-01-29 22:56:37,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:37,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-29 22:56:37,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:37,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,098 INFO L85 PathProgramCache]: Analyzing trace with hash -842720565, now seen corresponding path program 1 times [2024-01-29 22:56:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502174562] [2024-01-29 22:56:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502174562] [2024-01-29 22:56:37,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502174562] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:37,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503524252] [2024-01-29 22:56:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:37,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:37,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:37,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:37,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 22:56:37,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 267 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:37,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:37,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 22:56:37,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:37,957 INFO L124 PetriNetUnfolderBase]: 4522/7489 cut-off events. [2024-01-29 22:56:37,957 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:37,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 7489 events. 4522/7489 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58475 event pairs, 3768 based on Foata normal form. 0/6083 useless extension candidates. Maximal degree in co-relation 13723. Up to 6161 conditions per place. [2024-01-29 22:56:37,990 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-01-29 22:56:37,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 266 transitions, 644 flow [2024-01-29 22:56:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:37,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:37,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685782556750299 [2024-01-29 22:56:37,993 INFO L175 Difference]: Start difference. First operand has 261 places, 267 transitions, 544 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:37,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 266 transitions, 644 flow [2024-01-29 22:56:37,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 266 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:37,995 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 542 flow [2024-01-29 22:56:37,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2024-01-29 22:56:37,996 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -13 predicate places. [2024-01-29 22:56:37,997 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 542 flow [2024-01-29 22:56:37,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:37,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:37,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:37,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-29 22:56:37,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:37,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -354532890, now seen corresponding path program 1 times [2024-01-29 22:56:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311848703] [2024-01-29 22:56:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311848703] [2024-01-29 22:56:38,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311848703] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240628440] [2024-01-29 22:56:38,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-29 22:56:38,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 542 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-29 22:56:38,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-29 22:56:38,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:38,681 INFO L124 PetriNetUnfolderBase]: 4522/7488 cut-off events. [2024-01-29 22:56:38,682 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:38,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 7488 events. 4522/7488 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58472 event pairs, 3768 based on Foata normal form. 0/6084 useless extension candidates. Maximal degree in co-relation 13724. Up to 6162 conditions per place. [2024-01-29 22:56:38,715 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-01-29 22:56:38,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 265 transitions, 644 flow [2024-01-29 22:56:38,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:38,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:38,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:38,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8661887694145759 [2024-01-29 22:56:38,718 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 542 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:38,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 265 transitions, 644 flow [2024-01-29 22:56:38,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 265 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:38,721 INFO L231 Difference]: Finished difference. Result has 259 places, 265 transitions, 540 flow [2024-01-29 22:56:38,721 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-29 22:56:38,722 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -14 predicate places. [2024-01-29 22:56:38,722 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 265 transitions, 540 flow [2024-01-29 22:56:38,722 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-29 22:56:38,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:38,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:38,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-29 22:56:38,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:38,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:38,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1894383370, now seen corresponding path program 1 times [2024-01-29 22:56:38,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:38,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440140660] [2024-01-29 22:56:38,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:38,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:38,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440140660] [2024-01-29 22:56:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440140660] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:38,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:38,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77581863] [2024-01-29 22:56:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:38,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 279 [2024-01-29 22:56:38,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 265 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:38,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:38,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 279 [2024-01-29 22:56:38,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:39,415 INFO L124 PetriNetUnfolderBase]: 4522/7487 cut-off events. [2024-01-29 22:56:39,415 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:39,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13744 conditions, 7487 events. 4522/7487 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58473 event pairs, 3768 based on Foata normal form. 1/6084 useless extension candidates. Maximal degree in co-relation 13723. Up to 6161 conditions per place. [2024-01-29 22:56:39,446 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 48 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-01-29 22:56:39,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 264 transitions, 638 flow [2024-01-29 22:56:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 729 transitions. [2024-01-29 22:56:39,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8709677419354839 [2024-01-29 22:56:39,448 INFO L175 Difference]: Start difference. First operand has 259 places, 265 transitions, 540 flow. Second operand 3 states and 729 transitions. [2024-01-29 22:56:39,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 264 transitions, 638 flow [2024-01-29 22:56:39,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 264 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:39,451 INFO L231 Difference]: Finished difference. Result has 258 places, 264 transitions, 538 flow [2024-01-29 22:56:39,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=538, PETRI_PLACES=258, PETRI_TRANSITIONS=264} [2024-01-29 22:56:39,452 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -15 predicate places. [2024-01-29 22:56:39,452 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 264 transitions, 538 flow [2024-01-29 22:56:39,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:39,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:39,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:39,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-29 22:56:39,453 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:39,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1403656769, now seen corresponding path program 1 times [2024-01-29 22:56:39,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:39,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773548479] [2024-01-29 22:56:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:39,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:39,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:39,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773548479] [2024-01-29 22:56:39,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773548479] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:39,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:39,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:39,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112431622] [2024-01-29 22:56:39,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:39,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:39,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:39,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 22:56:39,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 264 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:39,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 22:56:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:40,341 INFO L124 PetriNetUnfolderBase]: 4522/7486 cut-off events. [2024-01-29 22:56:40,341 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:40,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13751 conditions, 7486 events. 4522/7486 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58520 event pairs, 3768 based on Foata normal form. 0/6090 useless extension candidates. Maximal degree in co-relation 13730. Up to 6168 conditions per place. [2024-01-29 22:56:40,378 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 56 selfloop transitions, 2 changer transitions 0/263 dead transitions. [2024-01-29 22:56:40,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 263 transitions, 652 flow [2024-01-29 22:56:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:40,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:40,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-01-29 22:56:40,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-01-29 22:56:40,381 INFO L175 Difference]: Start difference. First operand has 258 places, 264 transitions, 538 flow. Second operand 3 states and 713 transitions. [2024-01-29 22:56:40,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 263 transitions, 652 flow [2024-01-29 22:56:40,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 263 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:40,384 INFO L231 Difference]: Finished difference. Result has 257 places, 263 transitions, 536 flow [2024-01-29 22:56:40,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=257, PETRI_TRANSITIONS=263} [2024-01-29 22:56:40,385 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -16 predicate places. [2024-01-29 22:56:40,385 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 263 transitions, 536 flow [2024-01-29 22:56:40,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:40,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:40,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:40,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-29 22:56:40,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:40,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash -536176183, now seen corresponding path program 1 times [2024-01-29 22:56:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:40,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107938739] [2024-01-29 22:56:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:40,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107938739] [2024-01-29 22:56:40,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107938739] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:40,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703202618] [2024-01-29 22:56:40,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:40,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:40,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:40,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:40,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:40,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 279 [2024-01-29 22:56:40,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 263 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:40,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:40,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 279 [2024-01-29 22:56:40,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:41,910 INFO L124 PetriNetUnfolderBase]: 7008/10968 cut-off events. [2024-01-29 22:56:41,910 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-01-29 22:56:41,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20175 conditions, 10968 events. 7008/10968 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 77763 event pairs, 5657 based on Foata normal form. 1/8509 useless extension candidates. Maximal degree in co-relation 20152. Up to 9069 conditions per place. [2024-01-29 22:56:41,948 INFO L140 encePairwiseOnDemand]: 272/279 looper letters, 74 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-01-29 22:56:41,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 258 transitions, 678 flow [2024-01-29 22:56:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 672 transitions. [2024-01-29 22:56:41,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8028673835125448 [2024-01-29 22:56:41,950 INFO L175 Difference]: Start difference. First operand has 257 places, 263 transitions, 536 flow. Second operand 3 states and 672 transitions. [2024-01-29 22:56:41,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 258 transitions, 678 flow [2024-01-29 22:56:41,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 258 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:41,953 INFO L231 Difference]: Finished difference. Result has 252 places, 258 transitions, 526 flow [2024-01-29 22:56:41,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=252, PETRI_TRANSITIONS=258} [2024-01-29 22:56:41,954 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -21 predicate places. [2024-01-29 22:56:41,954 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 258 transitions, 526 flow [2024-01-29 22:56:41,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:41,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:41,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:41,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-29 22:56:41,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:41,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 558408362, now seen corresponding path program 1 times [2024-01-29 22:56:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:41,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851214099] [2024-01-29 22:56:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:42,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:42,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851214099] [2024-01-29 22:56:42,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851214099] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:42,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:42,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:42,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487978084] [2024-01-29 22:56:42,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:42,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:42,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:42,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:42,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:42,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 279 [2024-01-29 22:56:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 258 transitions, 526 flow. Second operand has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:42,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 279 [2024-01-29 22:56:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:43,705 INFO L124 PetriNetUnfolderBase]: 8691/14794 cut-off events. [2024-01-29 22:56:43,705 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-01-29 22:56:43,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25822 conditions, 14794 events. 8691/14794 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 924. Compared 115917 event pairs, 6850 based on Foata normal form. 0/11391 useless extension candidates. Maximal degree in co-relation 25775. Up to 10879 conditions per place. [2024-01-29 22:56:43,767 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 73 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-01-29 22:56:43,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 674 flow [2024-01-29 22:56:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2024-01-29 22:56:43,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8004778972520908 [2024-01-29 22:56:43,769 INFO L175 Difference]: Start difference. First operand has 252 places, 258 transitions, 526 flow. Second operand 3 states and 670 transitions. [2024-01-29 22:56:43,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 674 flow [2024-01-29 22:56:43,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:43,772 INFO L231 Difference]: Finished difference. Result has 251 places, 257 transitions, 524 flow [2024-01-29 22:56:43,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=251, PETRI_TRANSITIONS=257} [2024-01-29 22:56:43,772 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -22 predicate places. [2024-01-29 22:56:43,773 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 257 transitions, 524 flow [2024-01-29 22:56:43,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.16666666666666) internal successors, (1195), 6 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:43,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:43,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:43,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-29 22:56:43,774 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:43,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:43,774 INFO L85 PathProgramCache]: Analyzing trace with hash 130791035, now seen corresponding path program 1 times [2024-01-29 22:56:43,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:43,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100673923] [2024-01-29 22:56:43,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:43,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100673923] [2024-01-29 22:56:43,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100673923] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318405640] [2024-01-29 22:56:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:43,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:43,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:43,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 22:56:43,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 257 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:43,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:43,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 22:56:43,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:44,600 INFO L124 PetriNetUnfolderBase]: 4522/7479 cut-off events. [2024-01-29 22:56:44,600 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:44,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13744 conditions, 7479 events. 4522/7479 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58515 event pairs, 3768 based on Foata normal form. 0/6089 useless extension candidates. Maximal degree in co-relation 13707. Up to 6167 conditions per place. [2024-01-29 22:56:44,627 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 56 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2024-01-29 22:56:44,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 256 transitions, 638 flow [2024-01-29 22:56:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-01-29 22:56:44,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-01-29 22:56:44,629 INFO L175 Difference]: Start difference. First operand has 251 places, 257 transitions, 524 flow. Second operand 3 states and 713 transitions. [2024-01-29 22:56:44,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 256 transitions, 638 flow [2024-01-29 22:56:44,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 256 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:44,632 INFO L231 Difference]: Finished difference. Result has 250 places, 256 transitions, 522 flow [2024-01-29 22:56:44,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=250, PETRI_TRANSITIONS=256} [2024-01-29 22:56:44,633 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -23 predicate places. [2024-01-29 22:56:44,633 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 256 transitions, 522 flow [2024-01-29 22:56:44,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:44,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:44,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:44,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-29 22:56:44,634 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:44,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:44,634 INFO L85 PathProgramCache]: Analyzing trace with hash -240444344, now seen corresponding path program 1 times [2024-01-29 22:56:44,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:44,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904861402] [2024-01-29 22:56:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:44,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904861402] [2024-01-29 22:56:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904861402] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980878250] [2024-01-29 22:56:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:44,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:44,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:44,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:44,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:44,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-29 22:56:44,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 256 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:44,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:44,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-29 22:56:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:45,331 INFO L124 PetriNetUnfolderBase]: 4522/7478 cut-off events. [2024-01-29 22:56:45,332 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:45,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13737 conditions, 7478 events. 4522/7478 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58492 event pairs, 3768 based on Foata normal form. 0/6083 useless extension candidates. Maximal degree in co-relation 13701. Up to 6161 conditions per place. [2024-01-29 22:56:45,358 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 50 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-01-29 22:56:45,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 255 transitions, 624 flow [2024-01-29 22:56:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 725 transitions. [2024-01-29 22:56:45,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8661887694145759 [2024-01-29 22:56:45,359 INFO L175 Difference]: Start difference. First operand has 250 places, 256 transitions, 522 flow. Second operand 3 states and 725 transitions. [2024-01-29 22:56:45,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 255 transitions, 624 flow [2024-01-29 22:56:45,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 255 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:45,362 INFO L231 Difference]: Finished difference. Result has 249 places, 255 transitions, 520 flow [2024-01-29 22:56:45,362 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-29 22:56:45,363 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -24 predicate places. [2024-01-29 22:56:45,363 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 255 transitions, 520 flow [2024-01-29 22:56:45,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:45,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:45,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:45,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-29 22:56:45,363 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:45,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1136160964, now seen corresponding path program 1 times [2024-01-29 22:56:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:45,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519888900] [2024-01-29 22:56:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519888900] [2024-01-29 22:56:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519888900] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853308055] [2024-01-29 22:56:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:45,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:46,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 279 [2024-01-29 22:56:46,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 255 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:46,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:46,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 279 [2024-01-29 22:56:46,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:47,209 INFO L124 PetriNetUnfolderBase]: 8425/14517 cut-off events. [2024-01-29 22:56:47,209 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-01-29 22:56:47,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25486 conditions, 14517 events. 8425/14517 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 117459 event pairs, 6797 based on Foata normal form. 0/10759 useless extension candidates. Maximal degree in co-relation 25441. Up to 10807 conditions per place. [2024-01-29 22:56:47,265 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 79 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-01-29 22:56:47,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 680 flow [2024-01-29 22:56:47,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2024-01-29 22:56:47,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7861409796893668 [2024-01-29 22:56:47,268 INFO L175 Difference]: Start difference. First operand has 249 places, 255 transitions, 520 flow. Second operand 3 states and 658 transitions. [2024-01-29 22:56:47,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 680 flow [2024-01-29 22:56:47,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 254 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:47,271 INFO L231 Difference]: Finished difference. Result has 248 places, 254 transitions, 518 flow [2024-01-29 22:56:47,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=248, PETRI_TRANSITIONS=254} [2024-01-29 22:56:47,271 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -25 predicate places. [2024-01-29 22:56:47,272 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 254 transitions, 518 flow [2024-01-29 22:56:47,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:47,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:47,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-29 22:56:47,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:47,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 861252493, now seen corresponding path program 1 times [2024-01-29 22:56:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:47,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171541160] [2024-01-29 22:56:47,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:47,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:47,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:47,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171541160] [2024-01-29 22:56:47,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171541160] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:47,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:47,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:47,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598811123] [2024-01-29 22:56:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:47,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:47,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 279 [2024-01-29 22:56:47,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 254 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:47,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:47,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 279 [2024-01-29 22:56:47,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:48,255 INFO L124 PetriNetUnfolderBase]: 4522/7476 cut-off events. [2024-01-29 22:56:48,255 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:48,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13734 conditions, 7476 events. 4522/7476 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58416 event pairs, 3768 based on Foata normal form. 0/6082 useless extension candidates. Maximal degree in co-relation 13700. Up to 6160 conditions per place. [2024-01-29 22:56:48,277 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-01-29 22:56:48,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 253 transitions, 618 flow [2024-01-29 22:56:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-01-29 22:56:48,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8649940262843488 [2024-01-29 22:56:48,279 INFO L175 Difference]: Start difference. First operand has 248 places, 254 transitions, 518 flow. Second operand 3 states and 724 transitions. [2024-01-29 22:56:48,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 253 transitions, 618 flow [2024-01-29 22:56:48,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 253 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:48,282 INFO L231 Difference]: Finished difference. Result has 247 places, 253 transitions, 516 flow [2024-01-29 22:56:48,283 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-29 22:56:48,283 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -26 predicate places. [2024-01-29 22:56:48,283 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 253 transitions, 516 flow [2024-01-29 22:56:48,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:48,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:48,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:48,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-29 22:56:48,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:48,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:48,285 INFO L85 PathProgramCache]: Analyzing trace with hash -200336062, now seen corresponding path program 1 times [2024-01-29 22:56:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:48,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765582380] [2024-01-29 22:56:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:48,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765582380] [2024-01-29 22:56:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765582380] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-29 22:56:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550958990] [2024-01-29 22:56:48,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:48,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-29 22:56:48,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:48,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-29 22:56:48,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-29 22:56:48,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 279 [2024-01-29 22:56:48,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 253 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:48,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:48,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 279 [2024-01-29 22:56:48,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:49,686 INFO L124 PetriNetUnfolderBase]: 7699/12730 cut-off events. [2024-01-29 22:56:49,686 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-01-29 22:56:49,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22770 conditions, 12730 events. 7699/12730 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 97232 event pairs, 6205 based on Foata normal form. 0/9917 useless extension candidates. Maximal degree in co-relation 22728. Up to 9902 conditions per place. [2024-01-29 22:56:49,736 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 74 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-01-29 22:56:49,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 252 transitions, 666 flow [2024-01-29 22:56:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 668 transitions. [2024-01-29 22:56:49,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7980884109916367 [2024-01-29 22:56:49,743 INFO L175 Difference]: Start difference. First operand has 247 places, 253 transitions, 516 flow. Second operand 3 states and 668 transitions. [2024-01-29 22:56:49,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 252 transitions, 666 flow [2024-01-29 22:56:49,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 252 transitions, 662 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:49,746 INFO L231 Difference]: Finished difference. Result has 246 places, 252 transitions, 514 flow [2024-01-29 22:56:49,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=246, PETRI_TRANSITIONS=252} [2024-01-29 22:56:49,747 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -27 predicate places. [2024-01-29 22:56:49,747 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 252 transitions, 514 flow [2024-01-29 22:56:49,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:49,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:49,748 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] [2024-01-29 22:56:49,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-29 22:56:49,748 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:49,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:49,748 INFO L85 PathProgramCache]: Analyzing trace with hash 750600076, now seen corresponding path program 1 times [2024-01-29 22:56:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:49,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825622536] [2024-01-29 22:56:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:49,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:49,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825622536] [2024-01-29 22:56:49,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825622536] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:49,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:49,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419865928] [2024-01-29 22:56:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:49,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:49,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:49,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:49,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 279 [2024-01-29 22:56:49,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 252 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 208.75) internal successors, (835), 4 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:49,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:49,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 279 [2024-01-29 22:56:49,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:50,557 INFO L124 PetriNetUnfolderBase]: 5641/8951 cut-off events. [2024-01-29 22:56:50,557 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-01-29 22:56:50,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16549 conditions, 8951 events. 5641/8951 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 66323 event pairs, 4621 based on Foata normal form. 0/7191 useless extension candidates. Maximal degree in co-relation 16510. Up to 7474 conditions per place. [2024-01-29 22:56:50,592 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 68 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-01-29 22:56:50,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 250 transitions, 650 flow [2024-01-29 22:56:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-01-29 22:56:50,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8243727598566308 [2024-01-29 22:56:50,594 INFO L175 Difference]: Start difference. First operand has 246 places, 252 transitions, 514 flow. Second operand 3 states and 690 transitions. [2024-01-29 22:56:50,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 250 transitions, 650 flow [2024-01-29 22:56:50,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 250 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:50,597 INFO L231 Difference]: Finished difference. Result has 244 places, 250 transitions, 510 flow [2024-01-29 22:56:50,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=244, PETRI_TRANSITIONS=250} [2024-01-29 22:56:50,597 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -29 predicate places. [2024-01-29 22:56:50,597 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 250 transitions, 510 flow [2024-01-29 22:56:50,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.75) internal successors, (835), 4 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:50,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:50,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:56:50,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-29 22:56:50,598 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:50,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:50,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1793766735, now seen corresponding path program 1 times [2024-01-29 22:56:50,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:50,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576700775] [2024-01-29 22:56:50,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:50,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:50,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:50,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576700775] [2024-01-29 22:56:50,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576700775] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:50,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:50,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560815411] [2024-01-29 22:56:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:50,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:56:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:56:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:56:50,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 279 [2024-01-29 22:56:50,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 250 transitions, 510 flow. Second operand has 5 states, 5 states have (on average 198.2) internal successors, (991), 5 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:50,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:50,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 279 [2024-01-29 22:56:50,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:51,771 INFO L124 PetriNetUnfolderBase]: 6327/11764 cut-off events. [2024-01-29 22:56:51,771 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-01-29 22:56:51,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20200 conditions, 11764 events. 6327/11764 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 1055. Compared 104673 event pairs, 5157 based on Foata normal form. 1/9039 useless extension candidates. Maximal degree in co-relation 20136. Up to 8303 conditions per place. [2024-01-29 22:56:51,831 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 77 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-01-29 22:56:51,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 248 transitions, 664 flow [2024-01-29 22:56:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 669 transitions. [2024-01-29 22:56:51,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7992831541218638 [2024-01-29 22:56:51,833 INFO L175 Difference]: Start difference. First operand has 244 places, 250 transitions, 510 flow. Second operand 3 states and 669 transitions. [2024-01-29 22:56:51,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 248 transitions, 664 flow [2024-01-29 22:56:51,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 248 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:51,836 INFO L231 Difference]: Finished difference. Result has 242 places, 248 transitions, 506 flow [2024-01-29 22:56:51,836 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-29 22:56:51,836 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -31 predicate places. [2024-01-29 22:56:51,837 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 248 transitions, 506 flow [2024-01-29 22:56:51,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.2) internal successors, (991), 5 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:51,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:51,837 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] [2024-01-29 22:56:51,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-01-29 22:56:51,838 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:51,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:51,838 INFO L85 PathProgramCache]: Analyzing trace with hash -227805064, now seen corresponding path program 1 times [2024-01-29 22:56:51,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:51,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154206717] [2024-01-29 22:56:51,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:51,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:51,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154206717] [2024-01-29 22:56:51,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154206717] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:51,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:51,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059503644] [2024-01-29 22:56:51,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:51,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:51,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:51,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 22:56:51,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 248 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:51,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:51,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 22:56:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:52,622 INFO L124 PetriNetUnfolderBase]: 4522/7470 cut-off events. [2024-01-29 22:56:52,622 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:52,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13728 conditions, 7470 events. 4522/7470 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58356 event pairs, 3768 based on Foata normal form. 0/6081 useless extension candidates. Maximal degree in co-relation 13679. Up to 6159 conditions per place. [2024-01-29 22:56:52,654 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/247 dead transitions. [2024-01-29 22:56:52,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 247 transitions, 606 flow [2024-01-29 22:56:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:52,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685782556750299 [2024-01-29 22:56:52,656 INFO L175 Difference]: Start difference. First operand has 242 places, 248 transitions, 506 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:52,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 247 transitions, 606 flow [2024-01-29 22:56:52,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 247 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:52,659 INFO L231 Difference]: Finished difference. Result has 241 places, 247 transitions, 504 flow [2024-01-29 22:56:52,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=241, PETRI_TRANSITIONS=247} [2024-01-29 22:56:52,660 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -32 predicate places. [2024-01-29 22:56:52,660 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 247 transitions, 504 flow [2024-01-29 22:56:52,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:52,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:52,660 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] [2024-01-29 22:56:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-01-29 22:56:52,660 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:52,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1527978517, now seen corresponding path program 1 times [2024-01-29 22:56:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432857533] [2024-01-29 22:56:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:52,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:52,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432857533] [2024-01-29 22:56:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432857533] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52082139] [2024-01-29 22:56:52,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:52,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:52,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:52,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:52,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:52,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 279 [2024-01-29 22:56:52,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 247 transitions, 504 flow. Second operand has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:52,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:52,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 279 [2024-01-29 22:56:52,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:53,501 INFO L124 PetriNetUnfolderBase]: 5680/9143 cut-off events. [2024-01-29 22:56:53,501 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-01-29 22:56:53,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16807 conditions, 9143 events. 5680/9143 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 67439 event pairs, 4657 based on Foata normal form. 0/7168 useless extension candidates. Maximal degree in co-relation 16743. Up to 7529 conditions per place. [2024-01-29 22:56:53,541 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 68 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-01-29 22:56:53,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 246 transitions, 642 flow [2024-01-29 22:56:53,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-01-29 22:56:53,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8231780167264038 [2024-01-29 22:56:53,543 INFO L175 Difference]: Start difference. First operand has 241 places, 247 transitions, 504 flow. Second operand 3 states and 689 transitions. [2024-01-29 22:56:53,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 246 transitions, 642 flow [2024-01-29 22:56:53,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 246 transitions, 638 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:53,546 INFO L231 Difference]: Finished difference. Result has 240 places, 246 transitions, 502 flow [2024-01-29 22:56:53,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=240, PETRI_TRANSITIONS=246} [2024-01-29 22:56:53,546 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -33 predicate places. [2024-01-29 22:56:53,546 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 246 transitions, 502 flow [2024-01-29 22:56:53,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:53,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:53,547 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] [2024-01-29 22:56:53,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-01-29 22:56:53,547 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:53,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:53,548 INFO L85 PathProgramCache]: Analyzing trace with hash 122694689, now seen corresponding path program 1 times [2024-01-29 22:56:53,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:53,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329365717] [2024-01-29 22:56:53,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:53,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:53,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329365717] [2024-01-29 22:56:53,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329365717] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:53,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:53,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:53,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350472650] [2024-01-29 22:56:53,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:53,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:53,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:53,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:53,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:53,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 279 [2024-01-29 22:56:53,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 246 transitions, 502 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:53,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:53,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 279 [2024-01-29 22:56:53,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:54,320 INFO L124 PetriNetUnfolderBase]: 4522/7468 cut-off events. [2024-01-29 22:56:54,320 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13733 conditions, 7468 events. 4522/7468 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58417 event pairs, 3768 based on Foata normal form. 0/6088 useless extension candidates. Maximal degree in co-relation 13686. Up to 6166 conditions per place. [2024-01-29 22:56:54,352 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 56 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-01-29 22:56:54,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 245 transitions, 616 flow [2024-01-29 22:56:54,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:54,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-01-29 22:56:54,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8518518518518519 [2024-01-29 22:56:54,353 INFO L175 Difference]: Start difference. First operand has 240 places, 246 transitions, 502 flow. Second operand 3 states and 713 transitions. [2024-01-29 22:56:54,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 245 transitions, 616 flow [2024-01-29 22:56:54,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 245 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:54,356 INFO L231 Difference]: Finished difference. Result has 239 places, 245 transitions, 500 flow [2024-01-29 22:56:54,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=239, PETRI_TRANSITIONS=245} [2024-01-29 22:56:54,356 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -34 predicate places. [2024-01-29 22:56:54,357 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 245 transitions, 500 flow [2024-01-29 22:56:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:54,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:54,357 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] [2024-01-29 22:56:54,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-01-29 22:56:54,357 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:54,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -491431093, now seen corresponding path program 1 times [2024-01-29 22:56:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:54,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930166099] [2024-01-29 22:56:54,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:54,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:54,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930166099] [2024-01-29 22:56:54,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930166099] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:54,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:54,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:54,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943359336] [2024-01-29 22:56:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:54,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:54,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:54,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:54,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:54,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 279 [2024-01-29 22:56:54,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 245 transitions, 500 flow. Second operand has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:54,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:54,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 279 [2024-01-29 22:56:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:55,198 INFO L124 PetriNetUnfolderBase]: 4522/7467 cut-off events. [2024-01-29 22:56:55,199 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-01-29 22:56:55,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13737 conditions, 7467 events. 4522/7467 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58452 event pairs, 3768 based on Foata normal form. 0/6084 useless extension candidates. Maximal degree in co-relation 13680. Up to 6160 conditions per place. [2024-01-29 22:56:55,238 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 61 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-01-29 22:56:55,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 624 flow [2024-01-29 22:56:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:55,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-01-29 22:56:55,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8363201911589009 [2024-01-29 22:56:55,240 INFO L175 Difference]: Start difference. First operand has 239 places, 245 transitions, 500 flow. Second operand 3 states and 700 transitions. [2024-01-29 22:56:55,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 624 flow [2024-01-29 22:56:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 244 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:55,243 INFO L231 Difference]: Finished difference. Result has 238 places, 244 transitions, 498 flow [2024-01-29 22:56:55,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=238, PETRI_TRANSITIONS=244} [2024-01-29 22:56:55,243 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -35 predicate places. [2024-01-29 22:56:55,243 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 244 transitions, 498 flow [2024-01-29 22:56:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.0) internal successors, (860), 4 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:55,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:55,244 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] [2024-01-29 22:56:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-01-29 22:56:55,244 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:55,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1945506138, now seen corresponding path program 1 times [2024-01-29 22:56:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:55,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482978372] [2024-01-29 22:56:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:55,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:55,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482978372] [2024-01-29 22:56:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482978372] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:55,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:55,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920475750] [2024-01-29 22:56:55,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:55,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:55,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:55,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:55,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 279 [2024-01-29 22:56:55,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 244 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:55,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:55,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 279 [2024-01-29 22:56:55,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:56,053 INFO L124 PetriNetUnfolderBase]: 4522/7466 cut-off events. [2024-01-29 22:56:56,053 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-01-29 22:56:56,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13724 conditions, 7466 events. 4522/7466 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 58484 event pairs, 3768 based on Foata normal form. 0/6081 useless extension candidates. Maximal degree in co-relation 13679. Up to 6159 conditions per place. [2024-01-29 22:56:56,084 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-01-29 22:56:56,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 243 transitions, 598 flow [2024-01-29 22:56:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:56,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 727 transitions. [2024-01-29 22:56:56,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8685782556750299 [2024-01-29 22:56:56,086 INFO L175 Difference]: Start difference. First operand has 238 places, 244 transitions, 498 flow. Second operand 3 states and 727 transitions. [2024-01-29 22:56:56,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 243 transitions, 598 flow [2024-01-29 22:56:56,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 243 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:56,089 INFO L231 Difference]: Finished difference. Result has 237 places, 243 transitions, 496 flow [2024-01-29 22:56:56,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=237, PETRI_TRANSITIONS=243} [2024-01-29 22:56:56,089 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -36 predicate places. [2024-01-29 22:56:56,089 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 243 transitions, 496 flow [2024-01-29 22:56:56,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:56,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:56,090 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] [2024-01-29 22:56:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-01-29 22:56:56,090 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:56,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash 181149092, now seen corresponding path program 1 times [2024-01-29 22:56:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963081109] [2024-01-29 22:56:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:56,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:56,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963081109] [2024-01-29 22:56:56,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963081109] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:56,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:56,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:56,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343287002] [2024-01-29 22:56:56,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:56,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:56,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:56,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:56,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 279 [2024-01-29 22:56:56,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 243 transitions, 496 flow. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:56,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:56,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 279 [2024-01-29 22:56:56,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:56,826 INFO L124 PetriNetUnfolderBase]: 5752/9050 cut-off events. [2024-01-29 22:56:56,826 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-29 22:56:56,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16701 conditions, 9050 events. 5752/9050 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 842. Compared 66954 event pairs, 4657 based on Foata normal form. 0/7343 useless extension candidates. Maximal degree in co-relation 16645. Up to 7531 conditions per place. [2024-01-29 22:56:56,857 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 66 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-01-29 22:56:56,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 630 flow [2024-01-29 22:56:56,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:56:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:56:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-01-29 22:56:56,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8279569892473119 [2024-01-29 22:56:56,858 INFO L175 Difference]: Start difference. First operand has 237 places, 243 transitions, 496 flow. Second operand 3 states and 693 transitions. [2024-01-29 22:56:56,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 630 flow [2024-01-29 22:56:56,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 242 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:56,861 INFO L231 Difference]: Finished difference. Result has 236 places, 242 transitions, 494 flow [2024-01-29 22:56:56,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=236, PETRI_TRANSITIONS=242} [2024-01-29 22:56:56,861 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -37 predicate places. [2024-01-29 22:56:56,861 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 242 transitions, 494 flow [2024-01-29 22:56:56,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 4 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:56,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:56,862 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] [2024-01-29 22:56:56,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-01-29 22:56:56,862 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:56,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2134637623, now seen corresponding path program 1 times [2024-01-29 22:56:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039253429] [2024-01-29 22:56:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039253429] [2024-01-29 22:56:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039253429] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:56,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:56,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-29 22:56:56,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551781157] [2024-01-29 22:56:56,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:56,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-29 22:56:56,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:56,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-29 22:56:56,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-29 22:56:57,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 279 [2024-01-29 22:56:57,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 242 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 191.2) internal successors, (956), 5 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:57,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:57,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 279 [2024-01-29 22:56:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:58,199 INFO L124 PetriNetUnfolderBase]: 6763/13485 cut-off events. [2024-01-29 22:56:58,199 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-29 22:56:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22816 conditions, 13485 events. 6763/13485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 130653 event pairs, 1701 based on Foata normal form. 7/11443 useless extension candidates. Maximal degree in co-relation 22767. Up to 3083 conditions per place. [2024-01-29 22:56:58,264 INFO L140 encePairwiseOnDemand]: 255/279 looper letters, 144 selfloop transitions, 13 changer transitions 0/310 dead transitions. [2024-01-29 22:56:58,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 310 transitions, 948 flow [2024-01-29 22:56:58,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-29 22:56:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-29 22:56:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1119 transitions. [2024-01-29 22:56:58,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8021505376344086 [2024-01-29 22:56:58,266 INFO L175 Difference]: Start difference. First operand has 236 places, 242 transitions, 494 flow. Second operand 5 states and 1119 transitions. [2024-01-29 22:56:58,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 310 transitions, 948 flow [2024-01-29 22:56:58,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 310 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-29 22:56:58,270 INFO L231 Difference]: Finished difference. Result has 230 places, 241 transitions, 557 flow [2024-01-29 22:56:58,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=557, PETRI_PLACES=230, PETRI_TRANSITIONS=241} [2024-01-29 22:56:58,271 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -43 predicate places. [2024-01-29 22:56:58,271 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 241 transitions, 557 flow [2024-01-29 22:56:58,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.2) internal successors, (956), 5 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:58,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:58,271 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] [2024-01-29 22:56:58,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-01-29 22:56:58,272 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:58,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1749257765, now seen corresponding path program 1 times [2024-01-29 22:56:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465805950] [2024-01-29 22:56:58,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465805950] [2024-01-29 22:56:58,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465805950] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:58,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:58,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:56:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374489427] [2024-01-29 22:56:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:56:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:58,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:56:58,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:56:58,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 279 [2024-01-29 22:56:58,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 241 transitions, 557 flow. Second operand has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:58,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:58,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 279 [2024-01-29 22:56:58,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:56:59,719 INFO L124 PetriNetUnfolderBase]: 8505/15761 cut-off events. [2024-01-29 22:56:59,719 INFO L125 PetriNetUnfolderBase]: For 4392/4882 co-relation queries the response was YES. [2024-01-29 22:56:59,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31819 conditions, 15761 events. 8505/15761 cut-off events. For 4392/4882 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 138502 event pairs, 2497 based on Foata normal form. 93/14331 useless extension candidates. Maximal degree in co-relation 17088. Up to 6454 conditions per place. [2024-01-29 22:56:59,805 INFO L140 encePairwiseOnDemand]: 270/279 looper letters, 116 selfloop transitions, 14 changer transitions 0/290 dead transitions. [2024-01-29 22:56:59,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 290 transitions, 959 flow [2024-01-29 22:56:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:56:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:56:59,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 912 transitions. [2024-01-29 22:56:59,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8172043010752689 [2024-01-29 22:56:59,807 INFO L175 Difference]: Start difference. First operand has 230 places, 241 transitions, 557 flow. Second operand 4 states and 912 transitions. [2024-01-29 22:56:59,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 290 transitions, 959 flow [2024-01-29 22:56:59,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 290 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-29 22:56:59,815 INFO L231 Difference]: Finished difference. Result has 234 places, 246 transitions, 632 flow [2024-01-29 22:56:59,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=632, PETRI_PLACES=234, PETRI_TRANSITIONS=246} [2024-01-29 22:56:59,816 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -39 predicate places. [2024-01-29 22:56:59,816 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 246 transitions, 632 flow [2024-01-29 22:56:59,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:59,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:56:59,817 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] [2024-01-29 22:56:59,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-01-29 22:56:59,817 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:56:59,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:56:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1607583170, now seen corresponding path program 1 times [2024-01-29 22:56:59,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:56:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888821335] [2024-01-29 22:56:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:56:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:56:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:56:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:56:59,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:56:59,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888821335] [2024-01-29 22:56:59,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888821335] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:56:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:56:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-29 22:56:59,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194676814] [2024-01-29 22:56:59,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:56:59,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-29 22:56:59,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:56:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-29 22:56:59,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-29 22:56:59,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 279 [2024-01-29 22:56:59,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 246 transitions, 632 flow. Second operand has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:56:59,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:56:59,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 279 [2024-01-29 22:56:59,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:00,957 INFO L124 PetriNetUnfolderBase]: 7564/13713 cut-off events. [2024-01-29 22:57:00,957 INFO L125 PetriNetUnfolderBase]: For 6399/6568 co-relation queries the response was YES. [2024-01-29 22:57:00,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31685 conditions, 13713 events. 7564/13713 cut-off events. For 6399/6568 co-relation queries the response was YES. Maximal size of possible extension queue 980. Compared 120403 event pairs, 3259 based on Foata normal form. 38/12014 useless extension candidates. Maximal degree in co-relation 16475. Up to 5214 conditions per place. [2024-01-29 22:57:01,050 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 133 selfloop transitions, 8 changer transitions 0/280 dead transitions. [2024-01-29 22:57:01,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 280 transitions, 1076 flow [2024-01-29 22:57:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-29 22:57:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-29 22:57:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-01-29 22:57:01,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7825567502986858 [2024-01-29 22:57:01,052 INFO L175 Difference]: Start difference. First operand has 234 places, 246 transitions, 632 flow. Second operand 3 states and 655 transitions. [2024-01-29 22:57:01,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 280 transitions, 1076 flow [2024-01-29 22:57:01,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 280 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:01,061 INFO L231 Difference]: Finished difference. Result has 229 places, 246 transitions, 686 flow [2024-01-29 22:57:01,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=229, PETRI_TRANSITIONS=246} [2024-01-29 22:57:01,062 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -44 predicate places. [2024-01-29 22:57:01,062 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 246 transitions, 686 flow [2024-01-29 22:57:01,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:01,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:01,062 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] [2024-01-29 22:57:01,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-01-29 22:57:01,063 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:57:01,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1300828479, now seen corresponding path program 1 times [2024-01-29 22:57:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680083791] [2024-01-29 22:57:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:01,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:01,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:01,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680083791] [2024-01-29 22:57:01,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680083791] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:01,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:01,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:57:01,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431620021] [2024-01-29 22:57:01,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:01,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:01,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:01,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 279 [2024-01-29 22:57:01,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 246 transitions, 686 flow. Second operand has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:01,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:01,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 279 [2024-01-29 22:57:01,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:02,627 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][285], [8#L91true, 220#L56-9true, Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 105#L77-4true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 374#true, 392#true, 388#true]) [2024-01-29 22:57:02,627 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-01-29 22:57:02,627 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-01-29 22:57:02,628 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-01-29 22:57:02,628 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-01-29 22:57:02,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][285], [8#L91true, Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), 220#L56-9true, Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 85#L78-1true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 374#true, 392#true, 388#true]) [2024-01-29 22:57:02,640 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2024-01-29 22:57:02,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2024-01-29 22:57:02,640 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-01-29 22:57:02,640 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-01-29 22:57:02,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][285], [220#L56-9true, Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 192#L50-19true, 105#L77-4true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 374#true, 392#true, 388#true]) [2024-01-29 22:57:02,648 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2024-01-29 22:57:02,648 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-01-29 22:57:02,648 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-01-29 22:57:02,648 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-01-29 22:57:02,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][285], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), 220#L56-9true, Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 192#L50-19true, 85#L78-1true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, 392#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 388#true]) [2024-01-29 22:57:02,653 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-01-29 22:57:02,653 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2024-01-29 22:57:02,653 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2024-01-29 22:57:02,653 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-01-29 22:57:02,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][294], [220#L56-9true, Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), 122#L46true, Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 105#L77-4true, 40#thread2EXITtrue, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 374#true, 392#true, 388#true]) [2024-01-29 22:57:02,659 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-01-29 22:57:02,659 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][294], [220#L56-9true, Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), 77#L52true, 122#L46true, Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 105#L77-4true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 392#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 374#true, 388#true]) [2024-01-29 22:57:02,660 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2024-01-29 22:57:02,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][294], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), 220#L56-9true, Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), 122#L46true, Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 77#L52true, 85#L78-1true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, 392#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 388#true]) [2024-01-29 22:57:02,660 INFO L294 olderBase$Statistics]: this new event has 133 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][294], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), 220#L56-9true, Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), 122#L46true, Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 40#thread2EXITtrue, 85#L78-1true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, 392#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 388#true]) [2024-01-29 22:57:02,661 INFO L294 olderBase$Statistics]: this new event has 134 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-01-29 22:57:02,661 INFO L124 PetriNetUnfolderBase]: 9059/18195 cut-off events. [2024-01-29 22:57:02,661 INFO L125 PetriNetUnfolderBase]: For 9447/9773 co-relation queries the response was YES. [2024-01-29 22:57:02,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40555 conditions, 18195 events. 9059/18195 cut-off events. For 9447/9773 co-relation queries the response was YES. Maximal size of possible extension queue 1197. Compared 178225 event pairs, 2402 based on Foata normal form. 77/16024 useless extension candidates. Maximal degree in co-relation 20829. Up to 6072 conditions per place. [2024-01-29 22:57:02,770 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 124 selfloop transitions, 25 changer transitions 0/298 dead transitions. [2024-01-29 22:57:02,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 298 transitions, 1170 flow [2024-01-29 22:57:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-29 22:57:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-29 22:57:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 899 transitions. [2024-01-29 22:57:02,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2024-01-29 22:57:02,773 INFO L175 Difference]: Start difference. First operand has 229 places, 246 transitions, 686 flow. Second operand 4 states and 899 transitions. [2024-01-29 22:57:02,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 298 transitions, 1170 flow [2024-01-29 22:57:02,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 298 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-29 22:57:02,790 INFO L231 Difference]: Finished difference. Result has 231 places, 252 transitions, 814 flow [2024-01-29 22:57:02,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=814, PETRI_PLACES=231, PETRI_TRANSITIONS=252} [2024-01-29 22:57:02,791 INFO L281 CegarLoopForPetriNet]: 273 programPoint places, -42 predicate places. [2024-01-29 22:57:02,791 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 252 transitions, 814 flow [2024-01-29 22:57:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:02,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-29 22:57:02,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-29 22:57:02,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-01-29 22:57:02,792 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 127 more)] === [2024-01-29 22:57:02,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-29 22:57:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1670978056, now seen corresponding path program 1 times [2024-01-29 22:57:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-29 22:57:02,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979297456] [2024-01-29 22:57:02,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-29 22:57:02,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-29 22:57:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-29 22:57:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-29 22:57:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-29 22:57:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979297456] [2024-01-29 22:57:02,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979297456] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-29 22:57:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-29 22:57:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-29 22:57:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935983169] [2024-01-29 22:57:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-29 22:57:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-29 22:57:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-29 22:57:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-29 22:57:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-29 22:57:03,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 279 [2024-01-29 22:57:03,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 252 transitions, 814 flow. Second operand has 4 states, 4 states have (on average 200.5) internal successors, (802), 4 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-29 22:57:03,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-29 22:57:03,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 279 [2024-01-29 22:57:03,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-29 22:57:03,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][246], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 84#thread3EXITtrue, 105#L77-4true, Black: 395#(and (= (* 256 (div ~filename_is_null_2~0 256)) ~filename_is_null_2~0) (= ~result_9~0 0) (= ~result_11~0 0)), Black: 394#(and (= ~result_9~0 0) (= ~result_11~0 0)), 398#true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 392#true, 23#$Ultimate##0true]) [2024-01-29 22:57:03,592 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-01-29 22:57:03,592 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-01-29 22:57:03,592 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-01-29 22:57:03,592 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-01-29 22:57:03,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][246], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 105#L77-4true, Black: 395#(and (= (* 256 (div ~filename_is_null_2~0 256)) ~filename_is_null_2~0) (= ~result_9~0 0) (= ~result_11~0 0)), Black: 394#(and (= ~result_9~0 0) (= ~result_11~0 0)), 398#true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 392#true, 204#L58true, 23#$Ultimate##0true]) [2024-01-29 22:57:03,593 INFO L294 olderBase$Statistics]: this new event has 114 ancestors and is cut-off event [2024-01-29 22:57:03,593 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-01-29 22:57:03,593 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-01-29 22:57:03,593 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2024-01-29 22:57:03,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][246], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, Black: 395#(and (= (* 256 (div ~filename_is_null_2~0 256)) ~filename_is_null_2~0) (= ~result_9~0 0) (= ~result_11~0 0)), Black: 394#(and (= ~result_9~0 0) (= ~result_11~0 0)), 85#L78-1true, 398#true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 392#true, 204#L58true, 23#$Ultimate##0true]) [2024-01-29 22:57:03,721 INFO L294 olderBase$Statistics]: this new event has 115 ancestors and is cut-off event [2024-01-29 22:57:03,721 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2024-01-29 22:57:03,721 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-01-29 22:57:03,721 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2024-01-29 22:57:03,721 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][246], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 84#thread3EXITtrue, Black: 395#(and (= (* 256 (div ~filename_is_null_2~0 256)) ~filename_is_null_2~0) (= ~result_9~0 0) (= ~result_11~0 0)), Black: 394#(and (= ~result_9~0 0) (= ~result_11~0 0)), 85#L78-1true, 398#true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 374#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), 392#true, 23#$Ultimate##0true]) [2024-01-29 22:57:03,722 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2024-01-29 22:57:03,722 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event [2024-01-29 22:57:03,722 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2024-01-29 22:57:03,722 INFO L297 olderBase$Statistics]: existing Event has 112 ancestors and is cut-off event [2024-01-29 22:57:04,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] L44-22-->L46: Formula: (= v_~result_9~0_144 |v_thread1Thread1of1ForFork2_#t~ite5#1_3|) InVars {thread1Thread1of1ForFork2_#t~ite5#1=|v_thread1Thread1of1ForFork2_#t~ite5#1_3|} OutVars{thread1Thread1of1ForFork2_#t~ite4#1=|v_thread1Thread1of1ForFork2_#t~ite4#1_3|, thread1Thread1of1ForFork2_#t~ret1#1=|v_thread1Thread1of1ForFork2_#t~ret1#1_1|, thread1Thread1of1ForFork2_#t~ite2#1=|v_thread1Thread1of1ForFork2_#t~ite2#1_1|, ~result_9~0=v_~result_9~0_144, thread1Thread1of1ForFork2_#t~ite3#1=|v_thread1Thread1of1ForFork2_#t~ite3#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~ret1#1, thread1Thread1of1ForFork2_#t~ite2#1, thread1Thread1of1ForFork2_#t~ite3#1, thread1Thread1of1ForFork2_#t~ite5#1, thread1Thread1of1ForFork2_#t~ite4#1, ~result_9~0][271], [Black: 385#(and (= ~result_9~0 0) (= ~is_null_0~0 (* 256 (div ~is_null_0~0 256))) (= ~result_11~0 0)), 220#L56-9true, Black: 384#(and (= ~result_9~0 0) (= ~result_11~0 0)), Black: 390#(and (= ~result_9~0 0) (= ~result_10~0 0)), 122#L46true, 105#L77-4true, Black: 395#(and (= (* 256 (div ~filename_is_null_2~0 256)) ~filename_is_null_2~0) (= ~result_9~0 0) (= ~result_11~0 0)), Black: 394#(and (= ~result_9~0 0) (= ~result_11~0 0)), 398#true, 103#L90true, Black: 378#(and (= ~filename_is_null_5~0 (* 256 (div ~filename_is_null_5~0 256))) (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0)), Black: 376#(and (= ~result_9~0 0) (= ~result_11~0 0)), 392#true, 374#true, Black: 377#(and (= ~result_9~0 0) (= (* (div ~filename_is_null_8~0 256) 256) ~filename_is_null_8~0) (= ~result_11~0 0))]) [2024-01-29 22:57:04,058 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2024-01-29 22:57:04,058 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-01-29 22:57:04,058 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2024-01-29 22:57:04,058 INFO L297 olderBase$Statistics]: existing Event has 114 ancestors and is cut-off event