/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:21:52,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:21:52,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:21:52,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:21:52,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:21:52,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:21:52,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:21:52,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:21:52,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:21:52,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:21:52,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:21:52,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:21:52,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:21:52,956 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:21:52,957 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:21:52,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:21:52,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:21:52,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:21:52,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:21:52,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:21:52,961 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:21:52,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:21:52,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:21:52,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:21:52,967 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:21:52,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:21:52,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:21:52,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:21:52,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:21:52,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:21:52,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:21:52,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:21:52,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:21:52,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:21:52,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:21:52,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:21:52,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:21:52,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:21:52,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:21:52,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:21:52,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:21:52,979 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 23:21:53,006 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:21:53,006 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:21:53,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:21:53,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:21:53,008 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:21:53,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:21:53,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:21:53,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:21:53,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:21:53,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:21:53,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:21:53,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:21:53,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:21:53,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:21:53,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:21:53,012 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-05 23:21:53,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:21:53,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:21:53,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:21:53,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:21:53,297 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:21:53,298 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:21:54,368 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:21:54,590 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:21:54,591 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:21:54,600 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99f1fa1c/a35c712251cc4a39894107896e7aeff9/FLAG33c7ddb80 [2022-12-05 23:21:54,614 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99f1fa1c/a35c712251cc4a39894107896e7aeff9 [2022-12-05 23:21:54,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:21:54,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:21:54,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:21:54,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:21:54,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:21:54,620 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:54,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ff01c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54, skipping insertion in model container [2022-12-05 23:21:54,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:54,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:21:54,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:21:54,769 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:21:54,847 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,848 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,849 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,852 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,853 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,858 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:21:54,866 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:21:54,873 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i[975,988] [2022-12-05 23:21:54,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:21:54,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:21:54,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:21:54,938 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:21:54,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54 WrapperNode [2022-12-05 23:21:54,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:21:54,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:21:54,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:21:54,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:21:54,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:54,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:54,989 INFO L138 Inliner]: procedures = 177, calls = 66, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-12-05 23:21:54,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:21:54,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:21:54,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:21:54,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:21:54,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:54,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,024 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:21:55,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:21:55,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:21:55,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:21:55,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (1/1) ... [2022-12-05 23:21:55,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:21:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:21:55,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-05 23:21:55,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:21:55,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:21:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:21:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:21:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 23:21:55,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:21:55,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:21:55,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:21:55,113 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:21:55,242 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:21:55,244 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:21:55,411 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:21:55,416 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:21:55,416 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:21:55,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:21:55 BoogieIcfgContainer [2022-12-05 23:21:55,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:21:55,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:21:55,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:21:55,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:21:55,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:21:54" (1/3) ... [2022-12-05 23:21:55,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0dd2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:21:55, skipping insertion in model container [2022-12-05 23:21:55,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:21:54" (2/3) ... [2022-12-05 23:21:55,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0dd2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:21:55, skipping insertion in model container [2022-12-05 23:21:55,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:21:55" (3/3) ... [2022-12-05 23:21:55,422 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2022-12-05 23:21:55,441 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:21:55,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 23:21:55,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:21:55,512 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:21:55,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 104 transitions, 228 flow [2022-12-05 23:21:55,601 INFO L130 PetriNetUnfolder]: 2/100 cut-off events. [2022-12-05 23:21:55,601 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:55,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-12-05 23:21:55,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 104 transitions, 228 flow [2022-12-05 23:21:55,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 86 transitions, 184 flow [2022-12-05 23:21:55,611 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:55,634 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 86 transitions, 184 flow [2022-12-05 23:21:55,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 86 transitions, 184 flow [2022-12-05 23:21:55,670 INFO L130 PetriNetUnfolder]: 1/86 cut-off events. [2022-12-05 23:21:55,671 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:55,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 86 events. 1/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2022-12-05 23:21:55,673 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 86 transitions, 184 flow [2022-12-05 23:21:55,673 INFO L188 LiptonReduction]: Number of co-enabled transitions 1704 [2022-12-05 23:21:57,895 INFO L203 LiptonReduction]: Total number of compositions: 64 [2022-12-05 23:21:57,906 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:21:57,910 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=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2a671855, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:21:57,910 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 23:21:57,914 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:21:57,914 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:57,914 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:57,914 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:57,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:57,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:57,917 INFO L85 PathProgramCache]: Analyzing trace with hash 359997830, now seen corresponding path program 1 times [2022-12-05 23:21:57,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:57,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124029563] [2022-12-05 23:21:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:58,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124029563] [2022-12-05 23:21:58,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124029563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:58,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:58,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:21:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35164182] [2022-12-05 23:21:58,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:58,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:21:58,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:58,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:21:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:21:58,323 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-05 23:21:58,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-05 23:21:58,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:58,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-05 23:21:58,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:58,433 INFO L130 PetriNetUnfolder]: 700/1137 cut-off events. [2022-12-05 23:21:58,434 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2022-12-05 23:21:58,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2244 conditions, 1137 events. 700/1137 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5671 event pairs, 416 based on Foata normal form. 1/1138 useless extension candidates. Maximal degree in co-relation 2232. Up to 1013 conditions per place. [2022-12-05 23:21:58,441 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 24 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2022-12-05 23:21:58,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 145 flow [2022-12-05 23:21:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:21:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:21:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-05 23:21:58,448 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6376811594202898 [2022-12-05 23:21:58,450 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 58 flow. Second operand 3 states and 44 transitions. [2022-12-05 23:21:58,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 145 flow [2022-12-05 23:21:58,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 23:21:58,453 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2022-12-05 23:21:58,456 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-05 23:21:58,456 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:58,457 INFO L89 Accepts]: Start accepts. Operand has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,458 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:58,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:58,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,468 INFO L130 PetriNetUnfolder]: 45/136 cut-off events. [2022-12-05 23:21:58,468 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:21:58,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 136 events. 45/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 597 event pairs, 23 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 219. Up to 76 conditions per place. [2022-12-05 23:21:58,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-05 23:21:58,487 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:58,488 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 23:21:58,488 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 85 flow [2022-12-05 23:21:58,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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) [2022-12-05 23:21:58,488 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:58,488 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:58,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:21:58,489 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:58,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1724969940, now seen corresponding path program 1 times [2022-12-05 23:21:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:58,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138385597] [2022-12-05 23:21:58,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:58,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:58,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138385597] [2022-12-05 23:21:58,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138385597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:58,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:58,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:21:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699807603] [2022-12-05 23:21:58,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:58,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:21:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:58,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:21:58,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:21:58,610 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 22 [2022-12-05 23:21:58,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-12-05 23:21:58,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:58,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 22 [2022-12-05 23:21:58,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:58,696 INFO L130 PetriNetUnfolder]: 623/1021 cut-off events. [2022-12-05 23:21:58,697 INFO L131 PetriNetUnfolder]: For 200/200 co-relation queries the response was YES. [2022-12-05 23:21:58,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 1021 events. 623/1021 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5123 event pairs, 177 based on Foata normal form. 26/1042 useless extension candidates. Maximal degree in co-relation 2425. Up to 720 conditions per place. [2022-12-05 23:21:58,702 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 30 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-05 23:21:58,702 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 183 flow [2022-12-05 23:21:58,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:21:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:21:58,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-12-05 23:21:58,703 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-05 23:21:58,703 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 85 flow. Second operand 3 states and 42 transitions. [2022-12-05 23:21:58,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 183 flow [2022-12-05 23:21:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:21:58,704 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,705 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2022-12-05 23:21:58,705 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-05 23:21:58,705 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:58,705 INFO L89 Accepts]: Start accepts. Operand has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,706 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:58,706 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:58,706 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,712 INFO L130 PetriNetUnfolder]: 29/97 cut-off events. [2022-12-05 23:21:58,712 INFO L131 PetriNetUnfolder]: For 15/35 co-relation queries the response was YES. [2022-12-05 23:21:58,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 97 events. 29/97 cut-off events. For 15/35 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 370 event pairs, 14 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 177. Up to 53 conditions per place. [2022-12-05 23:21:58,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-05 23:21:58,714 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:58,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-05 23:21:58,715 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 91 flow [2022-12-05 23:21:58,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2022-12-05 23:21:58,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:58,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:58,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:21:58,716 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1724970281, now seen corresponding path program 1 times [2022-12-05 23:21:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:58,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14131604] [2022-12-05 23:21:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:58,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:58,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:58,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14131604] [2022-12-05 23:21:58,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14131604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:58,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:58,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:21:58,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749045127] [2022-12-05 23:21:58,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:58,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:21:58,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:21:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:21:58,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 23:21:58,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-05 23:21:58,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:58,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 23:21:58,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:58,999 INFO L130 PetriNetUnfolder]: 1240/1913 cut-off events. [2022-12-05 23:21:59,000 INFO L131 PetriNetUnfolder]: For 903/903 co-relation queries the response was YES. [2022-12-05 23:21:59,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 1913 events. 1240/1913 cut-off events. For 903/903 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10405 event pairs, 172 based on Foata normal form. 72/1975 useless extension candidates. Maximal degree in co-relation 4796. Up to 733 conditions per place. [2022-12-05 23:21:59,008 INFO L137 encePairwiseOnDemand]: 15/22 looper letters, 50 selfloop transitions, 12 changer transitions 0/65 dead transitions. [2022-12-05 23:21:59,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 332 flow [2022-12-05 23:21:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:21:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:21:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-05 23:21:59,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6909090909090909 [2022-12-05 23:21:59,010 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 91 flow. Second operand 5 states and 76 transitions. [2022-12-05 23:21:59,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 332 flow [2022-12-05 23:21:59,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:21:59,024 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,024 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-05 23:21:59,025 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-05 23:21:59,025 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:59,025 INFO L89 Accepts]: Start accepts. Operand has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,026 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:59,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:59,026 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,035 INFO L130 PetriNetUnfolder]: 44/150 cut-off events. [2022-12-05 23:21:59,035 INFO L131 PetriNetUnfolder]: For 143/409 co-relation queries the response was YES. [2022-12-05 23:21:59,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 150 events. 44/150 cut-off events. For 143/409 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 753 event pairs, 6 based on Foata normal form. 1/140 useless extension candidates. Maximal degree in co-relation 411. Up to 78 conditions per place. [2022-12-05 23:21:59,036 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,036 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-05 23:21:59,041 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:59,042 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 23:21:59,042 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 172 flow [2022-12-05 23:21:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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) [2022-12-05 23:21:59,042 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:59,042 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:21:59,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 129172197, now seen corresponding path program 1 times [2022-12-05 23:21:59,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:59,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657215548] [2022-12-05 23:21:59,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:59,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657215548] [2022-12-05 23:21:59,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657215548] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:59,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:59,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:21:59,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180013388] [2022-12-05 23:21:59,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:59,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:21:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:21:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:21:59,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 23:21:59,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-05 23:21:59,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:59,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 23:21:59,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:59,252 INFO L130 PetriNetUnfolder]: 1325/2115 cut-off events. [2022-12-05 23:21:59,253 INFO L131 PetriNetUnfolder]: For 3091/3091 co-relation queries the response was YES. [2022-12-05 23:21:59,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 2115 events. 1325/2115 cut-off events. For 3091/3091 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 12470 event pairs, 313 based on Foata normal form. 70/2151 useless extension candidates. Maximal degree in co-relation 6389. Up to 822 conditions per place. [2022-12-05 23:21:59,260 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 40 selfloop transitions, 3 changer transitions 10/56 dead transitions. [2022-12-05 23:21:59,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 358 flow [2022-12-05 23:21:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:21:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:21:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-05 23:21:59,261 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2022-12-05 23:21:59,261 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 172 flow. Second operand 4 states and 57 transitions. [2022-12-05 23:21:59,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 358 flow [2022-12-05 23:21:59,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 350 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 23:21:59,264 INFO L231 Difference]: Finished difference. Result has 45 places, 25 transitions, 126 flow [2022-12-05 23:21:59,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=45, PETRI_TRANSITIONS=25} [2022-12-05 23:21:59,265 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2022-12-05 23:21:59,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:59,265 INFO L89 Accepts]: Start accepts. Operand has 45 places, 25 transitions, 126 flow [2022-12-05 23:21:59,265 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:59,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:59,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 25 transitions, 126 flow [2022-12-05 23:21:59,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 25 transitions, 126 flow [2022-12-05 23:21:59,270 INFO L130 PetriNetUnfolder]: 13/59 cut-off events. [2022-12-05 23:21:59,270 INFO L131 PetriNetUnfolder]: For 82/106 co-relation queries the response was YES. [2022-12-05 23:21:59,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 59 events. 13/59 cut-off events. For 82/106 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 204 event pairs, 9 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 167. Up to 29 conditions per place. [2022-12-05 23:21:59,271 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 126 flow [2022-12-05 23:21:59,271 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-05 23:21:59,310 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [313] $Ultimate##0-->L736: Formula: (and (= v_~x~0_26 1) (= v_~a~0_27 v_~__unbuffered_p0_EAX~0_46) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|)) InVars {~a~0=v_~a~0_27, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|} OutVars{~a~0=v_~a~0_27, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~x~0=v_~x~0_26, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~x~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] and [257] $Ultimate##0-->L748: Formula: (and (= v_~__unbuffered_p1_EAX~0_4 v_~x~0_4) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_4} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_4, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p1_EAX~0] [2022-12-05 23:21:59,344 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:21:59,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-05 23:21:59,345 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 24 transitions, 132 flow [2022-12-05 23:21:59,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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) [2022-12-05 23:21:59,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:59,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:59,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:21:59,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -620273117, now seen corresponding path program 1 times [2022-12-05 23:21:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:59,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456544195] [2022-12-05 23:21:59,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:59,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:59,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456544195] [2022-12-05 23:21:59,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456544195] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:59,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:59,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:21:59,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900315260] [2022-12-05 23:21:59,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:59,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:21:59,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:59,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:21:59,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:21:59,431 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2022-12-05 23:21:59,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 24 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-05 23:21:59,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:59,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2022-12-05 23:21:59,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:59,493 INFO L130 PetriNetUnfolder]: 398/672 cut-off events. [2022-12-05 23:21:59,493 INFO L131 PetriNetUnfolder]: For 1640/1640 co-relation queries the response was YES. [2022-12-05 23:21:59,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2282 conditions, 672 events. 398/672 cut-off events. For 1640/1640 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3117 event pairs, 160 based on Foata normal form. 12/677 useless extension candidates. Maximal degree in co-relation 2263. Up to 443 conditions per place. [2022-12-05 23:21:59,497 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 27 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-05 23:21:59,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 240 flow [2022-12-05 23:21:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:21:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:21:59,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:21:59,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-05 23:21:59,498 INFO L175 Difference]: Start difference. First operand has 43 places, 24 transitions, 132 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:21:59,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 240 flow [2022-12-05 23:21:59,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 178 flow, removed 17 selfloop flow, removed 8 redundant places. [2022-12-05 23:21:59,501 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2022-12-05 23:21:59,501 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-05 23:21:59,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:59,502 INFO L89 Accepts]: Start accepts. Operand has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,502 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:59,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:59,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,507 INFO L130 PetriNetUnfolder]: 10/56 cut-off events. [2022-12-05 23:21:59,507 INFO L131 PetriNetUnfolder]: For 20/33 co-relation queries the response was YES. [2022-12-05 23:21:59,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 56 events. 10/56 cut-off events. For 20/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 193 event pairs, 3 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 112. Up to 24 conditions per place. [2022-12-05 23:21:59,507 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,507 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-05 23:21:59,509 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:21:59,510 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-05 23:21:59,510 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 97 flow [2022-12-05 23:21:59,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2022-12-05 23:21:59,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:59,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:59,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:21:59,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1934430122, now seen corresponding path program 1 times [2022-12-05 23:21:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:59,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702999996] [2022-12-05 23:21:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:59,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:59,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702999996] [2022-12-05 23:21:59,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702999996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:59,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:59,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:21:59,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679237712] [2022-12-05 23:21:59,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:59,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:21:59,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:21:59,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:21:59,588 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 23:21:59,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-05 23:21:59,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:59,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 23:21:59,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:59,674 INFO L130 PetriNetUnfolder]: 618/1010 cut-off events. [2022-12-05 23:21:59,674 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2022-12-05 23:21:59,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 1010 events. 618/1010 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4867 event pairs, 178 based on Foata normal form. 36/1039 useless extension candidates. Maximal degree in co-relation 2599. Up to 367 conditions per place. [2022-12-05 23:21:59,678 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 33 selfloop transitions, 3 changer transitions 4/42 dead transitions. [2022-12-05 23:21:59,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 228 flow [2022-12-05 23:21:59,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:21:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:21:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:21:59,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2022-12-05 23:21:59,679 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 97 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:21:59,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 228 flow [2022-12-05 23:21:59,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:21:59,680 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 99 flow [2022-12-05 23:21:59,681 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-05 23:21:59,681 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-05 23:21:59,681 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:59,681 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 99 flow [2022-12-05 23:21:59,682 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:59,682 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:59,682 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 99 flow [2022-12-05 23:21:59,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 23 transitions, 99 flow [2022-12-05 23:21:59,685 INFO L130 PetriNetUnfolder]: 4/36 cut-off events. [2022-12-05 23:21:59,685 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 23:21:59,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 36 events. 4/36 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 77. Up to 14 conditions per place. [2022-12-05 23:21:59,685 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 23 transitions, 99 flow [2022-12-05 23:21:59,685 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-05 23:21:59,720 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] $Ultimate##0-->L751: Formula: (and (= |v_P1Thread1of1ForFork2_#in~arg.base_25| v_P1Thread1of1ForFork2_~arg.base_25) (= v_P0Thread1of1ForFork0_~arg.offset_25 |v_P0Thread1of1ForFork0_#in~arg.offset_25|) (= v_~x~0_36 v_~__unbuffered_p1_EAX~0_52) (= v_~y~0_33 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_25| v_P1Thread1of1ForFork2_~arg.offset_25) (= v_P0Thread1of1ForFork0_~arg.base_25 |v_P0Thread1of1ForFork0_#in~arg.base_25|) (= v_~a~0_39 v_~__unbuffered_p0_EAX~0_56) (= v_~x~0_36 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_25|, ~a~0=v_~a~0_39, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_25|} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_25, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_25|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_25, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_25|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_25, ~a~0=v_~a~0_39, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_52, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_25|, ~y~0=v_~y~0_33, ~x~0=v_~x~0_36, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_25} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] and [299] $Ultimate##0-->L763: Formula: (and (= |v_P2Thread1of1ForFork3_#in~arg.offset_5| v_P2Thread1of1ForFork3_~arg.offset_5) (= v_P2Thread1of1ForFork3_~arg.base_5 |v_P2Thread1of1ForFork3_#in~arg.base_5|) (= v_~y~0_11 v_~__unbuffered_p2_EAX~0_21)) InVars {P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_5|, ~y~0=v_~y~0_11, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_5, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_5|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_5, ~y~0=v_~y~0_11, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset] [2022-12-05 23:21:59,774 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:21:59,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-05 23:21:59,775 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 107 flow [2022-12-05 23:21:59,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2022-12-05 23:21:59,775 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:21:59,775 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:21:59,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:21:59,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 23:21:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:21:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash 466377354, now seen corresponding path program 1 times [2022-12-05 23:21:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:21:59,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358659118] [2022-12-05 23:21:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:21:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:21:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:21:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 23:21:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:21:59,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358659118] [2022-12-05 23:21:59,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358659118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:21:59,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:21:59,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:21:59,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070796587] [2022-12-05 23:21:59,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:21:59,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:21:59,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:21:59,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:21:59,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:21:59,862 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 23:21:59,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-12-05 23:21:59,862 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:21:59,862 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 23:21:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:21:59,917 INFO L130 PetriNetUnfolder]: 371/612 cut-off events. [2022-12-05 23:21:59,917 INFO L131 PetriNetUnfolder]: For 944/946 co-relation queries the response was YES. [2022-12-05 23:21:59,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 612 events. 371/612 cut-off events. For 944/946 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2621 event pairs, 185 based on Foata normal form. 32/634 useless extension candidates. Maximal degree in co-relation 1640. Up to 276 conditions per place. [2022-12-05 23:21:59,919 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 17 selfloop transitions, 3 changer transitions 14/35 dead transitions. [2022-12-05 23:21:59,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 221 flow [2022-12-05 23:21:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:21:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:21:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-05 23:21:59,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2022-12-05 23:21:59,921 INFO L175 Difference]: Start difference. First operand has 41 places, 23 transitions, 107 flow. Second operand 4 states and 42 transitions. [2022-12-05 23:21:59,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 221 flow [2022-12-05 23:21:59,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 186 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-05 23:21:59,922 INFO L231 Difference]: Finished difference. Result has 41 places, 18 transitions, 74 flow [2022-12-05 23:21:59,922 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=18} [2022-12-05 23:21:59,922 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-05 23:21:59,922 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:21:59,922 INFO L89 Accepts]: Start accepts. Operand has 41 places, 18 transitions, 74 flow [2022-12-05 23:21:59,923 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:21:59,923 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:21:59,923 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 18 transitions, 74 flow [2022-12-05 23:21:59,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 18 transitions, 74 flow [2022-12-05 23:21:59,925 INFO L130 PetriNetUnfolder]: 0/18 cut-off events. [2022-12-05 23:21:59,925 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:21:59,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 18 events. 0/18 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 14 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-05 23:21:59,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 18 transitions, 74 flow [2022-12-05 23:21:59,925 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-05 23:21:59,990 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:21:59,993 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [318] $Ultimate##0-->L781: Formula: (and (= v_~a~0_49 1) (= v_P3Thread1of1ForFork1_~arg.offset_15 |v_P3Thread1of1ForFork1_#in~arg.offset_15|) (= v_P3Thread1of1ForFork1_~arg.base_15 |v_P3Thread1of1ForFork1_#in~arg.base_15|) (= v_~z~0_32 v_~__unbuffered_p3_EAX~0_44)) InVars {P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~z~0=v_~z~0_32, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|} OutVars{~a~0=v_~a~0_49, P3Thread1of1ForFork1_#in~arg.offset=|v_P3Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_44, ~z~0=v_~z~0_32, P3Thread1of1ForFork1_~arg.offset=v_P3Thread1of1ForFork1_~arg.offset_15, P3Thread1of1ForFork1_#in~arg.base=|v_P3Thread1of1ForFork1_#in~arg.base_15|, P3Thread1of1ForFork1_~arg.base=v_P3Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p3_EAX~0, P3Thread1of1ForFork1_~arg.offset, P3Thread1of1ForFork1_~arg.base] and [319] $Ultimate##0-->L766: Formula: (and (= v_~x~0_44 v_~__unbuffered_p1_EAX~0_60) (= v_P0Thread1of1ForFork0_~arg.base_33 |v_P0Thread1of1ForFork0_#in~arg.base_33|) (= v_P0Thread1of1ForFork0_~arg.offset_33 |v_P0Thread1of1ForFork0_#in~arg.offset_33|) (= v_~y~0_41 1) (= v_P2Thread1of1ForFork3_~arg.base_23 |v_P2Thread1of1ForFork3_#in~arg.base_23|) (= |v_P2Thread1of1ForFork3_#in~arg.offset_23| v_P2Thread1of1ForFork3_~arg.offset_23) (= v_~a~0_51 v_~__unbuffered_p0_EAX~0_64) (= v_~z~0_34 1) (= |v_P1Thread1of1ForFork2_#in~arg.offset_33| v_P1Thread1of1ForFork2_~arg.offset_33) (= |v_P1Thread1of1ForFork2_#in~arg.base_33| v_P1Thread1of1ForFork2_~arg.base_33) (= v_~y~0_41 v_~__unbuffered_p2_EAX~0_50) (= v_~x~0_44 1)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_33|, ~a~0=v_~a~0_51, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_33|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_33|, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_23|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_33|, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_23|} OutVars{P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_33, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_33|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_33, P2Thread1of1ForFork3_#in~arg.offset=|v_P2Thread1of1ForFork3_#in~arg.offset_23|, P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_33|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_33, ~a~0=v_~a~0_51, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_60, P2Thread1of1ForFork3_~arg.base=v_P2Thread1of1ForFork3_~arg.base_23, P2Thread1of1ForFork3_#in~arg.base=|v_P2Thread1of1ForFork3_#in~arg.base_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, P2Thread1of1ForFork3_~arg.offset=v_P2Thread1of1ForFork3_~arg.offset_23, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_33|, ~z~0=v_~z~0_34, ~y~0=v_~y~0_41, ~x~0=v_~x~0_44, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_33} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, P2Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P2Thread1of1ForFork3_~arg.offset, ~z~0, ~y~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] [2022-12-05 23:22:00,082 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:22:00,083 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:22:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:22:00,083 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-05 23:22:00,085 INFO L158 Benchmark]: Toolchain (without parser) took 5468.82ms. Allocated memory was 207.6MB in the beginning and 389.0MB in the end (delta: 181.4MB). Free memory was 182.4MB in the beginning and 141.3MB in the end (delta: 41.0MB). Peak memory consumption was 223.0MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 184.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.43ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 157.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.42ms. Allocated memory is still 207.6MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: Boogie Preprocessor took 37.17ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: RCFGBuilder took 389.40ms. Allocated memory is still 207.6MB. Free memory was 154.0MB in the beginning and 139.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,086 INFO L158 Benchmark]: TraceAbstraction took 4666.39ms. Allocated memory was 207.6MB in the beginning and 389.0MB in the end (delta: 181.4MB). Free memory was 138.3MB in the beginning and 141.3MB in the end (delta: -3.0MB). Peak memory consumption was 178.9MB. Max. memory is 8.0GB. [2022-12-05 23:22:00,087 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 207.6MB. Free memory is still 184.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.43ms. Allocated memory is still 207.6MB. Free memory was 182.4MB in the beginning and 157.7MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.42ms. Allocated memory is still 207.6MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.17ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 389.40ms. Allocated memory is still 207.6MB. Free memory was 154.0MB in the beginning and 139.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 4666.39ms. Allocated memory was 207.6MB in the beginning and 389.0MB in the end (delta: 181.4MB). Free memory was 138.3MB in the beginning and 141.3MB in the end (delta: -3.0MB). Peak memory consumption was 178.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 98 PlacesBefore, 35 PlacesAfterwards, 86 TransitionsBefore, 23 TransitionsAfterwards, 1704 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 64 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 1204, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1247, independent: 1204, independent conditional: 0, independent unconditional: 1204, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1044, independent: 1016, independent conditional: 0, independent unconditional: 1016, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1044, independent: 999, independent conditional: 0, independent unconditional: 999, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1247, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1044, unknown conditional: 0, unknown unconditional: 1044] , Statistics on independence cache: Total cache size (in pairs): 1541, Positive cache size: 1513, Positive conditional cache size: 0, Positive unconditional cache size: 1513, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 2, independent unconditional: 66, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 69, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 69, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 69, unknown conditional: 0, unknown unconditional: 69] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 6, independent unconditional: 59, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 69, Positive conditional cache size: 0, Positive unconditional cache size: 69, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 122, independent conditional: 40, independent unconditional: 82, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 122, independent conditional: 5, independent unconditional: 117, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 122, independent conditional: 5, independent unconditional: 117, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 134, independent: 100, independent conditional: 3, independent unconditional: 97, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 24, unknown conditional: 2, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 91, Positive conditional cache size: 2, Positive unconditional cache size: 89, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 44 PlacesBefore, 43 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 208, independent conditional: 52, independent unconditional: 156, dependent: 30, dependent conditional: 4, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 242, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 242, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 242, independent: 189, independent conditional: 0, independent unconditional: 189, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 141, Positive cache size: 128, Positive conditional cache size: 2, Positive unconditional cache size: 126, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 144, Positive cache size: 130, Positive conditional cache size: 2, Positive unconditional cache size: 128, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 133, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 133, independent: 111, independent conditional: 42, independent unconditional: 69, dependent: 22, dependent conditional: 8, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, independent: 99, independent conditional: 0, independent unconditional: 99, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 148, Positive conditional cache size: 2, Positive unconditional cache size: 146, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 55, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 38 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 15 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 44, independent: 34, independent conditional: 3, independent unconditional: 31, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 162, Positive conditional cache size: 2, Positive unconditional cache size: 160, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word contains letters no longer in the reduced abstraction's alphabet!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:125) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-05 23:22:00,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...