/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:05:35,049 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:05:35,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:05:35,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:05:35,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:05:35,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:05:35,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:05:35,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:05:35,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:05:35,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:05:35,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:05:35,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:05:35,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:05:35,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:05:35,109 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:05:35,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:05:35,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:05:35,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:05:35,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:05:35,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:05:35,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:05:35,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:05:35,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:05:35,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:05:35,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:05:35,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:05:35,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:05:35,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:05:35,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:05:35,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:05:35,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:05:35,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:05:35,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:05:35,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:05:35,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:05:35,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:05:35,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:05:35,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:05:35,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:05:35,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:05:35,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:05:35,147 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:05:35,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:05:35,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:05:35,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:05:35,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:05:35,180 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:05:35,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:05:35,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:05:35,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:05:35,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:05:35,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:05:35,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:05:35,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:05:35,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:05:35,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:05:35,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:05:35,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:05:35,184 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:05:35,184 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-13 12:05:35,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:05:35,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:05:35,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:05:35,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:05:35,480 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:05:35,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 12:05:36,432 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:05:36,703 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:05:36,704 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 12:05:36,716 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d9621fd/e181365691794727bcd9f1c03eb321a8/FLAG99195e76d [2022-12-13 12:05:36,733 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51d9621fd/e181365691794727bcd9f1c03eb321a8 [2022-12-13 12:05:36,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:05:36,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:05:36,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:36,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:05:36,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:05:36,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:36" (1/1) ... [2022-12-13 12:05:36,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173206f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:36, skipping insertion in model container [2022-12-13 12:05:36,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:05:36" (1/1) ... [2022-12-13 12:05:36,748 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:05:36,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:05:36,941 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 12:05:37,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,087 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,088 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,089 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,121 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:37,155 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:05:37,164 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/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-12-13 12:05:37,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:05:37,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:05:37,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:05:37,261 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:05:37,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37 WrapperNode [2022-12-13 12:05:37,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:05:37,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:37,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:05:37,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:05:37,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,300 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-13 12:05:37,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:05:37,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:05:37,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:05:37,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:05:37,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,320 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:05:37,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:05:37,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:05:37,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:05:37,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (1/1) ... [2022-12-13 12:05:37,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:05:37,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:05:37,373 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-13 12:05:37,409 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-13 12:05:37,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:05:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:05:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:05:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:05:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:05:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:05:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:05:37,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:05:37,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:05:37,435 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:05:37,612 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:05:37,614 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:05:37,865 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:05:37,975 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:05:37,976 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:05:37,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:37 BoogieIcfgContainer [2022-12-13 12:05:37,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:05:37,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:05:37,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:05:37,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:05:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:05:36" (1/3) ... [2022-12-13 12:05:37,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732dfc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:37, skipping insertion in model container [2022-12-13 12:05:37,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:05:37" (2/3) ... [2022-12-13 12:05:37,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732dfc77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:05:37, skipping insertion in model container [2022-12-13 12:05:37,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:05:37" (3/3) ... [2022-12-13 12:05:37,992 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-12-13 12:05:38,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:05:38,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 12:05:38,012 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:05:38,075 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:05:38,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 225 flow [2022-12-13 12:05:38,165 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-13 12:05:38,165 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:38,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:05:38,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 105 transitions, 225 flow [2022-12-13 12:05:38,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 102 transitions, 213 flow [2022-12-13 12:05:38,176 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:38,199 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-13 12:05:38,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 213 flow [2022-12-13 12:05:38,252 INFO L130 PetriNetUnfolder]: 2/102 cut-off events. [2022-12-13 12:05:38,253 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:38,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:05:38,256 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 213 flow [2022-12-13 12:05:38,256 INFO L226 LiptonReduction]: Number of co-enabled transitions 1776 [2022-12-13 12:05:46,032 INFO L241 LiptonReduction]: Total number of compositions: 83 [2022-12-13 12:05:46,049 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:05:46,055 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;@127b3433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:05:46,055 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 12:05:46,063 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-12-13 12:05:46,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:46,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:46,064 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:46,065 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash 810967509, now seen corresponding path program 1 times [2022-12-13 12:05:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:46,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589845037] [2022-12-13 12:05:46,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:46,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:46,433 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-13 12:05:46,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:46,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589845037] [2022-12-13 12:05:46,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589845037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:46,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:46,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:46,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976719085] [2022-12-13 12:05:46,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:46,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:46,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:46,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:46,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:46,459 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 54 [2022-12-13 12:05:46,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:05:46,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:46,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 54 [2022-12-13 12:05:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:47,550 INFO L130 PetriNetUnfolder]: 6079/9807 cut-off events. [2022-12-13 12:05:47,551 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 12:05:47,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18590 conditions, 9807 events. 6079/9807 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 73508 event pairs, 855 based on Foata normal form. 0/5892 useless extension candidates. Maximal degree in co-relation 18579. Up to 7305 conditions per place. [2022-12-13 12:05:47,589 INFO L137 encePairwiseOnDemand]: 50/54 looper letters, 28 selfloop transitions, 2 changer transitions 44/84 dead transitions. [2022-12-13 12:05:47,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 84 transitions, 325 flow [2022-12-13 12:05:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:47,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-12-13 12:05:47,599 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2022-12-13 12:05:47,600 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 117 flow. Second operand 3 states and 107 transitions. [2022-12-13 12:05:47,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 84 transitions, 325 flow [2022-12-13 12:05:47,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:47,607 INFO L231 Difference]: Finished difference. Result has 61 places, 30 transitions, 70 flow [2022-12-13 12:05:47,609 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=61, PETRI_TRANSITIONS=30} [2022-12-13 12:05:47,612 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2022-12-13 12:05:47,612 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:47,613 INFO L89 Accepts]: Start accepts. Operand has 61 places, 30 transitions, 70 flow [2022-12-13 12:05:47,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:47,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:47,615 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 30 transitions, 70 flow [2022-12-13 12:05:47,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 70 flow [2022-12-13 12:05:47,627 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 12:05:47,627 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:05:47,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 63 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-13 12:05:47,629 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 70 flow [2022-12-13 12:05:47,630 INFO L226 LiptonReduction]: Number of co-enabled transitions 502 [2022-12-13 12:05:47,703 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:47,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 93 [2022-12-13 12:05:47,706 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2022-12-13 12:05:47,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:05:47,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:47,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:05:47,709 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1950745454, now seen corresponding path program 1 times [2022-12-13 12:05:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:47,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879301985] [2022-12-13 12:05:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:48,326 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-13 12:05:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:48,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879301985] [2022-12-13 12:05:48,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879301985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:48,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:48,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:48,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66821058] [2022-12-13 12:05:48,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:48,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:48,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:48,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:48,329 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:05:48,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:05:48,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:48,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:05:48,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:48,750 INFO L130 PetriNetUnfolder]: 2543/4051 cut-off events. [2022-12-13 12:05:48,750 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-13 12:05:48,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 4051 events. 2543/4051 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23559 event pairs, 209 based on Foata normal form. 130/3475 useless extension candidates. Maximal degree in co-relation 8125. Up to 2497 conditions per place. [2022-12-13 12:05:48,776 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 44 selfloop transitions, 11 changer transitions 0/62 dead transitions. [2022-12-13 12:05:48,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 254 flow [2022-12-13 12:05:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-13 12:05:48,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2022-12-13 12:05:48,779 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 4 states and 85 transitions. [2022-12-13 12:05:48,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 254 flow [2022-12-13 12:05:48,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:48,781 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,782 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2022-12-13 12:05:48,782 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -21 predicate places. [2022-12-13 12:05:48,783 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:48,783 INFO L89 Accepts]: Start accepts. Operand has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,784 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:48,784 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:48,785 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,836 INFO L130 PetriNetUnfolder]: 188/508 cut-off events. [2022-12-13 12:05:48,836 INFO L131 PetriNetUnfolder]: For 70/75 co-relation queries the response was YES. [2022-12-13 12:05:48,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 508 events. 188/508 cut-off events. For 70/75 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3332 event pairs, 72 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 1000. Up to 246 conditions per place. [2022-12-13 12:05:48,840 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,841 INFO L226 LiptonReduction]: Number of co-enabled transitions 652 [2022-12-13 12:05:48,853 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:48,854 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 12:05:48,854 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 150 flow [2022-12-13 12:05:48,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-13 12:05:48,855 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:48,855 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:48,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:05:48,855 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:48,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash 343564328, now seen corresponding path program 1 times [2022-12-13 12:05:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:48,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275568745] [2022-12-13 12:05:48,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:48,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:49,033 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-13 12:05:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:49,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275568745] [2022-12-13 12:05:49,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275568745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:49,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:49,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:05:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82841072] [2022-12-13 12:05:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:49,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:49,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:49,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:49,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 12:05:49,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:05:49,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:49,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 12:05:49,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:49,314 INFO L130 PetriNetUnfolder]: 1920/3146 cut-off events. [2022-12-13 12:05:49,314 INFO L131 PetriNetUnfolder]: For 1530/1536 co-relation queries the response was YES. [2022-12-13 12:05:49,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8258 conditions, 3146 events. 1920/3146 cut-off events. For 1530/1536 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 18316 event pairs, 650 based on Foata normal form. 11/2575 useless extension candidates. Maximal degree in co-relation 8245. Up to 2731 conditions per place. [2022-12-13 12:05:49,331 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 39 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2022-12-13 12:05:49,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 286 flow [2022-12-13 12:05:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 12:05:49,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2022-12-13 12:05:49,333 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 150 flow. Second operand 3 states and 62 transitions. [2022-12-13 12:05:49,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 286 flow [2022-12-13 12:05:49,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 286 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:05:49,335 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,335 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2022-12-13 12:05:49,336 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -18 predicate places. [2022-12-13 12:05:49,336 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:49,336 INFO L89 Accepts]: Start accepts. Operand has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:49,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:49,336 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,370 INFO L130 PetriNetUnfolder]: 177/491 cut-off events. [2022-12-13 12:05:49,370 INFO L131 PetriNetUnfolder]: For 163/167 co-relation queries the response was YES. [2022-12-13 12:05:49,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1063 conditions, 491 events. 177/491 cut-off events. For 163/167 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3217 event pairs, 68 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1050. Up to 229 conditions per place. [2022-12-13 12:05:49,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,374 INFO L226 LiptonReduction]: Number of co-enabled transitions 686 [2022-12-13 12:05:49,375 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:49,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-13 12:05:49,376 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 184 flow [2022-12-13 12:05:49,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-13 12:05:49,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:49,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:49,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:05:49,377 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2062824500, now seen corresponding path program 1 times [2022-12-13 12:05:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:49,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182708563] [2022-12-13 12:05:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:49,781 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-13 12:05:49,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:49,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182708563] [2022-12-13 12:05:49,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182708563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:49,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:49,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237431799] [2022-12-13 12:05:49,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:49,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:49,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:49,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:49,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:05:49,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:05:49,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:49,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:05:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:50,285 INFO L130 PetriNetUnfolder]: 3172/5133 cut-off events. [2022-12-13 12:05:50,286 INFO L131 PetriNetUnfolder]: For 3163/3163 co-relation queries the response was YES. [2022-12-13 12:05:50,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13747 conditions, 5133 events. 3172/5133 cut-off events. For 3163/3163 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 31200 event pairs, 833 based on Foata normal form. 108/4264 useless extension candidates. Maximal degree in co-relation 13731. Up to 2409 conditions per place. [2022-12-13 12:05:50,307 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 53 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2022-12-13 12:05:50,307 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 469 flow [2022-12-13 12:05:50,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:50,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 12:05:50,309 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.725 [2022-12-13 12:05:50,309 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 184 flow. Second operand 4 states and 87 transitions. [2022-12-13 12:05:50,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 469 flow [2022-12-13 12:05:50,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:50,323 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,323 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=356, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2022-12-13 12:05:50,323 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -13 predicate places. [2022-12-13 12:05:50,323 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:50,323 INFO L89 Accepts]: Start accepts. Operand has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,324 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:50,324 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:50,324 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,369 INFO L130 PetriNetUnfolder]: 210/611 cut-off events. [2022-12-13 12:05:50,369 INFO L131 PetriNetUnfolder]: For 644/674 co-relation queries the response was YES. [2022-12-13 12:05:50,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1708 conditions, 611 events. 210/611 cut-off events. For 644/674 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4287 event pairs, 69 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 1691. Up to 270 conditions per place. [2022-12-13 12:05:50,374 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 12:05:50,382 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:50,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 12:05:50,387 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 356 flow [2022-12-13 12:05:50,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-13 12:05:50,387 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:50,387 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:50,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:05:50,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2062851408, now seen corresponding path program 1 times [2022-12-13 12:05:50,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:50,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218896296] [2022-12-13 12:05:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:50,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:50,674 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-13 12:05:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:50,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218896296] [2022-12-13 12:05:50,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218896296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:50,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:50,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:50,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884653525] [2022-12-13 12:05:50,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:50,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:50,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:50,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:50,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 12:05:50,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:05:50,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:50,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 12:05:50,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:51,105 INFO L130 PetriNetUnfolder]: 2772/4610 cut-off events. [2022-12-13 12:05:51,105 INFO L131 PetriNetUnfolder]: For 5713/5721 co-relation queries the response was YES. [2022-12-13 12:05:51,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14426 conditions, 4610 events. 2772/4610 cut-off events. For 5713/5721 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 28918 event pairs, 793 based on Foata normal form. 10/3695 useless extension candidates. Maximal degree in co-relation 14406. Up to 3897 conditions per place. [2022-12-13 12:05:51,132 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 49 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2022-12-13 12:05:51,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 556 flow [2022-12-13 12:05:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:51,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 12:05:51,134 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 12:05:51,134 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 356 flow. Second operand 3 states and 59 transitions. [2022-12-13 12:05:51,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 556 flow [2022-12-13 12:05:51,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:05:51,138 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,139 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2022-12-13 12:05:51,139 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2022-12-13 12:05:51,139 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:51,139 INFO L89 Accepts]: Start accepts. Operand has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,140 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:51,140 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:51,140 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,192 INFO L130 PetriNetUnfolder]: 277/757 cut-off events. [2022-12-13 12:05:51,192 INFO L131 PetriNetUnfolder]: For 912/946 co-relation queries the response was YES. [2022-12-13 12:05:51,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 757 events. 277/757 cut-off events. For 912/946 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5362 event pairs, 82 based on Foata normal form. 2/578 useless extension candidates. Maximal degree in co-relation 2252. Up to 342 conditions per place. [2022-12-13 12:05:51,202 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,202 INFO L226 LiptonReduction]: Number of co-enabled transitions 826 [2022-12-13 12:05:51,204 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:51,205 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 12:05:51,205 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 393 flow [2022-12-13 12:05:51,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:05:51,205 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:51,205 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:51,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:05:51,205 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash 459180756, now seen corresponding path program 1 times [2022-12-13 12:05:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:51,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749544248] [2022-12-13 12:05:51,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:51,394 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-13 12:05:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749544248] [2022-12-13 12:05:51,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749544248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:51,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:51,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168544326] [2022-12-13 12:05:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:51,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2022-12-13 12:05:51,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 393 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 12:05:51,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:51,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2022-12-13 12:05:51,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:51,799 INFO L130 PetriNetUnfolder]: 2795/4666 cut-off events. [2022-12-13 12:05:51,799 INFO L131 PetriNetUnfolder]: For 6657/6671 co-relation queries the response was YES. [2022-12-13 12:05:51,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15239 conditions, 4666 events. 2795/4666 cut-off events. For 6657/6671 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 29445 event pairs, 413 based on Foata normal form. 14/3763 useless extension candidates. Maximal degree in co-relation 15216. Up to 3380 conditions per place. [2022-12-13 12:05:51,829 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 56 selfloop transitions, 12 changer transitions 1/86 dead transitions. [2022-12-13 12:05:51,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 693 flow [2022-12-13 12:05:51,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 12:05:51,831 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-13 12:05:51,831 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 393 flow. Second operand 4 states and 78 transitions. [2022-12-13 12:05:51,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 693 flow [2022-12-13 12:05:51,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 688 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:05:51,837 INFO L231 Difference]: Finished difference. Result has 57 places, 63 transitions, 462 flow [2022-12-13 12:05:51,838 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2022-12-13 12:05:51,839 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2022-12-13 12:05:51,840 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:51,840 INFO L89 Accepts]: Start accepts. Operand has 57 places, 63 transitions, 462 flow [2022-12-13 12:05:51,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:51,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:51,841 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 63 transitions, 462 flow [2022-12-13 12:05:51,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 462 flow [2022-12-13 12:05:51,893 INFO L130 PetriNetUnfolder]: 286/775 cut-off events. [2022-12-13 12:05:51,893 INFO L131 PetriNetUnfolder]: For 1295/1357 co-relation queries the response was YES. [2022-12-13 12:05:51,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 775 events. 286/775 cut-off events. For 1295/1357 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5514 event pairs, 53 based on Foata normal form. 8/599 useless extension candidates. Maximal degree in co-relation 2521. Up to 354 conditions per place. [2022-12-13 12:05:51,900 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 63 transitions, 462 flow [2022-12-13 12:05:51,900 INFO L226 LiptonReduction]: Number of co-enabled transitions 880 [2022-12-13 12:05:52,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [355] L2-1-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_80 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_80 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) (.cse2 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5))) (and (= v_~y$r_buff0_thd0~0_79 (ite .cse0 0 v_~y$r_buff0_thd0~0_80)) (= v_~y$w_buff1_used~0_137 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_138)) (= v_~y~0_100 (ite .cse2 v_~y$w_buff0~0_74 (ite .cse1 v_~y$w_buff1~0_70 v_~y~0_101))) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_137 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_79 256) 0)))) 0 v_~y$r_buff1_thd0~0_80) v_~y$r_buff1_thd0~0_79) (= (ite .cse2 0 v_~y$w_buff0_used~0_154) v_~y$w_buff0_used~0_153)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_80, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_101, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_80, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~y$w_buff0~0=v_~y$w_buff0~0_74, ~y~0=v_~y~0_100, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:05:52,130 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 12:05:52,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L755-->L758: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [400] $Ultimate##0-->L784: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11| 0)) (= v_~y$w_buff0~0_81 v_~y$w_buff1~0_76) (= v_~y$r_buff0_thd3~0_52 1) (= v_~y$r_buff0_thd2~0_39 v_~y$r_buff1_thd2~0_41) (= v_~y$w_buff0_used~0_163 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_163 256) 0)) (not (= (mod v_~y$w_buff1_used~0_145 256) 0)))) 1 0)) (= v_~y$r_buff0_thd0~0_83 v_~y$r_buff1_thd0~0_89) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_21) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_53 v_~y$r_buff1_thd3~0_45) (= 2 v_~y$w_buff0~0_80) (= v_~y$w_buff0_used~0_164 v_~y$w_buff1_used~0_145)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_164, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_53, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_81, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_45, ~y$w_buff1~0=v_~y$w_buff1~0_76, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_80, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_39, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_11|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_89, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_11|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_145} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-13 12:05:52,370 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:05:52,370 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-13 12:05:52,370 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 472 flow [2022-12-13 12:05:52,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 12:05:52,371 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:52,371 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:52,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:05:52,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:52,372 INFO L85 PathProgramCache]: Analyzing trace with hash -400826570, now seen corresponding path program 1 times [2022-12-13 12:05:52,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:52,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655453402] [2022-12-13 12:05:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:52,705 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-13 12:05:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:52,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655453402] [2022-12-13 12:05:52,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655453402] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:52,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:52,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612720233] [2022-12-13 12:05:52,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:52,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:52,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:52,706 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:05:52,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 472 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:05:52,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:52,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:05:52,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:53,122 INFO L130 PetriNetUnfolder]: 2665/4435 cut-off events. [2022-12-13 12:05:53,122 INFO L131 PetriNetUnfolder]: For 9617/9626 co-relation queries the response was YES. [2022-12-13 12:05:53,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15477 conditions, 4435 events. 2665/4435 cut-off events. For 9617/9626 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 27840 event pairs, 457 based on Foata normal form. 22/3572 useless extension candidates. Maximal degree in co-relation 15452. Up to 3331 conditions per place. [2022-12-13 12:05:53,143 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 51 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2022-12-13 12:05:53,143 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 688 flow [2022-12-13 12:05:53,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 12:05:53,144 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 12:05:53,144 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 472 flow. Second operand 3 states and 63 transitions. [2022-12-13 12:05:53,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 688 flow [2022-12-13 12:05:53,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 646 flow, removed 17 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:53,157 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,157 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2022-12-13 12:05:53,157 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -7 predicate places. [2022-12-13 12:05:53,157 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:53,157 INFO L89 Accepts]: Start accepts. Operand has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,158 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:53,158 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:53,159 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,212 INFO L130 PetriNetUnfolder]: 271/721 cut-off events. [2022-12-13 12:05:53,212 INFO L131 PetriNetUnfolder]: For 1240/1342 co-relation queries the response was YES. [2022-12-13 12:05:53,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 721 events. 271/721 cut-off events. For 1240/1342 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5028 event pairs, 43 based on Foata normal form. 3/553 useless extension candidates. Maximal degree in co-relation 2282. Up to 332 conditions per place. [2022-12-13 12:05:53,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,219 INFO L226 LiptonReduction]: Number of co-enabled transitions 856 [2022-12-13 12:05:53,220 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:53,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 12:05:53,221 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 464 flow [2022-12-13 12:05:53,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-13 12:05:53,221 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:53,221 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:53,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:05:53,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash 459183360, now seen corresponding path program 1 times [2022-12-13 12:05:53,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:53,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756938922] [2022-12-13 12:05:53,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:53,523 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-13 12:05:53,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:53,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756938922] [2022-12-13 12:05:53,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756938922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:53,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298909856] [2022-12-13 12:05:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:05:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:53,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:05:53,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:05:53,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:05:53,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 464 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-13 12:05:53,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:53,525 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:05:53,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:53,955 INFO L130 PetriNetUnfolder]: 2603/4347 cut-off events. [2022-12-13 12:05:53,956 INFO L131 PetriNetUnfolder]: For 8296/8300 co-relation queries the response was YES. [2022-12-13 12:05:53,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14575 conditions, 4347 events. 2603/4347 cut-off events. For 8296/8300 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 27337 event pairs, 606 based on Foata normal form. 11/3497 useless extension candidates. Maximal degree in co-relation 14549. Up to 3436 conditions per place. [2022-12-13 12:05:53,983 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 60 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2022-12-13 12:05:53,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 800 flow [2022-12-13 12:05:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-13 12:05:53,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2022-12-13 12:05:53,985 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 464 flow. Second operand 4 states and 80 transitions. [2022-12-13 12:05:53,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 800 flow [2022-12-13 12:05:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 91 transitions, 776 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:53,992 INFO L231 Difference]: Finished difference. Result has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:53,992 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=58, PETRI_TRANSITIONS=66} [2022-12-13 12:05:53,992 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -6 predicate places. [2022-12-13 12:05:53,992 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:53,992 INFO L89 Accepts]: Start accepts. Operand has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:53,993 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:53,993 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:53,993 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:53,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:54,055 INFO L130 PetriNetUnfolder]: 265/696 cut-off events. [2022-12-13 12:05:54,055 INFO L131 PetriNetUnfolder]: For 1142/1225 co-relation queries the response was YES. [2022-12-13 12:05:54,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 696 events. 265/696 cut-off events. For 1142/1225 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4771 event pairs, 41 based on Foata normal form. 3/536 useless extension candidates. Maximal degree in co-relation 2331. Up to 320 conditions per place. [2022-12-13 12:05:54,064 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:54,064 INFO L226 LiptonReduction]: Number of co-enabled transitions 904 [2022-12-13 12:05:54,067 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:54,067 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 12:05:54,068 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 66 transitions, 514 flow [2022-12-13 12:05:54,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-13 12:05:54,068 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:54,068 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:54,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:05:54,068 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 459185034, now seen corresponding path program 1 times [2022-12-13 12:05:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295886994] [2022-12-13 12:05:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:54,321 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-13 12:05:54,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:54,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295886994] [2022-12-13 12:05:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295886994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:54,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:54,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:54,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76122347] [2022-12-13 12:05:54,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:54,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:54,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:54,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:54,323 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:05:54,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 66 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 12:05:54,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:54,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:05:54,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:54,732 INFO L130 PetriNetUnfolder]: 2750/4526 cut-off events. [2022-12-13 12:05:54,732 INFO L131 PetriNetUnfolder]: For 9262/9302 co-relation queries the response was YES. [2022-12-13 12:05:54,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16051 conditions, 4526 events. 2750/4526 cut-off events. For 9262/9302 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 28277 event pairs, 1553 based on Foata normal form. 11/3649 useless extension candidates. Maximal degree in co-relation 16025. Up to 3873 conditions per place. [2022-12-13 12:05:54,755 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 54 selfloop transitions, 8 changer transitions 2/81 dead transitions. [2022-12-13 12:05:54,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 750 flow [2022-12-13 12:05:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-13 12:05:54,756 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 12:05:54,756 INFO L175 Difference]: Start difference. First operand has 58 places, 66 transitions, 514 flow. Second operand 4 states and 70 transitions. [2022-12-13 12:05:54,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 750 flow [2022-12-13 12:05:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 728 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:54,766 INFO L231 Difference]: Finished difference. Result has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,767 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=571, PETRI_PLACES=60, PETRI_TRANSITIONS=71} [2022-12-13 12:05:54,767 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -4 predicate places. [2022-12-13 12:05:54,768 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:54,768 INFO L89 Accepts]: Start accepts. Operand has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,769 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:54,769 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:54,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,818 INFO L130 PetriNetUnfolder]: 290/740 cut-off events. [2022-12-13 12:05:54,819 INFO L131 PetriNetUnfolder]: For 1359/1441 co-relation queries the response was YES. [2022-12-13 12:05:54,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 740 events. 290/740 cut-off events. For 1359/1441 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5081 event pairs, 39 based on Foata normal form. 3/578 useless extension candidates. Maximal degree in co-relation 2619. Up to 353 conditions per place. [2022-12-13 12:05:54,826 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,827 INFO L226 LiptonReduction]: Number of co-enabled transitions 962 [2022-12-13 12:05:54,828 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:54,829 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-13 12:05:54,829 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 71 transitions, 571 flow [2022-12-13 12:05:54,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-13 12:05:54,829 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:54,830 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:54,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:05:54,830 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:54,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 459277538, now seen corresponding path program 1 times [2022-12-13 12:05:54,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:54,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088460705] [2022-12-13 12:05:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:54,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:55,070 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-13 12:05:55,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088460705] [2022-12-13 12:05:55,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088460705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:55,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:55,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323150914] [2022-12-13 12:05:55,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:55,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:05:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:55,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:05:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:05:55,072 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:05:55,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 71 transitions, 571 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-13 12:05:55,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:55,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:05:55,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:55,520 INFO L130 PetriNetUnfolder]: 2923/4846 cut-off events. [2022-12-13 12:05:55,520 INFO L131 PetriNetUnfolder]: For 13264/13489 co-relation queries the response was YES. [2022-12-13 12:05:55,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17830 conditions, 4846 events. 2923/4846 cut-off events. For 13264/13489 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 31202 event pairs, 473 based on Foata normal form. 150/4063 useless extension candidates. Maximal degree in co-relation 17803. Up to 2888 conditions per place. [2022-12-13 12:05:55,554 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 64 selfloop transitions, 22 changer transitions 2/105 dead transitions. [2022-12-13 12:05:55,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 977 flow [2022-12-13 12:05:55,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:55,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 12:05:55,555 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2022-12-13 12:05:55,555 INFO L175 Difference]: Start difference. First operand has 60 places, 71 transitions, 571 flow. Second operand 4 states and 83 transitions. [2022-12-13 12:05:55,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 977 flow [2022-12-13 12:05:55,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 964 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:55,569 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,569 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=675, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-13 12:05:55,570 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2022-12-13 12:05:55,570 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:55,570 INFO L89 Accepts]: Start accepts. Operand has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,571 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:55,571 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:55,571 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,626 INFO L130 PetriNetUnfolder]: 288/776 cut-off events. [2022-12-13 12:05:55,626 INFO L131 PetriNetUnfolder]: For 1816/1898 co-relation queries the response was YES. [2022-12-13 12:05:55,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 776 events. 288/776 cut-off events. For 1816/1898 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5674 event pairs, 45 based on Foata normal form. 3/596 useless extension candidates. Maximal degree in co-relation 2940. Up to 353 conditions per place. [2022-12-13 12:05:55,634 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,634 INFO L226 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-13 12:05:55,636 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:55,637 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 12:05:55,637 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 675 flow [2022-12-13 12:05:55,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-13 12:05:55,638 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:55,638 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:55,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:05:55,638 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:55,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1349830913, now seen corresponding path program 1 times [2022-12-13 12:05:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:55,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325112305] [2022-12-13 12:05:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:55,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:56,056 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-13 12:05:56,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:56,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325112305] [2022-12-13 12:05:56,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325112305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:56,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:56,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:05:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164563525] [2022-12-13 12:05:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:56,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:05:56,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:05:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:05:56,058 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:05:56,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 675 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-13 12:05:56,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:56,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:05:56,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:56,492 INFO L130 PetriNetUnfolder]: 2816/4685 cut-off events. [2022-12-13 12:05:56,492 INFO L131 PetriNetUnfolder]: For 16085/16298 co-relation queries the response was YES. [2022-12-13 12:05:56,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17998 conditions, 4685 events. 2816/4685 cut-off events. For 16085/16298 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 30071 event pairs, 463 based on Foata normal form. 141/3901 useless extension candidates. Maximal degree in co-relation 17970. Up to 2226 conditions per place. [2022-12-13 12:05:56,522 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 64 selfloop transitions, 18 changer transitions 2/101 dead transitions. [2022-12-13 12:05:56,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 997 flow [2022-12-13 12:05:56,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:56,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 12:05:56,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2022-12-13 12:05:56,523 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 675 flow. Second operand 4 states and 82 transitions. [2022-12-13 12:05:56,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 997 flow [2022-12-13 12:05:56,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 101 transitions, 958 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 12:05:56,538 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,538 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=683, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2022-12-13 12:05:56,539 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-13 12:05:56,539 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:56,539 INFO L89 Accepts]: Start accepts. Operand has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,540 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:56,540 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:56,540 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,595 INFO L130 PetriNetUnfolder]: 278/754 cut-off events. [2022-12-13 12:05:56,608 INFO L131 PetriNetUnfolder]: For 2076/2142 co-relation queries the response was YES. [2022-12-13 12:05:56,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 754 events. 278/754 cut-off events. For 2076/2142 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5498 event pairs, 44 based on Foata normal form. 3/577 useless extension candidates. Maximal degree in co-relation 2851. Up to 340 conditions per place. [2022-12-13 12:05:56,616 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,616 INFO L226 LiptonReduction]: Number of co-enabled transitions 1004 [2022-12-13 12:05:56,618 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:56,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 79 [2022-12-13 12:05:56,618 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 683 flow [2022-12-13 12:05:56,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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-13 12:05:56,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:56,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:56,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:05:56,620 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1826681707, now seen corresponding path program 1 times [2022-12-13 12:05:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:56,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388359622] [2022-12-13 12:05:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:56,984 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-13 12:05:56,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:56,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388359622] [2022-12-13 12:05:56,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388359622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:56,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:56,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:56,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225589752] [2022-12-13 12:05:56,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:56,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:56,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:56,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:56,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:56,987 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2022-12-13 12:05:56,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 683 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 12:05:56,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:56,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2022-12-13 12:05:56,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:57,592 INFO L130 PetriNetUnfolder]: 4547/7435 cut-off events. [2022-12-13 12:05:57,592 INFO L131 PetriNetUnfolder]: For 21240/21240 co-relation queries the response was YES. [2022-12-13 12:05:57,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26598 conditions, 7435 events. 4547/7435 cut-off events. For 21240/21240 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 49464 event pairs, 909 based on Foata normal form. 75/5990 useless extension candidates. Maximal degree in co-relation 26569. Up to 2961 conditions per place. [2022-12-13 12:05:57,621 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 66 selfloop transitions, 15 changer transitions 28/116 dead transitions. [2022-12-13 12:05:57,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 116 transitions, 1164 flow [2022-12-13 12:05:57,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2022-12-13 12:05:57,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 12:05:57,622 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 683 flow. Second operand 4 states and 90 transitions. [2022-12-13 12:05:57,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 116 transitions, 1164 flow [2022-12-13 12:05:57,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 116 transitions, 1118 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:57,641 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,641 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2022-12-13 12:05:57,642 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2022-12-13 12:05:57,642 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:57,642 INFO L89 Accepts]: Start accepts. Operand has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,643 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:57,643 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:57,643 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,670 INFO L130 PetriNetUnfolder]: 121/439 cut-off events. [2022-12-13 12:05:57,670 INFO L131 PetriNetUnfolder]: For 1015/1033 co-relation queries the response was YES. [2022-12-13 12:05:57,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 439 events. 121/439 cut-off events. For 1015/1033 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3146 event pairs, 26 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1517. Up to 176 conditions per place. [2022-12-13 12:05:57,675 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,675 INFO L226 LiptonReduction]: Number of co-enabled transitions 684 [2022-12-13 12:05:57,676 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:57,677 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 12:05:57,677 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 564 flow [2022-12-13 12:05:57,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-13 12:05:57,677 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:57,677 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:05:57,677 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1965353603, now seen corresponding path program 1 times [2022-12-13 12:05:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:57,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038968430] [2022-12-13 12:05:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:57,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:57,757 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-13 12:05:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038968430] [2022-12-13 12:05:57,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038968430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:57,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:57,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:05:57,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549911599] [2022-12-13 12:05:57,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:57,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:05:57,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:57,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:05:57,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:05:57,758 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 12:05:57,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 12:05:57,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:57,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 12:05:57,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:58,038 INFO L130 PetriNetUnfolder]: 2456/3992 cut-off events. [2022-12-13 12:05:58,038 INFO L131 PetriNetUnfolder]: For 13130/13155 co-relation queries the response was YES. [2022-12-13 12:05:58,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13671 conditions, 3992 events. 2456/3992 cut-off events. For 13130/13155 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 24370 event pairs, 902 based on Foata normal form. 56/2479 useless extension candidates. Maximal degree in co-relation 13640. Up to 3826 conditions per place. [2022-12-13 12:05:58,058 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 64 selfloop transitions, 10 changer transitions 3/87 dead transitions. [2022-12-13 12:05:58,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 905 flow [2022-12-13 12:05:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:05:58,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:05:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 12:05:58,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 12:05:58,060 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 564 flow. Second operand 3 states and 63 transitions. [2022-12-13 12:05:58,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 905 flow [2022-12-13 12:05:58,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 87 transitions, 811 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 12:05:58,067 INFO L231 Difference]: Finished difference. Result has 64 places, 68 transitions, 525 flow [2022-12-13 12:05:58,068 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=64, PETRI_TRANSITIONS=68} [2022-12-13 12:05:58,068 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 0 predicate places. [2022-12-13 12:05:58,068 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:58,068 INFO L89 Accepts]: Start accepts. Operand has 64 places, 68 transitions, 525 flow [2022-12-13 12:05:58,069 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:58,069 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:58,069 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 68 transitions, 525 flow [2022-12-13 12:05:58,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 68 transitions, 525 flow [2022-12-13 12:05:58,225 INFO L130 PetriNetUnfolder]: 1333/2624 cut-off events. [2022-12-13 12:05:58,225 INFO L131 PetriNetUnfolder]: For 2427/2467 co-relation queries the response was YES. [2022-12-13 12:05:58,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6922 conditions, 2624 events. 1333/2624 cut-off events. For 2427/2467 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 21100 event pairs, 589 based on Foata normal form. 1/1333 useless extension candidates. Maximal degree in co-relation 6896. Up to 2047 conditions per place. [2022-12-13 12:05:58,241 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 68 transitions, 525 flow [2022-12-13 12:05:58,241 INFO L226 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-13 12:05:58,378 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:05:58,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 311 [2022-12-13 12:05:58,379 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 527 flow [2022-12-13 12:05:58,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-13 12:05:58,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:58,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:58,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:05:58,380 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1653862255, now seen corresponding path program 1 times [2022-12-13 12:05:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:58,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398726519] [2022-12-13 12:05:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:58,469 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-13 12:05:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:58,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398726519] [2022-12-13 12:05:58,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398726519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:58,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:58,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:05:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921249903] [2022-12-13 12:05:58,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:58,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:05:58,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:05:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:05:58,471 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2022-12-13 12:05:58,472 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 12:05:58,472 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:58,472 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2022-12-13 12:05:58,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:58,679 INFO L130 PetriNetUnfolder]: 1256/2325 cut-off events. [2022-12-13 12:05:58,679 INFO L131 PetriNetUnfolder]: For 6181/6302 co-relation queries the response was YES. [2022-12-13 12:05:58,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9263 conditions, 2325 events. 1256/2325 cut-off events. For 6181/6302 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 15087 event pairs, 167 based on Foata normal form. 143/1589 useless extension candidates. Maximal degree in co-relation 9234. Up to 1954 conditions per place. [2022-12-13 12:05:58,691 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 67 selfloop transitions, 19 changer transitions 4/100 dead transitions. [2022-12-13 12:05:58,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 962 flow [2022-12-13 12:05:58,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:05:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:05:58,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 12:05:58,693 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 12:05:58,693 INFO L175 Difference]: Start difference. First operand has 64 places, 68 transitions, 527 flow. Second operand 4 states and 84 transitions. [2022-12-13 12:05:58,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 962 flow [2022-12-13 12:05:58,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 935 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 12:05:58,704 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,704 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=593, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2022-12-13 12:05:58,704 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 1 predicate places. [2022-12-13 12:05:58,704 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:58,704 INFO L89 Accepts]: Start accepts. Operand has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,705 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:58,705 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:58,706 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,809 INFO L130 PetriNetUnfolder]: 795/1723 cut-off events. [2022-12-13 12:05:58,809 INFO L131 PetriNetUnfolder]: For 2154/2578 co-relation queries the response was YES. [2022-12-13 12:05:58,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6224 conditions, 1723 events. 795/1723 cut-off events. For 2154/2578 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 13597 event pairs, 154 based on Foata normal form. 14/1022 useless extension candidates. Maximal degree in co-relation 6198. Up to 1213 conditions per place. [2022-12-13 12:05:58,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 632 [2022-12-13 12:05:58,826 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:05:58,828 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-13 12:05:58,828 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 593 flow [2022-12-13 12:05:58,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-13 12:05:58,828 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:05:58,828 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:05:58,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:05:58,828 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:05:58,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:05:58,828 INFO L85 PathProgramCache]: Analyzing trace with hash -644886917, now seen corresponding path program 1 times [2022-12-13 12:05:58,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:05:58,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27115612] [2022-12-13 12:05:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:05:58,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:05:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:05:58,947 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-13 12:05:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:05:58,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27115612] [2022-12-13 12:05:58,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27115612] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:05:58,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:05:58,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:05:58,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978594664] [2022-12-13 12:05:58,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:05:58,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:05:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:05:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:05:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:05:58,949 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 12:05:58,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-13 12:05:58,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:05:58,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 12:05:58,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:05:59,092 INFO L130 PetriNetUnfolder]: 565/1184 cut-off events. [2022-12-13 12:05:59,092 INFO L131 PetriNetUnfolder]: For 2297/2502 co-relation queries the response was YES. [2022-12-13 12:05:59,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5625 conditions, 1184 events. 565/1184 cut-off events. For 2297/2502 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7392 event pairs, 5 based on Foata normal form. 205/872 useless extension candidates. Maximal degree in co-relation 5596. Up to 817 conditions per place. [2022-12-13 12:05:59,097 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 33 selfloop transitions, 28 changer transitions 29/96 dead transitions. [2022-12-13 12:05:59,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 96 transitions, 954 flow [2022-12-13 12:05:59,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:05:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:05:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 12:05:59,099 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-13 12:05:59,099 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 593 flow. Second operand 5 states and 90 transitions. [2022-12-13 12:05:59,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 96 transitions, 954 flow [2022-12-13 12:05:59,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 870 flow, removed 17 selfloop flow, removed 4 redundant places. [2022-12-13 12:05:59,105 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 405 flow [2022-12-13 12:05:59,105 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2022-12-13 12:05:59,105 INFO L295 CegarLoopForPetriNet]: 64 programPoint places, 2 predicate places. [2022-12-13 12:05:59,105 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:05:59,105 INFO L89 Accepts]: Start accepts. Operand has 66 places, 54 transitions, 405 flow [2022-12-13 12:05:59,106 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:05:59,106 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:05:59,106 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 54 transitions, 405 flow [2022-12-13 12:05:59,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions, 405 flow [2022-12-13 12:05:59,124 INFO L130 PetriNetUnfolder]: 113/318 cut-off events. [2022-12-13 12:05:59,124 INFO L131 PetriNetUnfolder]: For 234/288 co-relation queries the response was YES. [2022-12-13 12:05:59,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 318 events. 113/318 cut-off events. For 234/288 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1836 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 1121. Up to 217 conditions per place. [2022-12-13 12:05:59,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 54 transitions, 405 flow [2022-12-13 12:05:59,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 294 [2022-12-13 12:06:00,013 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [460] $Ultimate##0-->L787: Formula: (and (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33| 0)) (= v_~y$w_buff1~0_352 v_~y$w_buff0~0_371) (= v_~z~0_152 1) (= v_~y$r_buff0_thd3~0_112 1) (= v_~y$w_buff0_used~0_510 v_~y$w_buff1_used~0_475) (= 2 v_~y$w_buff0~0_370) (= |v_P2Thread1of1ForFork0_~arg#1.offset_29| |v_P2Thread1of1ForFork0_#in~arg#1.offset_29|) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_29| |v_P2Thread1of1ForFork0_~arg#1.base_29|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|) (= v_~y$r_buff0_thd3~0_113 v_~y$r_buff1_thd3~0_87) (= v_~y$r_buff0_thd1~0_43 v_~y$r_buff1_thd1~0_47) (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff1_thd2~0_98) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_509 256) 0)) (not (= (mod v_~y$w_buff1_used~0_475 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|) (= v_~y$w_buff0_used~0_509 1) (= v_~y$r_buff0_thd0~0_365 v_~y$r_buff1_thd0~0_374)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_510, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_113, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_365, ~y$w_buff0~0=v_~y$w_buff0~0_371, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_509, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_98, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_29|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_87, ~y$w_buff1~0=v_~y$w_buff1~0_352, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_29|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_112, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_365, ~y$w_buff0~0=v_~y$w_buff0~0_370, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_43, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_33|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_29|, ~z~0=v_~z~0_152, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_374, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_33|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_475} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [432] $Ultimate##0-->L740: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~z~0_55 2)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_55, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-13 12:06:00,144 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 12:06:00,145 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1040 [2022-12-13 12:06:00,145 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 413 flow [2022-12-13 12:06:00,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-13 12:06:00,145 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:06:00,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:00,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:06:00,145 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 12:06:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1022455729, now seen corresponding path program 1 times [2022-12-13 12:06:00,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:00,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550754287] [2022-12-13 12:06:00,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:00,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:00,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:00,235 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:06:00,252 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 12:06:00,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 12:06:00,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 12:06:00,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 12:06:00,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 12:06:00,254 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 12:06:00,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:06:00,254 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:00,258 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:06:00,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:06:00,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:06:00 BasicIcfg [2022-12-13 12:06:00,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:06:00,335 INFO L158 Benchmark]: Toolchain (without parser) took 23598.15ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 181.8MB in the beginning and 1.0GB in the end (delta: -827.8MB). Peak memory consumption was 234.5MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,335 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:06:00,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.78ms. Allocated memory is still 207.6MB. Free memory was 181.3MB in the beginning and 155.6MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.21ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 153.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,336 INFO L158 Benchmark]: Boogie Preprocessor took 22.12ms. Allocated memory is still 207.6MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,336 INFO L158 Benchmark]: RCFGBuilder took 654.41ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 118.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,336 INFO L158 Benchmark]: TraceAbstraction took 22352.96ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.9MB in the beginning and 1.0GB in the end (delta: -891.7MB). Peak memory consumption was 170.5MB. Max. memory is 8.0GB. [2022-12-13 12:06:00,337 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.12ms. Allocated memory is still 207.6MB. Free memory is still 183.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 522.78ms. Allocated memory is still 207.6MB. Free memory was 181.3MB in the beginning and 155.6MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.21ms. Allocated memory is still 207.6MB. Free memory was 155.6MB in the beginning and 153.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.12ms. Allocated memory is still 207.6MB. Free memory was 153.0MB in the beginning and 151.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 654.41ms. Allocated memory is still 207.6MB. Free memory was 150.9MB in the beginning and 118.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22352.96ms. Allocated memory was 207.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 117.9MB in the beginning and 1.0GB in the end (delta: -891.7MB). Peak memory consumption was 170.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.8s, 110 PlacesBefore, 64 PlacesAfterwards, 102 TransitionsBefore, 54 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 42 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3148, independent: 2926, independent conditional: 2926, independent unconditional: 0, dependent: 222, dependent conditional: 222, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3148, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3148, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3148, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1673, independent: 1620, independent conditional: 0, independent unconditional: 1620, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1673, independent: 1569, independent conditional: 0, independent unconditional: 1569, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 104, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3148, independent: 1306, independent conditional: 0, independent unconditional: 1306, dependent: 169, dependent conditional: 0, dependent unconditional: 169, unknown: 1673, unknown conditional: 0, unknown unconditional: 1673] , Statistics on independence cache: Total cache size (in pairs): 2866, Positive cache size: 2813, Positive conditional cache size: 0, Positive unconditional cache size: 2813, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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.1s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 502 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 285, independent: 253, independent conditional: 253, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 285, independent: 253, independent conditional: 18, independent unconditional: 235, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 285, independent: 253, independent conditional: 18, independent unconditional: 235, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 285, independent: 253, independent conditional: 18, independent unconditional: 235, dependent: 32, dependent conditional: 5, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 218, independent: 198, independent conditional: 14, independent unconditional: 184, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 218, independent: 180, independent conditional: 0, independent unconditional: 180, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 38, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 20, dependent conditional: 2, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 39, dependent conditional: 11, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, independent: 55, independent conditional: 4, independent unconditional: 51, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 218, unknown conditional: 16, unknown unconditional: 202] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 198, Positive conditional cache size: 14, Positive unconditional cache size: 184, Negative cache size: 20, Negative conditional cache size: 2, Negative unconditional cache size: 18, 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, 43 PlacesBefore, 43 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, independent: 97, independent conditional: 97, 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: 104, independent: 97, independent conditional: 21, independent unconditional: 76, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 97, independent conditional: 5, independent unconditional: 92, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, independent: 97, independent conditional: 5, independent unconditional: 92, dependent: 7, dependent conditional: 5, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, 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: 6, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 104, independent: 93, independent conditional: 3, independent unconditional: 90, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 202, Positive conditional cache size: 16, Positive unconditional cache size: 186, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 7, independent unconditional: 40, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 52, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 52, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 224, Positive cache size: 202, Positive conditional cache size: 16, Positive unconditional cache size: 186, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 68, independent conditional: 68, 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: 77, independent: 68, independent conditional: 20, independent unconditional: 48, 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: 77, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 77, independent: 68, independent conditional: 0, independent unconditional: 68, 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: 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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, independent: 68, independent conditional: 0, independent unconditional: 68, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 202, Positive conditional cache size: 16, Positive unconditional cache size: 186, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 12, 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: 16, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 202, Positive conditional cache size: 16, Positive unconditional cache size: 186, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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.5s, 57 PlacesBefore, 56 PlacesAfterwards, 63 TransitionsBefore, 62 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 87, independent: 79, independent conditional: 71, independent unconditional: 8, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, independent: 79, independent conditional: 0, independent unconditional: 79, 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: 87, independent: 79, independent conditional: 0, independent unconditional: 79, 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: 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: 87, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 71, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 856 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 58 PlacesBefore, 58 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 60 PlacesBefore, 60 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 962 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 62 PlacesBefore, 62 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 64 PlacesBefore, 64 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 10, independent unconditional: 5, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, 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: 20, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 66 PlacesBefore, 66 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 12, 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: 18, independent: 12, independent conditional: 6, independent unconditional: 6, 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: 18, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 18, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 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: 18, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 256, Positive conditional cache size: 16, Positive unconditional cache size: 240, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 64 PlacesBefore, 64 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 23, 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: 23, independent: 23, independent conditional: 14, independent unconditional: 9, 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: 23, independent: 23, independent conditional: 7, independent unconditional: 16, 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: 23, independent: 23, independent conditional: 7, independent unconditional: 16, 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: 11, independent: 11, independent conditional: 4, independent unconditional: 7, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 23, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 273, Positive conditional cache size: 20, Positive unconditional cache size: 253, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 273, Positive conditional cache size: 20, Positive unconditional cache size: 253, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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: 1.0s, 63 PlacesBefore, 60 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 294 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, 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: 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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 9, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 316, Positive conditional cache size: 25, Positive unconditional cache size: 291, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-2, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 [L786] 3 z = 1 [L739] 3 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 313 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1001 IncrementalHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 24 mSDtfsCounter, 1001 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=683occurred in iteration=11, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:06:00,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...