/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/safe011_power.opt_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:13:37,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:13:37,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:13:37,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:13:37,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:13:37,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:13:37,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:13:37,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:13:37,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:13:37,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:13:37,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:13:37,951 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:13:37,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:13:37,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:13:37,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:13:37,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:13:37,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:13:37,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:13:37,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:13:37,957 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:13:37,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:13:37,959 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:13:37,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:13:37,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:13:37,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:13:37,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:13:37,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:13:37,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:13:37,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:13:37,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:13:37,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:13:37,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:13:37,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:13:37,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:13:37,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:13:37,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:13:37,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:13:37,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:13:37,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:13:37,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:13:37,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:13:37,973 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:13:37,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:13:37,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:13:37,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:13:37,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:13:37,995 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:13:37,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:13:37,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:13:37,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:13:37,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:13:37,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:13:37,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:13:37,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:13:37,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:13:37,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:13:37,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:13:37,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:13:37,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:13:37,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:13:37,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:13:37,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:13:37,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:13:37,999 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:13:37,999 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:13:38,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:13:38,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:13:38,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:13:38,310 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:13:38,310 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:13:38,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-05 23:13:39,361 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:13:39,581 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:13:39,582 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.opt_pso.opt.i [2022-12-05 23:13:39,596 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761fd11b/f1b80a8791fe43a98b3963ed170239d1/FLAG75fbc1103 [2022-12-05 23:13:39,610 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5761fd11b/f1b80a8791fe43a98b3963ed170239d1 [2022-12-05 23:13:39,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:13:39,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:13:39,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:13:39,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:13:39,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:13:39,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:39,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20245ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39, skipping insertion in model container [2022-12-05 23:13:39,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:39,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:13:39,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:13:39,779 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/safe011_power.opt_pso.opt.i[959,972] [2022-12-05 23:13:39,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,861 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:13:39,887 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:13:39,895 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/safe011_power.opt_pso.opt.i[959,972] [2022-12-05 23:13:39,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,923 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,924 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 23:13:39,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 23:13:39,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:13:39,978 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:13:39,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39 WrapperNode [2022-12-05 23:13:39,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:13:39,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:13:39,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:13:39,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:13:39,985 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:13:39" (1/1) ... [2022-12-05 23:13:40,006 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:13:39" (1/1) ... [2022-12-05 23:13:40,031 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-05 23:13:40,031 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:13:40,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:13:40,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:13:40,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:13:40,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,047 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,051 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:13:40,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:13:40,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:13:40,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:13:40,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (1/1) ... [2022-12-05 23:13:40,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:13:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:13:40,079 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:13:40,089 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:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 23:13:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 23:13:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 23:13:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 23:13:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 23:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 23:13:40,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:13:40,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:13:40,114 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:13:40,217 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:13:40,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:13:40,447 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:13:40,604 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:13:40,604 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:13:40,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:13:40 BoogieIcfgContainer [2022-12-05 23:13:40,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:13:40,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:13:40,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:13:40,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:13:40,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:13:39" (1/3) ... [2022-12-05 23:13:40,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6367327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:13:40, skipping insertion in model container [2022-12-05 23:13:40,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:13:39" (2/3) ... [2022-12-05 23:13:40,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6367327a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:13:40, skipping insertion in model container [2022-12-05 23:13:40,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:13:40" (3/3) ... [2022-12-05 23:13:40,612 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2022-12-05 23:13:40,626 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:13:40,626 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 23:13:40,626 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:13:40,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 23:13:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:13:40,772 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:13:40,772 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:40,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:13:40,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-05 23:13:40,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-05 23:13:40,782 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:40,798 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:13:40,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-05 23:13:40,817 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-05 23:13:40,817 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:40,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 23:13:40,820 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-05 23:13:40,820 INFO L188 LiptonReduction]: Number of co-enabled transitions 1906 [2022-12-05 23:13:44,478 INFO L203 LiptonReduction]: Total number of compositions: 81 [2022-12-05 23:13:44,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:13:44,499 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;@1c838480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:13:44,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 23:13:44,504 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 23:13:44,504 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:44,504 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:44,505 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:13:44,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 445773821, now seen corresponding path program 1 times [2022-12-05 23:13:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257675875] [2022-12-05 23:13:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:44,843 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:13:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:44,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257675875] [2022-12-05 23:13:44,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257675875] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:44,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:44,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:13:44,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216426156] [2022-12-05 23:13:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:44,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:13:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:44,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:13:44,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:13:44,891 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-05 23:13:44,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:13:44,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:44,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-05 23:13:44,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:45,098 INFO L130 PetriNetUnfolder]: 879/1434 cut-off events. [2022-12-05 23:13:45,098 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 23:13:45,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1434 events. 879/1434 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7472 event pairs, 144 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2790. Up to 1060 conditions per place. [2022-12-05 23:13:45,107 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 27 selfloop transitions, 2 changer transitions 6/38 dead transitions. [2022-12-05 23:13:45,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2022-12-05 23:13:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 23:13:45,115 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6049382716049383 [2022-12-05 23:13:45,116 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 49 transitions. [2022-12-05 23:13:45,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2022-12-05 23:13:45,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:13:45,136 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 52 flow [2022-12-05 23:13:45,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-12-05 23:13:45,140 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:13:45,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:45,141 INFO L89 Accepts]: Start accepts. Operand has 33 places, 21 transitions, 52 flow [2022-12-05 23:13:45,143 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:45,143 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:45,143 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 52 flow [2022-12-05 23:13:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-05 23:13:45,147 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:13:45,147 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:13:45,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 23:13:45,148 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-05 23:13:45,148 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-05 23:13:45,196 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:45,198 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:13:45,198 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-05 23:13:45,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:13:45,198 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:45,198 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:45,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:13:45,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 300536112, now seen corresponding path program 1 times [2022-12-05 23:13:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:45,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919816952] [2022-12-05 23:13:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:45,497 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:13:45,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:45,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919816952] [2022-12-05 23:13:45,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919816952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:45,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:45,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:45,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678045300] [2022-12-05 23:13:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:45,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:45,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:45,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:45,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:45,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 23:13:45,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:13:45,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:45,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 23:13:45,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:45,717 INFO L130 PetriNetUnfolder]: 1040/1564 cut-off events. [2022-12-05 23:13:45,717 INFO L131 PetriNetUnfolder]: For 124/124 co-relation queries the response was YES. [2022-12-05 23:13:45,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 1564 events. 1040/1564 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6775 event pairs, 379 based on Foata normal form. 28/1591 useless extension candidates. Maximal degree in co-relation 3292. Up to 1347 conditions per place. [2022-12-05 23:13:45,723 INFO L137 encePairwiseOnDemand]: 12/21 looper letters, 32 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2022-12-05 23:13:45,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 188 flow [2022-12-05 23:13:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:45,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:13:45,725 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:13:45,725 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:13:45,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 188 flow [2022-12-05 23:13:45,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:45,726 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,726 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2022-12-05 23:13:45,727 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 23:13:45,727 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:45,727 INFO L89 Accepts]: Start accepts. Operand has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,727 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:45,728 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:45,728 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,758 INFO L130 PetriNetUnfolder]: 144/284 cut-off events. [2022-12-05 23:13:45,759 INFO L131 PetriNetUnfolder]: For 38/39 co-relation queries the response was YES. [2022-12-05 23:13:45,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 284 events. 144/284 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1323 event pairs, 81 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 620. Up to 212 conditions per place. [2022-12-05 23:13:45,761 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,761 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-05 23:13:45,774 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:45,775 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 48 [2022-12-05 23:13:45,775 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 111 flow [2022-12-05 23:13:45,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:13:45,776 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:45,776 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:45,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:13:45,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:45,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash 726683029, now seen corresponding path program 1 times [2022-12-05 23:13:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372899856] [2022-12-05 23:13:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:45,873 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:13:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372899856] [2022-12-05 23:13:45,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372899856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:45,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:45,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:13:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025257634] [2022-12-05 23:13:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:45,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:13:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:45,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:13:45,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:13:45,875 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 23:13:45,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:13:45,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:45,876 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 23:13:45,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:45,997 INFO L130 PetriNetUnfolder]: 728/1141 cut-off events. [2022-12-05 23:13:45,997 INFO L131 PetriNetUnfolder]: For 484/484 co-relation queries the response was YES. [2022-12-05 23:13:45,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1141 events. 728/1141 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5106 event pairs, 139 based on Foata normal form. 12/1149 useless extension candidates. Maximal degree in co-relation 3209. Up to 868 conditions per place. [2022-12-05 23:13:46,002 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2022-12-05 23:13:46,002 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 204 flow [2022-12-05 23:13:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:46,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2022-12-05 23:13:46,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:13:46,004 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 111 flow. Second operand 3 states and 36 transitions. [2022-12-05 23:13:46,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 204 flow [2022-12-05 23:13:46,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:13:46,005 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,006 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-05 23:13:46,006 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-05 23:13:46,006 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:46,006 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,007 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:46,007 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:46,007 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,031 INFO L130 PetriNetUnfolder]: 145/289 cut-off events. [2022-12-05 23:13:46,031 INFO L131 PetriNetUnfolder]: For 84/85 co-relation queries the response was YES. [2022-12-05 23:13:46,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 289 events. 145/289 cut-off events. For 84/85 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1363 event pairs, 78 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 652. Up to 212 conditions per place. [2022-12-05 23:13:46,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,033 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-05 23:13:46,035 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:46,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 23:13:46,036 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 119 flow [2022-12-05 23:13:46,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:13:46,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:46,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:46,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:13:46,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 731692948, now seen corresponding path program 1 times [2022-12-05 23:13:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:46,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805162963] [2022-12-05 23:13:46,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:46,348 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:13:46,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:46,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805162963] [2022-12-05 23:13:46,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805162963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:46,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:46,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:46,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068731767] [2022-12-05 23:13:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:46,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:46,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:46,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:46,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:13:46,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:13:46,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:46,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:13:46,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:46,514 INFO L130 PetriNetUnfolder]: 909/1464 cut-off events. [2022-12-05 23:13:46,514 INFO L131 PetriNetUnfolder]: For 797/804 co-relation queries the response was YES. [2022-12-05 23:13:46,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4133 conditions, 1464 events. 909/1464 cut-off events. For 797/804 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7124 event pairs, 206 based on Foata normal form. 14/1452 useless extension candidates. Maximal degree in co-relation 4118. Up to 1256 conditions per place. [2022-12-05 23:13:46,520 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 39 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2022-12-05 23:13:46,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 269 flow [2022-12-05 23:13:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:13:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:13:46,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 23:13:46,522 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2022-12-05 23:13:46,522 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 119 flow. Second operand 3 states and 38 transitions. [2022-12-05 23:13:46,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 269 flow [2022-12-05 23:13:46,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:46,524 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,524 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-12-05 23:13:46,525 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2022-12-05 23:13:46,525 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:46,525 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,525 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:46,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:46,526 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,555 INFO L130 PetriNetUnfolder]: 184/365 cut-off events. [2022-12-05 23:13:46,556 INFO L131 PetriNetUnfolder]: For 208/210 co-relation queries the response was YES. [2022-12-05 23:13:46,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 365 events. 184/365 cut-off events. For 208/210 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1850 event pairs, 91 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 891. Up to 253 conditions per place. [2022-12-05 23:13:46,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 262 [2022-12-05 23:13:46,560 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:46,561 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-05 23:13:46,561 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 146 flow [2022-12-05 23:13:46,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:13:46,561 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:46,561 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:46,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:13:46,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:46,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1207699291, now seen corresponding path program 1 times [2022-12-05 23:13:46,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:46,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89716901] [2022-12-05 23:13:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:46,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:46,657 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:13:46,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:46,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89716901] [2022-12-05 23:13:46,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89716901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:46,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:46,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:13:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187819243] [2022-12-05 23:13:46,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:46,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:46,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:46,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:46,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:46,658 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:13:46,659 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:13:46,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:46,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:13:46,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:46,871 INFO L130 PetriNetUnfolder]: 1324/2067 cut-off events. [2022-12-05 23:13:46,871 INFO L131 PetriNetUnfolder]: For 1845/1884 co-relation queries the response was YES. [2022-12-05 23:13:46,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 2067 events. 1324/2067 cut-off events. For 1845/1884 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10233 event pairs, 242 based on Foata normal form. 112/2141 useless extension candidates. Maximal degree in co-relation 6037. Up to 1007 conditions per place. [2022-12-05 23:13:46,879 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 52 selfloop transitions, 3 changer transitions 3/62 dead transitions. [2022-12-05 23:13:46,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 376 flow [2022-12-05 23:13:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:46,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:13:46,880 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-05 23:13:46,880 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 146 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:13:46,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 376 flow [2022-12-05 23:13:46,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 62 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:13:46,883 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,883 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2022-12-05 23:13:46,883 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2022-12-05 23:13:46,883 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:46,883 INFO L89 Accepts]: Start accepts. Operand has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,884 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:46,884 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:46,884 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,921 INFO L130 PetriNetUnfolder]: 226/494 cut-off events. [2022-12-05 23:13:46,921 INFO L131 PetriNetUnfolder]: For 419/425 co-relation queries the response was YES. [2022-12-05 23:13:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 494 events. 226/494 cut-off events. For 419/425 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2911 event pairs, 112 based on Foata normal form. 4/482 useless extension candidates. Maximal degree in co-relation 1206. Up to 325 conditions per place. [2022-12-05 23:13:46,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 266 [2022-12-05 23:13:46,926 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:46,927 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-05 23:13:46,927 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 154 flow [2022-12-05 23:13:46,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:13:46,927 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:46,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:13:46,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash -935549246, now seen corresponding path program 1 times [2022-12-05 23:13:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284696255] [2022-12-05 23:13:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:47,267 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:13:47,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:47,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284696255] [2022-12-05 23:13:47,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284696255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:47,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:47,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615167371] [2022-12-05 23:13:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:47,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:47,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:47,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:47,269 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 23:13:47,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 154 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:13:47,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:47,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 23:13:47,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:47,489 INFO L130 PetriNetUnfolder]: 1279/2038 cut-off events. [2022-12-05 23:13:47,489 INFO L131 PetriNetUnfolder]: For 1968/1988 co-relation queries the response was YES. [2022-12-05 23:13:47,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6241 conditions, 2038 events. 1279/2038 cut-off events. For 1968/1988 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10366 event pairs, 341 based on Foata normal form. 20/2026 useless extension candidates. Maximal degree in co-relation 6222. Up to 1684 conditions per place. [2022-12-05 23:13:47,496 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 40 selfloop transitions, 8 changer transitions 11/62 dead transitions. [2022-12-05 23:13:47,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 391 flow [2022-12-05 23:13:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:47,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-05 23:13:47,497 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2022-12-05 23:13:47,497 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 154 flow. Second operand 4 states and 50 transitions. [2022-12-05 23:13:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 391 flow [2022-12-05 23:13:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:47,502 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 194 flow [2022-12-05 23:13:47,502 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-05 23:13:47,502 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-05 23:13:47,502 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:47,502 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 194 flow [2022-12-05 23:13:47,503 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:47,503 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:47,503 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 194 flow [2022-12-05 23:13:47,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 194 flow [2022-12-05 23:13:47,524 INFO L130 PetriNetUnfolder]: 122/264 cut-off events. [2022-12-05 23:13:47,524 INFO L131 PetriNetUnfolder]: For 362/367 co-relation queries the response was YES. [2022-12-05 23:13:47,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 264 events. 122/264 cut-off events. For 362/367 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1218 event pairs, 51 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 792. Up to 167 conditions per place. [2022-12-05 23:13:47,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 194 flow [2022-12-05 23:13:47,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-05 23:13:47,546 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:13:47,546 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-05 23:13:47,546 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 197 flow [2022-12-05 23:13:47,546 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:13:47,547 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:47,547 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:47,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:13:47,547 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash 824111857, now seen corresponding path program 1 times [2022-12-05 23:13:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:47,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14351210] [2022-12-05 23:13:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:47,923 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:13:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:47,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14351210] [2022-12-05 23:13:47,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14351210] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:47,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:47,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:13:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308132312] [2022-12-05 23:13:47,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:47,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:13:47,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:47,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:13:47,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:13:47,924 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-05 23:13:47,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:13:47,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:47,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-05 23:13:47,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:48,157 INFO L130 PetriNetUnfolder]: 726/1160 cut-off events. [2022-12-05 23:13:48,157 INFO L131 PetriNetUnfolder]: For 2018/2028 co-relation queries the response was YES. [2022-12-05 23:13:48,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1160 events. 726/1160 cut-off events. For 2018/2028 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4843 event pairs, 235 based on Foata normal form. 1/1160 useless extension candidates. Maximal degree in co-relation 4049. Up to 1015 conditions per place. [2022-12-05 23:13:48,162 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 45 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2022-12-05 23:13:48,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 417 flow [2022-12-05 23:13:48,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-05 23:13:48,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 23:13:48,164 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 197 flow. Second operand 5 states and 55 transitions. [2022-12-05 23:13:48,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 417 flow [2022-12-05 23:13:48,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 395 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-05 23:13:48,167 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 288 flow [2022-12-05 23:13:48,167 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=288, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-05 23:13:48,167 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-05 23:13:48,167 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:48,167 INFO L89 Accepts]: Start accepts. Operand has 45 places, 45 transitions, 288 flow [2022-12-05 23:13:48,168 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:48,168 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:48,168 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 45 transitions, 288 flow [2022-12-05 23:13:48,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 45 transitions, 288 flow [2022-12-05 23:13:48,193 INFO L130 PetriNetUnfolder]: 130/271 cut-off events. [2022-12-05 23:13:48,193 INFO L131 PetriNetUnfolder]: For 450/469 co-relation queries the response was YES. [2022-12-05 23:13:48,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 271 events. 130/271 cut-off events. For 450/469 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1215 event pairs, 45 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 942. Up to 175 conditions per place. [2022-12-05 23:13:48,194 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 45 transitions, 288 flow [2022-12-05 23:13:48,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 274 [2022-12-05 23:13:48,246 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [323] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [409] L826-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd0~0_122 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_225 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_122 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_226 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_210 256) 0))))) (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (= v_~x$r_buff0_thd0~0_121 (ite .cse0 0 v_~x$r_buff0_thd0~0_122)) (= (ite (or .cse1 .cse0) 0 v_~x$w_buff1_used~0_210) v_~x$w_buff1_used~0_209) (= v_~x$w_buff0_used~0_225 (ite .cse2 0 v_~x$w_buff0_used~0_226)) (= (ite .cse2 v_~x$w_buff0~0_125 (ite .cse1 v_~x$w_buff1~0_127 v_~x~0_157)) v_~x~0_156) (= (mod v_~main$tmp_guard0~0_18 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_21| 0)) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_209 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_121 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_122) v_~x$r_buff1_thd0~0_121)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_125, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_122, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_210, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_122, ~x~0=v_~x~0_157, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_226} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_125, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_121, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_21|, ~x$w_buff1~0=v_~x$w_buff1~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_209, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_121, ~x~0=v_~x~0_156, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_225, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_15|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:13:48,454 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [323] L742-->L745: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [425] $Ultimate##0-->L771: Formula: (and (= v_~x$r_buff0_thd0~0_145 v_~x$r_buff1_thd0~0_147) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_261 256))) (not (= (mod v_~x$w_buff1_used~0_243 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= v_~x$w_buff0~0_156 v_~x$w_buff1~0_153) (= v_~x$r_buff1_thd1~0_52 v_~x$r_buff0_thd1~0_53) (= v_~x$w_buff0_used~0_261 1) (= v_~x$r_buff1_thd3~0_51 v_~x$r_buff0_thd3~0_51) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$w_buff0_used~0_262 v_~x$w_buff1_used~0_243) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|) (= |v_P1Thread1of1ForFork0_~arg#1.base_7| |v_P1Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P1Thread1of1ForFork0_~arg#1.offset_7| |v_P1Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~x$r_buff0_thd2~0_70 1) (= v_~x$r_buff1_thd2~0_53 v_~x$r_buff0_thd2~0_71) (= 2 v_~x$w_buff0~0_155)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_145, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_51, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_71, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_262} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_145, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_53, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_7|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_153, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_51, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_243, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_52, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_51, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_70, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_7|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0] [2022-12-05 23:13:48,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [448] L742-->L771: Formula: (and (= v_~x$r_buff0_thd3~0_111 v_~x$r_buff1_thd3~0_107) (= v_~x$r_buff0_thd2~0_147 v_~x$r_buff1_thd2~0_113) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_25| |v_P1Thread1of1ForFork0_~arg#1.offset_25|) (= v_~x$r_buff0_thd0~0_276 v_~x$r_buff1_thd0~0_282) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_443 256) 0)) (not (= (mod v_~x$w_buff0_used~0_473 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= v_~x$r_buff1_thd1~0_95 v_~x$r_buff0_thd1~0_95) (= v_~x$w_buff0_used~0_473 1) (= v_~x~0_391 1) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| 0)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|) (= 2 v_~x$w_buff0~0_296) (= v_~x$w_buff0_used~0_474 v_~x$w_buff1_used~0_443) (= v_~x$w_buff0~0_297 v_~x$w_buff1~0_281) (= v_~x$r_buff0_thd2~0_146 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_25| |v_P1Thread1of1ForFork0_#in~arg#1.base_25|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_297, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_95, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_147, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_474} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_296, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_276, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_95, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_25|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_25|, ~x$w_buff1~0=v_~x$w_buff1~0_281, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_443, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_95, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_29|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_146, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_25|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_473, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_25|, ~x~0=v_~x~0_391} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] and [324] L745-->L752: Formula: (let ((.cse0 (not (= (mod v_~x$w_buff0_used~0_69 256) 0))) (.cse1 (not (= (mod v_~x$r_buff1_thd1~0_14 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_20 256) 0)))) (let ((.cse3 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_70 256) 0)))) (.cse4 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_57 256) 0)))) (.cse2 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd1~0_13 (ite (or (and .cse0 (not (= (mod v_~x$r_buff0_thd1~0_19 256) 0))) (and (not (= 0 (mod v_~x$w_buff1_used~0_56 256))) .cse1)) 0 v_~x$r_buff1_thd1~0_14)) (= v_~x$r_buff0_thd1~0_19 (ite .cse2 0 v_~x$r_buff0_thd1~0_20)) (= v_~x~0_39 (ite .cse3 v_~x$w_buff0~0_21 (ite .cse4 v_~x$w_buff1~0_28 v_~x~0_40))) (= (ite .cse3 0 v_~x$w_buff0_used~0_70) v_~x$w_buff0_used~0_69) (= v_~x$w_buff1_used~0_56 (ite (or .cse4 .cse2) 0 v_~x$w_buff1_used~0_57))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_20, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_57, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_14, ~x~0=v_~x~0_40, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_70} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_21, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_19, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_13, ~x~0=v_~x~0_39, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_69} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-05 23:13:48,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [449] L742-->L752: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_477 256) 0))) (.cse0 (not (= (mod v_~x$r_buff0_thd1~0_98 256) 0))) (.cse1 (= (mod v_~x$w_buff0_used~0_479 256) 0))) (let ((.cse3 (and .cse0 (not .cse1))) (.cse2 (and .cse0 .cse4))) (and (= v_~x$r_buff0_thd3~0_113 v_~x$r_buff1_thd3~0_109) (= v_~x$w_buff0_used~0_477 (ite .cse0 0 1)) (= v_~x$r_buff0_thd0~0_278 v_~x$r_buff1_thd0~0_284) (= (ite .cse1 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= v_~x$r_buff0_thd2~0_150 1) (= v_~x$w_buff0~0_301 v_~x$w_buff1~0_283) (= 2 v_~x$w_buff0~0_300) (= v_~x$r_buff0_thd1~0_97 (ite .cse2 0 v_~x$r_buff0_thd1~0_98)) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_27| |v_P1Thread1of1ForFork0_~arg#1.offset_27|) (= v_~x$r_buff0_thd2~0_151 v_~x$r_buff1_thd2~0_115) (= (ite .cse0 v_~x$w_buff0~0_300 (ite .cse3 v_~x$w_buff1~0_283 1)) v_~x~0_393) (= |v_P1Thread1of1ForFork0_~arg#1.base_27| |v_P1Thread1of1ForFork0_#in~arg#1.base_27|) (= v_~x$w_buff1_used~0_445 (ite (or .cse3 .cse2) 0 v_~x$w_buff0_used~0_479)) (= v_~x$r_buff1_thd1~0_97 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_97 256) 0)) .cse4) (and .cse0 (not (= 0 (mod v_~x$w_buff1_used~0_445 256))))) 0 v_~x$r_buff0_thd1~0_98)) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| 0))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_301, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_278, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_151, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_479} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_300, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_278, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_27|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_27|, ~x$w_buff1~0=v_~x$w_buff1~0_283, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_445, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_109, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_97, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_150, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_284, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_27|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_477, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_27|, ~x~0=v_~x~0_393} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, ~x$r_buff0_thd1~0, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~x~0] and [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-05 23:13:48,827 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:13:48,827 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 660 [2022-12-05 23:13:48,827 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 300 flow [2022-12-05 23:13:48,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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:13:48,828 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:48,828 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:48,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:13:48,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:48,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1895915613, now seen corresponding path program 1 times [2022-12-05 23:13:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:48,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180489571] [2022-12-05 23:13:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:49,039 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:13:49,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:49,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180489571] [2022-12-05 23:13:49,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180489571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:49,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:49,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920362468] [2022-12-05 23:13:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:49,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:49,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:49,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:49,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:49,041 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 23:13:49,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:13:49,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:49,041 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 23:13:49,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:49,217 INFO L130 PetriNetUnfolder]: 969/1522 cut-off events. [2022-12-05 23:13:49,217 INFO L131 PetriNetUnfolder]: For 3060/3060 co-relation queries the response was YES. [2022-12-05 23:13:49,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5631 conditions, 1522 events. 969/1522 cut-off events. For 3060/3060 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6662 event pairs, 279 based on Foata normal form. 43/1560 useless extension candidates. Maximal degree in co-relation 5611. Up to 879 conditions per place. [2022-12-05 23:13:49,223 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 50 selfloop transitions, 8 changer transitions 5/64 dead transitions. [2022-12-05 23:13:49,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 523 flow [2022-12-05 23:13:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:49,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-05 23:13:49,257 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-05 23:13:49,257 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 300 flow. Second operand 4 states and 48 transitions. [2022-12-05 23:13:49,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 523 flow [2022-12-05 23:13:49,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 484 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:49,263 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=292, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-05 23:13:49,265 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2022-12-05 23:13:49,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:49,265 INFO L89 Accepts]: Start accepts. Operand has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,266 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:49,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:49,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,295 INFO L130 PetriNetUnfolder]: 153/357 cut-off events. [2022-12-05 23:13:49,295 INFO L131 PetriNetUnfolder]: For 684/754 co-relation queries the response was YES. [2022-12-05 23:13:49,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 357 events. 153/357 cut-off events. For 684/754 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1918 event pairs, 58 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 1185. Up to 220 conditions per place. [2022-12-05 23:13:49,297 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,297 INFO L188 LiptonReduction]: Number of co-enabled transitions 260 [2022-12-05 23:13:49,301 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:49,303 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-05 23:13:49,303 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 292 flow [2022-12-05 23:13:49,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:13:49,304 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:49,304 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:49,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:13:49,305 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:49,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:49,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1771823778, now seen corresponding path program 1 times [2022-12-05 23:13:49,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:49,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646233757] [2022-12-05 23:13:49,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:49,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:49,848 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:13:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:49,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646233757] [2022-12-05 23:13:49,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646233757] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:49,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:49,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:49,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697024634] [2022-12-05 23:13:49,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:49,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:49,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:49,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:49,850 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-05 23:13:49,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:13:49,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:49,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-05 23:13:49,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:50,110 INFO L130 PetriNetUnfolder]: 1002/1579 cut-off events. [2022-12-05 23:13:50,110 INFO L131 PetriNetUnfolder]: For 3366/3368 co-relation queries the response was YES. [2022-12-05 23:13:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5919 conditions, 1579 events. 1002/1579 cut-off events. For 3366/3368 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7069 event pairs, 369 based on Foata normal form. 3/1576 useless extension candidates. Maximal degree in co-relation 5897. Up to 1367 conditions per place. [2022-12-05 23:13:50,120 INFO L137 encePairwiseOnDemand]: 14/26 looper letters, 42 selfloop transitions, 21 changer transitions 7/71 dead transitions. [2022-12-05 23:13:50,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 578 flow [2022-12-05 23:13:50,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:50,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-05 23:13:50,122 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846 [2022-12-05 23:13:50,122 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 292 flow. Second operand 5 states and 57 transitions. [2022-12-05 23:13:50,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 578 flow [2022-12-05 23:13:50,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 556 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:50,128 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-12-05 23:13:50,128 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 16 predicate places. [2022-12-05 23:13:50,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:50,128 INFO L89 Accepts]: Start accepts. Operand has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,130 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:50,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:50,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,166 INFO L130 PetriNetUnfolder]: 173/385 cut-off events. [2022-12-05 23:13:50,166 INFO L131 PetriNetUnfolder]: For 1093/1176 co-relation queries the response was YES. [2022-12-05 23:13:50,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 385 events. 173/385 cut-off events. For 1093/1176 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2015 event pairs, 45 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1635. Up to 237 conditions per place. [2022-12-05 23:13:50,169 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,169 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-05 23:13:50,171 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:13:50,171 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-05 23:13:50,171 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 422 flow [2022-12-05 23:13:50,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:13:50,172 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:50,172 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:50,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:13:50,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 907963122, now seen corresponding path program 1 times [2022-12-05 23:13:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:50,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134667981] [2022-12-05 23:13:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:50,301 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:13:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:50,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134667981] [2022-12-05 23:13:50,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134667981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:50,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:50,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:13:50,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43158316] [2022-12-05 23:13:50,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:50,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:13:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:50,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:13:50,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:13:50,303 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 26 [2022-12-05 23:13:50,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:13:50,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:50,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 26 [2022-12-05 23:13:50,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:50,473 INFO L130 PetriNetUnfolder]: 671/1179 cut-off events. [2022-12-05 23:13:50,473 INFO L131 PetriNetUnfolder]: For 4930/4953 co-relation queries the response was YES. [2022-12-05 23:13:50,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1179 events. 671/1179 cut-off events. For 4930/4953 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6019 event pairs, 92 based on Foata normal form. 147/1313 useless extension candidates. Maximal degree in co-relation 4993. Up to 522 conditions per place. [2022-12-05 23:13:50,483 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 69 selfloop transitions, 5 changer transitions 4/82 dead transitions. [2022-12-05 23:13:50,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 82 transitions, 814 flow [2022-12-05 23:13:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:13:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:13:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 23:13:50,484 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-05 23:13:50,484 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 422 flow. Second operand 4 states and 62 transitions. [2022-12-05 23:13:50,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 82 transitions, 814 flow [2022-12-05 23:13:50,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 82 transitions, 775 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-12-05 23:13:50,489 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 397 flow [2022-12-05 23:13:50,490 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2022-12-05 23:13:50,490 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2022-12-05 23:13:50,490 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:50,490 INFO L89 Accepts]: Start accepts. Operand has 56 places, 49 transitions, 397 flow [2022-12-05 23:13:50,491 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:50,491 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:50,491 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 49 transitions, 397 flow [2022-12-05 23:13:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 49 transitions, 397 flow [2022-12-05 23:13:50,531 INFO L130 PetriNetUnfolder]: 206/498 cut-off events. [2022-12-05 23:13:50,532 INFO L131 PetriNetUnfolder]: For 1656/1828 co-relation queries the response was YES. [2022-12-05 23:13:50,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 498 events. 206/498 cut-off events. For 1656/1828 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3126 event pairs, 75 based on Foata normal form. 11/449 useless extension candidates. Maximal degree in co-relation 2083. Up to 246 conditions per place. [2022-12-05 23:13:50,536 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 49 transitions, 397 flow [2022-12-05 23:13:50,536 INFO L188 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-05 23:13:50,859 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 23:13:50,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 369 [2022-12-05 23:13:50,860 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 390 flow [2022-12-05 23:13:50,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:13:50,860 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:50,860 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:50,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:13:50,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:50,860 INFO L85 PathProgramCache]: Analyzing trace with hash 199294429, now seen corresponding path program 1 times [2022-12-05 23:13:50,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:50,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468985179] [2022-12-05 23:13:50,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:50,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:50,985 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:13:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468985179] [2022-12-05 23:13:50,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468985179] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:50,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:50,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 23:13:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511696739] [2022-12-05 23:13:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:50,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:13:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:50,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:13:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:13:50,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 25 [2022-12-05 23:13:50,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:13:50,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:50,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 25 [2022-12-05 23:13:50,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:51,125 INFO L130 PetriNetUnfolder]: 515/938 cut-off events. [2022-12-05 23:13:51,126 INFO L131 PetriNetUnfolder]: For 4007/4034 co-relation queries the response was YES. [2022-12-05 23:13:51,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4299 conditions, 938 events. 515/938 cut-off events. For 4007/4034 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4624 event pairs, 89 based on Foata normal form. 95/1025 useless extension candidates. Maximal degree in co-relation 4271. Up to 382 conditions per place. [2022-12-05 23:13:51,130 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 68 selfloop transitions, 8 changer transitions 6/86 dead transitions. [2022-12-05 23:13:51,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 86 transitions, 818 flow [2022-12-05 23:13:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:13:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:13:51,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-12-05 23:13:51,132 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.584 [2022-12-05 23:13:51,132 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 390 flow. Second operand 5 states and 73 transitions. [2022-12-05 23:13:51,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 86 transitions, 818 flow [2022-12-05 23:13:51,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 86 transitions, 789 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-05 23:13:51,139 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 391 flow [2022-12-05 23:13:51,139 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-05 23:13:51,140 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 23 predicate places. [2022-12-05 23:13:51,140 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:51,140 INFO L89 Accepts]: Start accepts. Operand has 59 places, 49 transitions, 391 flow [2022-12-05 23:13:51,142 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:51,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:51,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 49 transitions, 391 flow [2022-12-05 23:13:51,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 49 transitions, 391 flow [2022-12-05 23:13:51,166 INFO L130 PetriNetUnfolder]: 107/334 cut-off events. [2022-12-05 23:13:51,166 INFO L131 PetriNetUnfolder]: For 1120/1383 co-relation queries the response was YES. [2022-12-05 23:13:51,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 334 events. 107/334 cut-off events. For 1120/1383 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2084 event pairs, 16 based on Foata normal form. 30/318 useless extension candidates. Maximal degree in co-relation 1418. Up to 179 conditions per place. [2022-12-05 23:13:51,168 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 49 transitions, 391 flow [2022-12-05 23:13:51,168 INFO L188 LiptonReduction]: Number of co-enabled transitions 314 [2022-12-05 23:13:51,710 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:13:51,711 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-05 23:13:51,711 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 412 flow [2022-12-05 23:13:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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:13:51,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:13:51,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:13:51,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:13:51,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 23:13:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:13:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash 856782532, now seen corresponding path program 1 times [2022-12-05 23:13:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:13:51,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469607107] [2022-12-05 23:13:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:13:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:13:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:13:51,831 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:13:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:13:51,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469607107] [2022-12-05 23:13:51,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469607107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:13:51,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:13:51,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 23:13:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217238495] [2022-12-05 23:13:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:13:51,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 23:13:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:13:51,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 23:13:51,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 23:13:51,832 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-05 23:13:51,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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:13:51,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:13:51,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-05 23:13:51,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:13:51,934 INFO L130 PetriNetUnfolder]: 208/404 cut-off events. [2022-12-05 23:13:51,934 INFO L131 PetriNetUnfolder]: For 2009/2014 co-relation queries the response was YES. [2022-12-05 23:13:51,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 404 events. 208/404 cut-off events. For 2009/2014 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1617 event pairs, 30 based on Foata normal form. 21/420 useless extension candidates. Maximal degree in co-relation 1945. Up to 150 conditions per place. [2022-12-05 23:13:51,936 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 35 selfloop transitions, 11 changer transitions 20/69 dead transitions. [2022-12-05 23:13:51,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 666 flow [2022-12-05 23:13:51,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:13:51,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:13:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-05 23:13:51,937 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-05 23:13:51,937 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 412 flow. Second operand 6 states and 68 transitions. [2022-12-05 23:13:51,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 666 flow [2022-12-05 23:13:51,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 596 flow, removed 20 selfloop flow, removed 7 redundant places. [2022-12-05 23:13:51,941 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 276 flow [2022-12-05 23:13:51,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=276, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2022-12-05 23:13:51,942 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2022-12-05 23:13:51,942 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:13:51,942 INFO L89 Accepts]: Start accepts. Operand has 58 places, 36 transitions, 276 flow [2022-12-05 23:13:51,943 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:13:51,943 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:13:51,943 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 36 transitions, 276 flow [2022-12-05 23:13:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 36 transitions, 276 flow [2022-12-05 23:13:51,950 INFO L130 PetriNetUnfolder]: 25/82 cut-off events. [2022-12-05 23:13:51,950 INFO L131 PetriNetUnfolder]: For 161/163 co-relation queries the response was YES. [2022-12-05 23:13:51,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 82 events. 25/82 cut-off events. For 161/163 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 232 event pairs, 5 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 301. Up to 25 conditions per place. [2022-12-05 23:13:51,951 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 36 transitions, 276 flow [2022-12-05 23:13:51,951 INFO L188 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-05 23:13:52,827 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L794-->L801: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_115 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_74))) (= v_~x$w_buff0_used~0_121 (ite .cse0 0 v_~x$w_buff0_used~0_122)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_114 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-05 23:13:52,903 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L774-->L781: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_25 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_101 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_102 256) 0)))) (.cse0 (and (not (= (mod v_~x$w_buff1_used~0_93 256) 0)) .cse4))) (and (= v_~x$w_buff1_used~0_92 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_93)) (= v_~x$r_buff0_thd2~0_24 (ite .cse1 0 v_~x$r_buff0_thd2~0_25)) (= (ite .cse2 0 v_~x$w_buff0_used~0_102) v_~x$w_buff0_used~0_101) (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_24 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_92 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_20)) (= v_~x~0_61 (ite .cse2 v_~x$w_buff0~0_33 (ite .cse0 v_~x$w_buff1~0_44 v_~x~0_62)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_93, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, ~x~0=v_~x~0_62, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_102} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_33, ~x$w_buff1~0=v_~x$w_buff1~0_44, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_92, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x~0=v_~x~0_61, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_101} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-05 23:13:52,984 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [369] $Ultimate##0-->L742: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_~z~0_29 2) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_29, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-05 23:13:53,020 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L794-->L801: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_121 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_122 256) 0)) .cse5)) (.cse1 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_115 256) 0)))) (.cse2 (and .cse3 .cse5))) (and (= v_~x~0_73 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse1 v_~x$w_buff1~0_52 v_~x~0_74))) (= v_~x$w_buff0_used~0_121 (ite .cse0 0 v_~x$w_buff0_used~0_122)) (= v_~x$r_buff0_thd3~0_23 (ite .cse2 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_114 256) 0)))) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_74, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_122} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$w_buff1~0=v_~x$w_buff1~0_52, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_73, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_121} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [445] $Ultimate##0-->L794: Formula: (and (= v_~z~0_110 1) (= v_~y~0_50 v_~__unbuffered_p2_EAX~0_114) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_50} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_110, ~y~0=v_~y~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-05 23:13:53,094 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-05 23:16:20,866 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [417] L781-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:16:21,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [427] L752-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P0Thread1of1ForFork2_#res.base_7| 0) (= |v_P0Thread1of1ForFork2_#res.offset_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:16:21,646 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [431] L801-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [466] L823-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse24 (not (= (mod v_~x$r_buff0_thd0~0_309 256) 0)))) (let ((.cse17 (and (not (= 0 (mod v_~x$w_buff0_used~0_552 256))) .cse24))) (let ((.cse14 (ite .cse17 0 v_~x$w_buff0_used~0_552))) (let ((.cse19 (= (mod .cse14 256) 0))) (let ((.cse22 (not .cse19))) (let ((.cse23 (and .cse22 .cse24))) (let ((.cse21 (not (= (mod v_~x$r_buff1_thd0~0_315 256) 0))) (.cse8 (ite .cse23 0 v_~x$r_buff0_thd0~0_309))) (let ((.cse10 (= (mod .cse8 256) 0)) (.cse18 (and .cse21 (not (= (mod v_~x$w_buff1_used~0_504 256) 0))))) (let ((.cse12 (ite (or .cse18 .cse23) 0 v_~x$w_buff1_used~0_504)) (.cse11 (not .cse10))) (let ((.cse16 (and .cse22 .cse11)) (.cse20 (= (mod .cse12 256) 0))) (let ((.cse2 (ite (or .cse16 (and (not .cse20) .cse21)) 0 v_~x$r_buff1_thd0~0_315))) (let ((.cse5 (= (mod .cse2 256) 0))) (let ((.cse9 (and .cse10 .cse5)) (.cse13 (and .cse20 .cse10))) (let ((.cse15 (or .cse19 .cse9 .cse13)) (.cse0 (ite .cse17 v_~x$w_buff0~0_351 (ite .cse18 v_~x$w_buff1~0_318 v_~x~0_448)))) (let ((.cse6 (= (mod v_~x$w_buff1_used~0_503 256) 0)) (.cse7 (ite .cse15 .cse0 (ite .cse16 v_~x$w_buff0~0_351 v_~x$w_buff1~0_318))) (.cse3 (= (mod v_~x$w_buff0_used~0_551 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_104 256) 0)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_77| 0) (= v_~x$flush_delayed~0_103 0) (= .cse0 v_~x$mem_tmp~0_102) (= v_~x$r_buff1_thd0~0_314 (ite .cse1 .cse2 (ite (let ((.cse4 (= (mod v_~x$r_buff0_thd0~0_308 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) .cse2 0))) (= (ite (= (ite (not (and (= 2 .cse7) (= v_~z~0_127 2) (= v_~__unbuffered_p2_EAX~0_128 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_102) (= v_~main$tmp_guard0~0_82 (ite (= (ite (= v_~__unbuffered_cnt~0_151 3) 1 0) 0) 0 1)) (= |v_ULTIMATE.start_main_#t~nondet10#1_145| v_~weak$$choice2~0_104) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| 0)) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_69| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|) (= v_~x$r_buff0_thd0~0_308 (ite .cse1 .cse8 (ite (or .cse3 .cse9 (and .cse10 .cse6)) .cse8 (ite (and (not .cse3) .cse11) 0 .cse8)))) (= v_~x$w_buff1~0_318 v_~x$w_buff1~0_317) (= (ite .cse1 v_~x$mem_tmp~0_102 .cse7) v_~x~0_447) (= v_~x$w_buff1_used~0_503 (ite .cse1 .cse12 (ite (or .cse3 .cse9 .cse13) .cse12 0))) (= (mod v_~main$tmp_guard1~0_102 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse1 .cse14 (ite .cse15 .cse14 (ite .cse16 0 .cse14))) v_~x$w_buff0_used~0_551) (= |v_ULTIMATE.start_main_#t~nondet9#1_151| v_~weak$$choice0~0_87) (= v_~x$w_buff0~0_351 v_~x$w_buff0~0_350) (= (mod v_~main$tmp_guard0~0_82 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|))))))))))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_351, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_309, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_145|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_151|, ~x$w_buff1~0=v_~x$w_buff1~0_318, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_315, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_552, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ~z~0=v_~z~0_127, ~x~0=v_~x~0_448} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_350, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_308, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_77|, ~x$flush_delayed~0=v_~x$flush_delayed~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_503, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_102, ~x$mem_tmp~0=v_~x$mem_tmp~0_102, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_82, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_314, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_551, ~weak$$choice0~0=v_~weak$$choice0~0_87, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_69|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_59|, ~z~0=v_~z~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_104, ~x~0=v_~x~0_447, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_63|} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~x$flush_delayed~0, ULTIMATE.start_main_#t~nondet9#1, ~x$w_buff1~0, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~weak$$choice2~0, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 23:16:21,995 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-05 23:16:21,996 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-05 23:16:21,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 23:16:21,997 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:16:21,999 INFO L158 Benchmark]: Toolchain (without parser) took 162385.27ms. Allocated memory was 232.8MB in the beginning and 956.3MB in the end (delta: 723.5MB). Free memory was 189.1MB in the beginning and 818.0MB in the end (delta: -628.9MB). Peak memory consumption was 570.2MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,000 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 232.8MB. Free memory is still 209.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:16:22,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.33ms. Allocated memory is still 232.8MB. Free memory was 188.5MB in the beginning and 162.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,000 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.39ms. Allocated memory is still 232.8MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,000 INFO L158 Benchmark]: Boogie Preprocessor took 19.25ms. Allocated memory is still 232.8MB. Free memory was 159.7MB in the beginning and 158.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,000 INFO L158 Benchmark]: RCFGBuilder took 554.65ms. Allocated memory is still 232.8MB. Free memory was 158.1MB in the beginning and 121.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,001 INFO L158 Benchmark]: TraceAbstraction took 161391.59ms. Allocated memory was 232.8MB in the beginning and 956.3MB in the end (delta: 723.5MB). Free memory was 120.9MB in the beginning and 818.0MB in the end (delta: -697.1MB). Peak memory consumption was 502.1MB. Max. memory is 8.0GB. [2022-12-05 23:16:22,002 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 232.8MB. Free memory is still 209.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 362.33ms. Allocated memory is still 232.8MB. Free memory was 188.5MB in the beginning and 162.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.39ms. Allocated memory is still 232.8MB. Free memory was 162.3MB in the beginning and 159.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.25ms. Allocated memory is still 232.8MB. Free memory was 159.7MB in the beginning and 158.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 554.65ms. Allocated memory is still 232.8MB. Free memory was 158.1MB in the beginning and 121.4MB in the end (delta: 36.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 161391.59ms. Allocated memory was 232.8MB in the beginning and 956.3MB in the end (delta: 723.5MB). Free memory was 120.9MB in the beginning and 818.0MB in the end (delta: -697.1MB). Peak memory consumption was 502.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1906 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 1357, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1412, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1200, independent: 1160, independent conditional: 0, independent unconditional: 1160, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1200, independent: 1145, independent conditional: 0, independent unconditional: 1145, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 196, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1412, independent: 197, independent conditional: 0, independent unconditional: 197, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1200, unknown conditional: 0, unknown unconditional: 1200] , Statistics on independence cache: Total cache size (in pairs): 1807, Positive cache size: 1767, Positive conditional cache size: 0, Positive unconditional cache size: 1767, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 81, 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: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 103, independent: 81, independent conditional: 8, independent unconditional: 73, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 74, independent conditional: 7, independent unconditional: 67, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 103, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 89, unknown conditional: 9, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 74, Positive conditional cache size: 7, Positive unconditional cache size: 67, Negative cache size: 15, Negative conditional cache size: 2, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 26, independent unconditional: 79, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 105, independent conditional: 14, independent unconditional: 91, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 105, independent conditional: 14, independent unconditional: 91, dependent: 13, dependent conditional: 5, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 6, independent unconditional: 11, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 0, independent unconditional: 17, 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: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 88, independent conditional: 8, independent unconditional: 80, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 19, unknown conditional: 8, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 77, independent conditional: 77, 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: 88, independent: 77, independent conditional: 15, independent unconditional: 62, 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: 88, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 88, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 88, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 93, Positive conditional cache size: 13, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 13, independent unconditional: 31, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 44, independent conditional: 4, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 44, independent conditional: 4, independent unconditional: 40, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 50, independent: 43, independent conditional: 4, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 94, Positive conditional cache size: 13, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, 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, 32 TransitionsBefore, 32 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 11, independent unconditional: 8, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 22, independent: 19, independent conditional: 3, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 94, Positive conditional cache size: 13, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 74, 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: 84, independent: 74, independent conditional: 22, independent unconditional: 52, 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: 84, independent: 74, independent conditional: 4, independent unconditional: 70, 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: 84, independent: 74, independent conditional: 4, independent unconditional: 70, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 84, independent: 71, independent conditional: 4, independent unconditional: 67, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 99, Positive conditional cache size: 13, Positive unconditional cache size: 86, Negative cache size: 17, Negative conditional cache size: 4, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 45 PlacesBefore, 44 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 286, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 122, independent unconditional: 164, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 326, independent: 286, independent conditional: 81, independent unconditional: 205, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 326, independent: 286, independent conditional: 81, independent unconditional: 205, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 326, independent: 277, independent conditional: 77, independent unconditional: 200, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 17, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, 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.0s, 47 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 29, independent unconditional: 10, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 46, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 17, Positive unconditional cache size: 114, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 57, independent: 48, independent conditional: 48, 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: 57, independent: 48, independent conditional: 22, independent unconditional: 26, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 57, independent: 48, independent conditional: 14, independent unconditional: 34, 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: 57, independent: 48, independent conditional: 14, independent unconditional: 34, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 57, independent: 46, independent conditional: 14, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 133, Positive conditional cache size: 17, Positive unconditional cache size: 116, Negative cache size: 18, Negative conditional cache size: 4, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 20, independent unconditional: 5, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 25, independent conditional: 7, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 25, independent conditional: 7, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, 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: 7, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 19, independent conditional: 3, independent unconditional: 16, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 142, Positive conditional cache size: 21, Positive unconditional cache size: 121, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 59 PlacesBefore, 58 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 55, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 45, independent unconditional: 10, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 55, independent conditional: 19, independent unconditional: 36, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, 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: 63, independent: 46, independent conditional: 15, independent unconditional: 31, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 167, Positive conditional cache size: 25, Positive unconditional cache size: 142, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 150.0s, 57 PlacesBefore, 53 PlacesAfterwards, 36 TransitionsBefore, 32 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 18, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 9, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 2, independent unconditional: 1, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 20, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 226, Positive cache size: 207, Positive conditional cache size: 27, Positive unconditional cache size: 180, Negative cache size: 19, Negative conditional cache size: 4, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, 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:16:22,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...