/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:50:13,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:50:13,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:50:13,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:50:13,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:50:13,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:50:13,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:50:13,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:50:13,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:50:13,156 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:50:13,157 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:50:13,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:50:13,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:50:13,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:50:13,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:50:13,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:50:13,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:50:13,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:50:13,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:50:13,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:50:13,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:50:13,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:50:13,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:50:13,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:50:13,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:50:13,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:50:13,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:50:13,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:50:13,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:50:13,187 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:50:13,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:50:13,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:50:13,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:50:13,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:50:13,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:50:13,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:50:13,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:50:13,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:50:13,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:50:13,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:50:13,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:50:13,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:50:13,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:50:13,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:50:13,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:50:13,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:50:13,241 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:50:13,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:50:13,242 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:50:13,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:50:13,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:50:13,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:50:13,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:50:13,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:50:13,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:50:13,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:50:13,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:50:13,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:50:13,245 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:50:13,245 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:50:13,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:50:13,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:50:13,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:50:13,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:50:13,542 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:50:13,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2022-12-13 07:50:14,674 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:50:14,902 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:50:14,903 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2022-12-13 07:50:14,912 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262a0a3c5/6533d20a89114484860c192e8639bf05/FLAG2a0611235 [2022-12-13 07:50:14,923 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/262a0a3c5/6533d20a89114484860c192e8639bf05 [2022-12-13 07:50:14,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:50:14,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:50:14,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:50:14,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:50:14,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:50:14,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:14" (1/1) ... [2022-12-13 07:50:14,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4210db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:14, skipping insertion in model container [2022-12-13 07:50:14,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:50:14" (1/1) ... [2022-12-13 07:50:14,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:50:14,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:50:15,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,116 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,136 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-12-13 07:50:15,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:50:15,155 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:50:15,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,173 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,175 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:50:15,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:50:15,195 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-12-13 07:50:15,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:50:15,208 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:50:15,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15 WrapperNode [2022-12-13 07:50:15,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:50:15,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:50:15,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:50:15,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:50:15,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,264 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2022-12-13 07:50:15,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:50:15,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:50:15,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:50:15,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:50:15,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:50:15,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:50:15,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:50:15,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:50:15,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (1/1) ... [2022-12-13 07:50:15,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:50:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:15,340 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 07:50:15,363 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 07:50:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:50:15,381 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:50:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:50:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:50:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:50:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:50:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:50:15,382 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 07:50:15,382 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:50:15,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:50:15,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:50:15,385 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 07:50:15,498 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:50:15,500 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:50:15,673 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:50:15,727 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:50:15,728 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 07:50:15,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:15 BoogieIcfgContainer [2022-12-13 07:50:15,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:50:15,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:50:15,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:50:15,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:50:15,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:50:14" (1/3) ... [2022-12-13 07:50:15,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eac6c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:15, skipping insertion in model container [2022-12-13 07:50:15,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:50:15" (2/3) ... [2022-12-13 07:50:15,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eac6c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:50:15, skipping insertion in model container [2022-12-13 07:50:15,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:50:15" (3/3) ... [2022-12-13 07:50:15,747 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2022-12-13 07:50:15,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:50:15,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:50:15,795 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:50:15,902 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 07:50:15,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 123 transitions, 278 flow [2022-12-13 07:50:16,000 INFO L130 PetriNetUnfolder]: 9/119 cut-off events. [2022-12-13 07:50:16,000 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:50:16,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 119 events. 9/119 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 07:50:16,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 123 transitions, 278 flow [2022-12-13 07:50:16,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 107 transitions, 238 flow [2022-12-13 07:50:16,013 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:16,028 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 107 transitions, 238 flow [2022-12-13 07:50:16,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 107 transitions, 238 flow [2022-12-13 07:50:16,085 INFO L130 PetriNetUnfolder]: 9/107 cut-off events. [2022-12-13 07:50:16,085 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:50:16,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 107 events. 9/107 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 07:50:16,090 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 107 transitions, 238 flow [2022-12-13 07:50:16,090 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 07:50:19,234 INFO L241 LiptonReduction]: Total number of compositions: 78 [2022-12-13 07:50:19,249 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:50:19,254 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;@461d665c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:50:19,255 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 07:50:19,262 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-13 07:50:19,262 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:50:19,262 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:19,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:19,263 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:19,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:19,268 INFO L85 PathProgramCache]: Analyzing trace with hash 351158390, now seen corresponding path program 1 times [2022-12-13 07:50:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:19,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709591080] [2022-12-13 07:50:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:19,702 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 07:50:19,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:19,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709591080] [2022-12-13 07:50:19,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709591080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:19,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:19,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:50:19,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988614204] [2022-12-13 07:50:19,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:19,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:50:19,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:19,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:50:19,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:50:19,737 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:50:19,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 07:50:19,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:19,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:50:19,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:20,005 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2022-12-13 07:50:20,005 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 07:50:20,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6328 event pairs, 141 based on Foata normal form. 1/1139 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2022-12-13 07:50:20,026 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-13 07:50:20,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2022-12-13 07:50:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:50:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:50:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 07:50:20,037 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 07:50:20,042 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-13 07:50:20,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 51 transitions, 241 flow [2022-12-13 07:50:20,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 50 transitions, 234 flow [2022-12-13 07:50:20,067 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:20,068 INFO L89 Accepts]: Start accepts. Operand has 40 places, 50 transitions, 234 flow [2022-12-13 07:50:20,072 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:20,072 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:20,072 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 50 transitions, 234 flow [2022-12-13 07:50:20,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 50 transitions, 234 flow [2022-12-13 07:50:20,079 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 07:50:20,080 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:20,082 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:50:20,082 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 50 transitions, 234 flow [2022-12-13 07:50:20,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 07:50:20,082 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:20,082 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:20,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:50:20,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:20,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash -53156906, now seen corresponding path program 1 times [2022-12-13 07:50:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:20,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98801257] [2022-12-13 07:50:20,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:20,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98801257] [2022-12-13 07:50:20,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98801257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:20,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:20,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881083706] [2022-12-13 07:50:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:20,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:20,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:20,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:20,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:20,233 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:20,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 50 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:20,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:20,234 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:20,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:20,601 INFO L130 PetriNetUnfolder]: 2531/3320 cut-off events. [2022-12-13 07:50:20,602 INFO L131 PetriNetUnfolder]: For 661/695 co-relation queries the response was YES. [2022-12-13 07:50:20,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9944 conditions, 3320 events. 2531/3320 cut-off events. For 661/695 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 13414 event pairs, 169 based on Foata normal form. 2/2117 useless extension candidates. Maximal degree in co-relation 7400. Up to 2593 conditions per place. [2022-12-13 07:50:20,629 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 132 selfloop transitions, 6 changer transitions 0/140 dead transitions. [2022-12-13 07:50:20,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:50:20,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:50:20,634 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-13 07:50:20,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,683 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:20,684 INFO L89 Accepts]: Start accepts. Operand has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,686 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:20,686 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:20,686 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,694 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,694 INFO L226 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-13 07:50:20,698 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:20,699 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:50:20,700 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 140 transitions, 935 flow [2022-12-13 07:50:20,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:20,700 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:20,700 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:20,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:50:20,700 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:20,701 INFO L85 PathProgramCache]: Analyzing trace with hash 337755006, now seen corresponding path program 2 times [2022-12-13 07:50:20,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:20,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085251101] [2022-12-13 07:50:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:20,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:20,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:20,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085251101] [2022-12-13 07:50:20,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085251101] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:20,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642397944] [2022-12-13 07:50:20,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:50:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:20,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:20,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:20,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:50:20,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:50:20,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:20,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:21,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:21,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:21,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642397944] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:21,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:21,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:50:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168035724] [2022-12-13 07:50:21,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:21,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:50:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:50:21,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:50:21,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:21,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 140 transitions, 935 flow. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 07:50:21,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:21,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:21,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:21,779 INFO L130 PetriNetUnfolder]: 4039/5249 cut-off events. [2022-12-13 07:50:21,779 INFO L131 PetriNetUnfolder]: For 1162/1189 co-relation queries the response was YES. [2022-12-13 07:50:21,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21071 conditions, 5249 events. 4039/5249 cut-off events. For 1162/1189 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 22595 event pairs, 303 based on Foata normal form. 1/3312 useless extension candidates. Maximal degree in co-relation 19417. Up to 4465 conditions per place. [2022-12-13 07:50:21,821 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 250 selfloop transitions, 11 changer transitions 0/263 dead transitions. [2022-12-13 07:50:21,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 07:50:21,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-13 07:50:21,823 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 07:50:21,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,850 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,887 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:21,887 INFO L89 Accepts]: Start accepts. Operand has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,889 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:21,889 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:21,889 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,903 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,904 INFO L226 LiptonReduction]: Number of co-enabled transitions 634 [2022-12-13 07:50:21,907 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:21,908 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 07:50:21,908 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 263 transitions, 2269 flow [2022-12-13 07:50:21,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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 07:50:21,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:21,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:21,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:22,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:22,115 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:22,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:22,116 INFO L85 PathProgramCache]: Analyzing trace with hash -793381021, now seen corresponding path program 1 times [2022-12-13 07:50:22,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:22,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115923362] [2022-12-13 07:50:22,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:22,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:22,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115923362] [2022-12-13 07:50:22,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115923362] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:22,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:22,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:22,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354840954] [2022-12-13 07:50:22,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:22,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:22,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:22,231 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:22,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 263 transitions, 2269 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:22,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:22,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:22,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:23,115 INFO L130 PetriNetUnfolder]: 6147/8246 cut-off events. [2022-12-13 07:50:23,116 INFO L131 PetriNetUnfolder]: For 8858/9404 co-relation queries the response was YES. [2022-12-13 07:50:23,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38917 conditions, 8246 events. 6147/8246 cut-off events. For 8858/9404 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 37426 event pairs, 470 based on Foata normal form. 168/5823 useless extension candidates. Maximal degree in co-relation 35632. Up to 6152 conditions per place. [2022-12-13 07:50:23,167 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 642 selfloop transitions, 38 changer transitions 29/715 dead transitions. [2022-12-13 07:50:23,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 715 transitions, 7570 flow [2022-12-13 07:50:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 07:50:23,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5793103448275863 [2022-12-13 07:50:23,172 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 07:50:23,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 715 transitions, 7570 flow [2022-12-13 07:50:23,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 686 transitions, 7250 flow [2022-12-13 07:50:23,270 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:23,271 INFO L89 Accepts]: Start accepts. Operand has 52 places, 686 transitions, 7250 flow [2022-12-13 07:50:23,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:23,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:23,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 686 transitions, 7250 flow [2022-12-13 07:50:23,291 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 686 transitions, 7250 flow [2022-12-13 07:50:23,291 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 07:50:23,296 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:23,299 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 07:50:23,300 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 686 transitions, 7250 flow [2022-12-13 07:50:23,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:23,300 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:23,300 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:23,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:50:23,300 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1535623759, now seen corresponding path program 1 times [2022-12-13 07:50:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:23,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826155966] [2022-12-13 07:50:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:23,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:23,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:23,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826155966] [2022-12-13 07:50:23,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826155966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:23,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:23,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087428788] [2022-12-13 07:50:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:23,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:23,389 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:23,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 686 transitions, 7250 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:23,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:23,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:25,018 INFO L130 PetriNetUnfolder]: 9330/12520 cut-off events. [2022-12-13 07:50:25,018 INFO L131 PetriNetUnfolder]: For 17575/18812 co-relation queries the response was YES. [2022-12-13 07:50:25,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71853 conditions, 12520 events. 9330/12520 cut-off events. For 17575/18812 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 61194 event pairs, 440 based on Foata normal form. 316/8804 useless extension candidates. Maximal degree in co-relation 69041. Up to 10041 conditions per place. [2022-12-13 07:50:25,103 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1437 selfloop transitions, 99 changer transitions 73/1615 dead transitions. [2022-12-13 07:50:25,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1615 transitions, 20289 flow [2022-12-13 07:50:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:50:25,105 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:50:25,105 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 07:50:25,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 1615 transitions, 20289 flow [2022-12-13 07:50:25,187 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 1542 transitions, 19353 flow [2022-12-13 07:50:25,255 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:25,256 INFO L89 Accepts]: Start accepts. Operand has 56 places, 1542 transitions, 19353 flow [2022-12-13 07:50:25,263 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:25,263 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:25,263 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 1542 transitions, 19353 flow [2022-12-13 07:50:25,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 1542 transitions, 19353 flow [2022-12-13 07:50:25,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-13 07:50:25,320 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:25,320 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 07:50:25,321 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 1542 transitions, 19353 flow [2022-12-13 07:50:25,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:25,321 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:25,321 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:25,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:50:25,321 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:25,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2034658999, now seen corresponding path program 2 times [2022-12-13 07:50:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:25,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210190620] [2022-12-13 07:50:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:25,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210190620] [2022-12-13 07:50:25,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210190620] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407094198] [2022-12-13 07:50:25,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:50:25,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:25,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:25,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:50:25,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:50:25,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:25,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:25,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:25,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:25,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407094198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:25,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:50:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343547895] [2022-12-13 07:50:25,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:25,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:50:25,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:50:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:50:25,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:25,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 1542 transitions, 19353 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:50:25,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:25,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:25,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:27,693 INFO L130 PetriNetUnfolder]: 9852/13166 cut-off events. [2022-12-13 07:50:27,693 INFO L131 PetriNetUnfolder]: For 24960/26699 co-relation queries the response was YES. [2022-12-13 07:50:27,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88193 conditions, 13166 events. 9852/13166 cut-off events. For 24960/26699 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 64277 event pairs, 216 based on Foata normal form. 618/9626 useless extension candidates. Maximal degree in co-relation 84902. Up to 10807 conditions per place. [2022-12-13 07:50:27,781 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1765 selfloop transitions, 59 changer transitions 0/1830 dead transitions. [2022-12-13 07:50:27,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:50:27,783 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:50:27,783 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 07:50:27,784 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:27,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:28,032 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:28,032 INFO L89 Accepts]: Start accepts. Operand has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:28,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:28,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:28,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:28,078 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:28,078 INFO L226 LiptonReduction]: Number of co-enabled transitions 80 [2022-12-13 07:50:28,084 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:28,084 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 07:50:28,084 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 1830 transitions, 26589 flow [2022-12-13 07:50:28,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:50:28,085 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:28,085 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:28,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:28,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 07:50:28,289 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1883175054, now seen corresponding path program 1 times [2022-12-13 07:50:28,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:28,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243044909] [2022-12-13 07:50:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:28,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243044909] [2022-12-13 07:50:28,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243044909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:28,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:28,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88503273] [2022-12-13 07:50:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:28,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:28,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:28,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:28,376 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:28,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 1830 transitions, 26589 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:28,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:28,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:28,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:30,897 INFO L130 PetriNetUnfolder]: 10434/14093 cut-off events. [2022-12-13 07:50:30,897 INFO L131 PetriNetUnfolder]: For 34809/37632 co-relation queries the response was YES. [2022-12-13 07:50:30,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107767 conditions, 14093 events. 10434/14093 cut-off events. For 34809/37632 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 71249 event pairs, 98 based on Foata normal form. 897/10665 useless extension candidates. Maximal degree in co-relation 103679. Up to 11412 conditions per place. [2022-12-13 07:50:30,978 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2163 selfloop transitions, 143 changer transitions 131/2444 dead transitions. [2022-12-13 07:50:30,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 2444 transitions, 40321 flow [2022-12-13 07:50:30,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 07:50:30,980 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2022-12-13 07:50:30,980 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2022-12-13 07:50:30,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 2444 transitions, 40321 flow [2022-12-13 07:50:31,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 2313 transitions, 38138 flow [2022-12-13 07:50:31,129 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:31,130 INFO L89 Accepts]: Start accepts. Operand has 64 places, 2313 transitions, 38138 flow [2022-12-13 07:50:31,141 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:31,141 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:31,141 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 2313 transitions, 38138 flow [2022-12-13 07:50:31,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 2313 transitions, 38138 flow [2022-12-13 07:50:31,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 94 [2022-12-13 07:50:31,221 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:31,221 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 07:50:31,221 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 2313 transitions, 38138 flow [2022-12-13 07:50:31,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:31,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:31,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:31,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:50:31,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:31,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:31,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1280647857, now seen corresponding path program 2 times [2022-12-13 07:50:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:31,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731545047] [2022-12-13 07:50:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:31,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:31,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731545047] [2022-12-13 07:50:31,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731545047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:31,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746304643] [2022-12-13 07:50:31,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:50:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:31,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:31,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:50:31,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:50:31,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:31,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:31,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:31,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746304643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:31,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:31,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:50:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859026450] [2022-12-13 07:50:31,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:31,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:50:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:50:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:50:31,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:31,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 2313 transitions, 38138 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:50:31,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:31,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:31,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:34,319 INFO L130 PetriNetUnfolder]: 10788/14463 cut-off events. [2022-12-13 07:50:34,320 INFO L131 PetriNetUnfolder]: For 40942/43663 co-relation queries the response was YES. [2022-12-13 07:50:34,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124604 conditions, 14463 events. 10788/14463 cut-off events. For 40942/43663 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 71687 event pairs, 24 based on Foata normal form. 621/10743 useless extension candidates. Maximal degree in co-relation 120110. Up to 12154 conditions per place. [2022-12-13 07:50:34,401 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2592 selfloop transitions, 116 changer transitions 0/2715 dead transitions. [2022-12-13 07:50:34,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 07:50:34,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-13 07:50:34,403 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 07:50:34,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,489 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,718 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:34,718 INFO L89 Accepts]: Start accepts. Operand has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,733 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:34,733 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:34,733 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,814 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,814 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 07:50:34,822 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:34,825 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 07:50:34,825 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 2715 transitions, 50155 flow [2022-12-13 07:50:34,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:50:34,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:34,826 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:34,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:35,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:35,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:35,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:35,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1520248971, now seen corresponding path program 3 times [2022-12-13 07:50:35,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156529158] [2022-12-13 07:50:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:35,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:35,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:35,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:35,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156529158] [2022-12-13 07:50:35,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156529158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:35,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119691248] [2022-12-13 07:50:35,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:50:35,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:35,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:35,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:35,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:50:35,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:50:35,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:35,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:35,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:35,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:35,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119691248] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:35,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:35,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:50:35,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117350204] [2022-12-13 07:50:35,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:35,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:50:35,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:35,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:50:35,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:50:35,283 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:35,283 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 2715 transitions, 50155 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 07:50:35,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:35,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:35,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:39,723 INFO L130 PetriNetUnfolder]: 13006/17536 cut-off events. [2022-12-13 07:50:39,723 INFO L131 PetriNetUnfolder]: For 50376/53114 co-relation queries the response was YES. [2022-12-13 07:50:39,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168102 conditions, 17536 events. 13006/17536 cut-off events. For 50376/53114 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 89839 event pairs, 30 based on Foata normal form. 571/12784 useless extension candidates. Maximal degree in co-relation 162070. Up to 14712 conditions per place. [2022-12-13 07:50:39,838 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 3269 selfloop transitions, 197 changer transitions 0/3473 dead transitions. [2022-12-13 07:50:39,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:39,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 07:50:39,839 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2022-12-13 07:50:39,840 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2022-12-13 07:50:39,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:39,945 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:40,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:40,040 INFO L89 Accepts]: Start accepts. Operand has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:40,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:40,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:40,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:40,109 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:40,109 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 07:50:40,119 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:40,120 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-13 07:50:40,120 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 3473 transitions, 71061 flow [2022-12-13 07:50:40,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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 07:50:40,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:40,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:40,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:40,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:40,323 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash 383594673, now seen corresponding path program 3 times [2022-12-13 07:50:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:40,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454426241] [2022-12-13 07:50:40,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:40,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454426241] [2022-12-13 07:50:40,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454426241] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630245497] [2022-12-13 07:50:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:40,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:40,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:40,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:40,400 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:40,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 3473 transitions, 71061 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:40,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:40,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:40,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:45,393 INFO L130 PetriNetUnfolder]: 12214/16472 cut-off events. [2022-12-13 07:50:45,393 INFO L131 PetriNetUnfolder]: For 61277/63873 co-relation queries the response was YES. [2022-12-13 07:50:45,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173320 conditions, 16472 events. 12214/16472 cut-off events. For 61277/63873 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 83975 event pairs, 32 based on Foata normal form. 612/12185 useless extension candidates. Maximal degree in co-relation 167508. Up to 13707 conditions per place. [2022-12-13 07:50:45,500 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 2943 selfloop transitions, 259 changer transitions 76/3285 dead transitions. [2022-12-13 07:50:45,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 3285 transitions, 73761 flow [2022-12-13 07:50:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:50:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:50:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-13 07:50:45,502 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2022-12-13 07:50:45,502 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 39 predicate places. [2022-12-13 07:50:45,502 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 3285 transitions, 73761 flow [2022-12-13 07:50:45,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 3209 transitions, 72035 flow [2022-12-13 07:50:45,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:45,698 INFO L89 Accepts]: Start accepts. Operand has 77 places, 3209 transitions, 72035 flow [2022-12-13 07:50:45,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:45,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:45,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 3209 transitions, 72035 flow [2022-12-13 07:50:45,765 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 3209 transitions, 72035 flow [2022-12-13 07:50:45,765 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 07:50:45,775 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:45,776 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 78 [2022-12-13 07:50:45,776 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 3209 transitions, 72035 flow [2022-12-13 07:50:45,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:45,776 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:45,776 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:45,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:50:45,777 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:45,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2128331647, now seen corresponding path program 4 times [2022-12-13 07:50:45,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:45,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072675292] [2022-12-13 07:50:45,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:45,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:45,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:45,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072675292] [2022-12-13 07:50:45,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072675292] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:45,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414609507] [2022-12-13 07:50:45,839 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:50:45,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:45,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:45,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:45,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:50:45,920 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:50:45,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:45,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:45,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:45,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:45,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:45,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414609507] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:45,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:45,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:50:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754689666] [2022-12-13 07:50:46,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:46,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:50:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:46,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:50:46,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:50:46,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:46,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 3209 transitions, 72035 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 07:50:46,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:46,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:51,053 INFO L130 PetriNetUnfolder]: 13469/18098 cut-off events. [2022-12-13 07:50:51,054 INFO L131 PetriNetUnfolder]: For 64658/67565 co-relation queries the response was YES. [2022-12-13 07:50:51,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207953 conditions, 18098 events. 13469/18098 cut-off events. For 64658/67565 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 92295 event pairs, 32 based on Foata normal form. 671/13531 useless extension candidates. Maximal degree in co-relation 201110. Up to 15397 conditions per place. [2022-12-13 07:50:51,381 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 3282 selfloop transitions, 226 changer transitions 0/3515 dead transitions. [2022-12-13 07:50:51,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:50:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:50:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2022-12-13 07:50:51,383 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5991379310344828 [2022-12-13 07:50:51,383 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2022-12-13 07:50:51,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,526 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,638 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:51,638 INFO L89 Accepts]: Start accepts. Operand has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,652 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:51,652 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:51,652 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,712 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,712 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 07:50:51,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:51,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-13 07:50:51,720 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 3515 transitions, 85939 flow [2022-12-13 07:50:51,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 07:50:51,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:51,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:51,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:51,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-13 07:50:51,923 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:51,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:51,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1835438031, now seen corresponding path program 4 times [2022-12-13 07:50:51,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:51,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757722872] [2022-12-13 07:50:51,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:51,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757722872] [2022-12-13 07:50:52,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757722872] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:52,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:52,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:52,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851352031] [2022-12-13 07:50:52,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:52,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:52,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:52,014 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:52,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 3515 transitions, 85939 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:52,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:52,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:52,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:57,755 INFO L130 PetriNetUnfolder]: 13237/17866 cut-off events. [2022-12-13 07:50:57,755 INFO L131 PetriNetUnfolder]: For 87719/90672 co-relation queries the response was YES. [2022-12-13 07:50:57,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222177 conditions, 17866 events. 13237/17866 cut-off events. For 87719/90672 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 92246 event pairs, 24 based on Foata normal form. 613/13399 useless extension candidates. Maximal degree in co-relation 214930. Up to 15170 conditions per place. [2022-12-13 07:50:57,870 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 3143 selfloop transitions, 249 changer transitions 76/3475 dead transitions. [2022-12-13 07:50:57,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 3475 transitions, 91915 flow [2022-12-13 07:50:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:50:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:50:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-13 07:50:57,871 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2022-12-13 07:50:57,872 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-13 07:50:57,872 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 3475 transitions, 91915 flow [2022-12-13 07:50:58,007 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 3399 transitions, 89885 flow [2022-12-13 07:50:58,108 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:58,109 INFO L89 Accepts]: Start accepts. Operand has 89 places, 3399 transitions, 89885 flow [2022-12-13 07:50:58,126 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:58,127 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:58,127 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 3399 transitions, 89885 flow [2022-12-13 07:50:58,213 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 3399 transitions, 89885 flow [2022-12-13 07:50:58,213 INFO L226 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-13 07:50:58,221 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:58,222 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 07:50:58,222 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 3399 transitions, 89885 flow [2022-12-13 07:50:58,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:50:58,222 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:58,222 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:58,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 07:50:58,223 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:58,223 INFO L85 PathProgramCache]: Analyzing trace with hash 420436813, now seen corresponding path program 5 times [2022-12-13 07:50:58,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:58,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164117130] [2022-12-13 07:50:58,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:58,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:58,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164117130] [2022-12-13 07:50:58,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164117130] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:58,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755304448] [2022-12-13 07:50:58,285 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:50:58,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:58,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:58,288 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:58,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:50:58,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:50:58,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:58,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:50:58,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:58,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:50:58,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755304448] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:58,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:50:58,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 07:50:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922555114] [2022-12-13 07:50:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:58,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:50:58,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:58,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:50:58,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:50:58,416 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:50:58,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 3399 transitions, 89885 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 07:50:58,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:58,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:50:58,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:02,469 INFO L130 PetriNetUnfolder]: 9341/12751 cut-off events. [2022-12-13 07:51:02,469 INFO L131 PetriNetUnfolder]: For 87424/89807 co-relation queries the response was YES. [2022-12-13 07:51:02,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170088 conditions, 12751 events. 9341/12751 cut-off events. For 87424/89807 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 64658 event pairs, 20 based on Foata normal form. 729/10004 useless extension candidates. Maximal degree in co-relation 165024. Up to 10638 conditions per place. [2022-12-13 07:51:02,545 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 2219 selfloop transitions, 84 changer transitions 218/2536 dead transitions. [2022-12-13 07:51:02,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 2536 transitions, 72081 flow [2022-12-13 07:51:02,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 07:51:02,546 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 07:51:02,547 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-13 07:51:02,547 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 2536 transitions, 72081 flow [2022-12-13 07:51:02,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 2318 transitions, 65869 flow [2022-12-13 07:51:02,701 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:02,702 INFO L89 Accepts]: Start accepts. Operand has 91 places, 2318 transitions, 65869 flow [2022-12-13 07:51:02,712 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:02,712 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:02,712 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 2318 transitions, 65869 flow [2022-12-13 07:51:02,749 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 2318 transitions, 65869 flow [2022-12-13 07:51:02,750 INFO L226 LiptonReduction]: Number of co-enabled transitions 92 [2022-12-13 07:51:02,755 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:02,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-13 07:51:02,756 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 2318 transitions, 65869 flow [2022-12-13 07:51:02,756 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 07:51:02,756 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:02,756 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:02,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:02,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:02,963 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -117535827, now seen corresponding path program 5 times [2022-12-13 07:51:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:02,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287023553] [2022-12-13 07:51:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:02,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:02,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:03,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:03,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287023553] [2022-12-13 07:51:03,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287023553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:03,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818740450] [2022-12-13 07:51:03,039 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:51:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:03,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:03,040 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:51:03,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:03,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:03,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:51:03,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:03,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 07:51:03,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818740450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:03,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 07:51:03,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-13 07:51:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364415729] [2022-12-13 07:51:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:03,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:51:03,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:03,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:51:03,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:51:03,158 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:51:03,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 2318 transitions, 65869 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 07:51:03,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:03,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:51:03,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:05,624 INFO L130 PetriNetUnfolder]: 6421/8966 cut-off events. [2022-12-13 07:51:05,625 INFO L131 PetriNetUnfolder]: For 86796/88625 co-relation queries the response was YES. [2022-12-13 07:51:05,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127429 conditions, 8966 events. 6421/8966 cut-off events. For 86796/88625 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 45026 event pairs, 0 based on Foata normal form. 475/7177 useless extension candidates. Maximal degree in co-relation 123003. Up to 7280 conditions per place. [2022-12-13 07:51:05,681 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 1841 selfloop transitions, 98 changer transitions 141/2093 dead transitions. [2022-12-13 07:51:05,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 2093 transitions, 63701 flow [2022-12-13 07:51:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:51:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:51:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-13 07:51:05,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2022-12-13 07:51:05,683 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2022-12-13 07:51:05,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 2093 transitions, 63701 flow [2022-12-13 07:51:05,747 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 1952 transitions, 59404 flow [2022-12-13 07:51:05,797 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:05,797 INFO L89 Accepts]: Start accepts. Operand has 91 places, 1952 transitions, 59404 flow [2022-12-13 07:51:05,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:05,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:05,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 1952 transitions, 59404 flow [2022-12-13 07:51:05,837 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 1952 transitions, 59404 flow [2022-12-13 07:51:05,838 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 07:51:05,842 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:05,842 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 07:51:05,842 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 1952 transitions, 59404 flow [2022-12-13 07:51:05,843 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 07:51:05,843 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:05,843 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:05,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 07:51:06,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:06,044 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:06,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:06,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1506450442, now seen corresponding path program 2 times [2022-12-13 07:51:06,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:06,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960337312] [2022-12-13 07:51:06,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:06,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960337312] [2022-12-13 07:51:06,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960337312] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:06,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756053198] [2022-12-13 07:51:06,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:06,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:06,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:06,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:06,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:51:06,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:06,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:06,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:06,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:06,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756053198] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:06,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:06,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:51:06,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915012685] [2022-12-13 07:51:06,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:06,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:06,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:06,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:06,267 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:06,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 1952 transitions, 59404 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:51:06,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:06,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:06,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:08,718 INFO L130 PetriNetUnfolder]: 6430/8889 cut-off events. [2022-12-13 07:51:08,718 INFO L131 PetriNetUnfolder]: For 88461/91411 co-relation queries the response was YES. [2022-12-13 07:51:08,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135080 conditions, 8889 events. 6430/8889 cut-off events. For 88461/91411 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 43439 event pairs, 0 based on Foata normal form. 778/7511 useless extension candidates. Maximal degree in co-relation 130672. Up to 7432 conditions per place. [2022-12-13 07:51:08,780 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1942 selfloop transitions, 123 changer transitions 0/2073 dead transitions. [2022-12-13 07:51:08,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:08,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 07:51:08,781 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2022-12-13 07:51:08,781 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2022-12-13 07:51:08,782 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,855 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:08,907 INFO L89 Accepts]: Start accepts. Operand has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:08,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:08,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,954 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,955 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:08,959 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:08,960 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 07:51:08,960 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 2073 transitions, 67151 flow [2022-12-13 07:51:08,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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 07:51:08,960 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:08,960 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:08,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:09,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:51:09,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:09,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1916379338, now seen corresponding path program 3 times [2022-12-13 07:51:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:09,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376269085] [2022-12-13 07:51:09,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:09,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376269085] [2022-12-13 07:51:09,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376269085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:09,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409767947] [2022-12-13 07:51:09,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:09,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:09,228 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:09,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:51:09,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:51:09,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:09,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:09,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:09,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:09,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409767947] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:09,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:09,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:51:09,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058152942] [2022-12-13 07:51:09,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:09,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:09,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:09,420 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:09,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 2073 transitions, 67151 flow. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 07:51:09,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:09,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:09,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:12,536 INFO L130 PetriNetUnfolder]: 8231/11479 cut-off events. [2022-12-13 07:51:12,536 INFO L131 PetriNetUnfolder]: For 134336/137858 co-relation queries the response was YES. [2022-12-13 07:51:12,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186230 conditions, 11479 events. 8231/11479 cut-off events. For 134336/137858 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 59953 event pairs, 0 based on Foata normal form. 1132/10026 useless extension candidates. Maximal degree in co-relation 180877. Up to 9489 conditions per place. [2022-12-13 07:51:12,631 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2635 selfloop transitions, 260 changer transitions 0/2903 dead transitions. [2022-12-13 07:51:12,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:12,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:51:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:51:12,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2022-12-13 07:51:12,633 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-13 07:51:12,633 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-13 07:51:12,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:12,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:12,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:12,970 INFO L89 Accepts]: Start accepts. Operand has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:12,991 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:12,991 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:12,992 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:13,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:13,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:13,065 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:13,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 96 [2022-12-13 07:51:13,066 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 2903 transitions, 99990 flow [2022-12-13 07:51:13,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 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 07:51:13,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:13,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:13,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:13,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:51:13,267 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -423130096, now seen corresponding path program 3 times [2022-12-13 07:51:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:13,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879703590] [2022-12-13 07:51:13,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:13,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:13,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879703590] [2022-12-13 07:51:13,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879703590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:13,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259366712] [2022-12-13 07:51:13,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:51:13,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:13,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:13,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:13,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:51:13,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:51:13,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:13,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:13,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:13,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259366712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:13,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:13,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:51:13,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578775200] [2022-12-13 07:51:13,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:13,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:13,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:13,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:13,539 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:13,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 2903 transitions, 99990 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 07:51:13,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:13,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:18,189 INFO L130 PetriNetUnfolder]: 8953/12573 cut-off events. [2022-12-13 07:51:18,189 INFO L131 PetriNetUnfolder]: For 157634/160786 co-relation queries the response was YES. [2022-12-13 07:51:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215828 conditions, 12573 events. 8953/12573 cut-off events. For 157634/160786 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 67404 event pairs, 0 based on Foata normal form. 713/10479 useless extension candidates. Maximal degree in co-relation 209418. Up to 10477 conditions per place. [2022-12-13 07:51:18,445 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2991 selfloop transitions, 189 changer transitions 0/3188 dead transitions. [2022-12-13 07:51:18,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 07:51:18,446 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2022-12-13 07:51:18,446 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 68 predicate places. [2022-12-13 07:51:18,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,643 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:18,643 INFO L89 Accepts]: Start accepts. Operand has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,665 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:18,665 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:18,665 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,730 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,730 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:18,737 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:18,737 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 07:51:18,737 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 3188 transitions, 116184 flow [2022-12-13 07:51:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 07:51:18,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:18,737 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:18,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:18,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 07:51:18,938 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:18,939 INFO L85 PathProgramCache]: Analyzing trace with hash -452669938, now seen corresponding path program 4 times [2022-12-13 07:51:18,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:18,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611296576] [2022-12-13 07:51:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:18,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:19,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611296576] [2022-12-13 07:51:19,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611296576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:19,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:19,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124250268] [2022-12-13 07:51:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:19,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:51:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:19,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:51:19,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:51:19,003 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:19,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 3188 transitions, 116184 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:51:19,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:19,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:23,999 INFO L130 PetriNetUnfolder]: 8217/11399 cut-off events. [2022-12-13 07:51:23,999 INFO L131 PetriNetUnfolder]: For 164008/168184 co-relation queries the response was YES. [2022-12-13 07:51:24,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206272 conditions, 11399 events. 8217/11399 cut-off events. For 164008/168184 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 58779 event pairs, 0 based on Foata normal form. 886/9671 useless extension candidates. Maximal degree in co-relation 201066. Up to 9415 conditions per place. [2022-12-13 07:51:24,086 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 2503 selfloop transitions, 155 changer transitions 154/2820 dead transitions. [2022-12-13 07:51:24,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 2820 transitions, 108284 flow [2022-12-13 07:51:24,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:24,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 07:51:24,087 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-13 07:51:24,088 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 72 predicate places. [2022-12-13 07:51:24,088 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 2820 transitions, 108284 flow [2022-12-13 07:51:24,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 2666 transitions, 102339 flow [2022-12-13 07:51:24,264 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:24,264 INFO L89 Accepts]: Start accepts. Operand has 109 places, 2666 transitions, 102339 flow [2022-12-13 07:51:24,281 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:24,281 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:24,281 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 2666 transitions, 102339 flow [2022-12-13 07:51:24,331 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 2666 transitions, 102339 flow [2022-12-13 07:51:24,331 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:24,338 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:24,338 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 07:51:24,338 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 2666 transitions, 102339 flow [2022-12-13 07:51:24,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:51:24,339 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:24,339 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 07:51:24,339 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1154833078, now seen corresponding path program 5 times [2022-12-13 07:51:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:24,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749329574] [2022-12-13 07:51:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:24,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:24,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749329574] [2022-12-13 07:51:24,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749329574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:24,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:24,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:24,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191545336] [2022-12-13 07:51:24,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:24,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:51:24,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:24,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:51:24,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:51:24,396 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:24,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 2666 transitions, 102339 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:51:24,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:24,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:24,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:28,396 INFO L130 PetriNetUnfolder]: 7891/10944 cut-off events. [2022-12-13 07:51:28,396 INFO L131 PetriNetUnfolder]: For 173500/178366 co-relation queries the response was YES. [2022-12-13 07:51:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208275 conditions, 10944 events. 7891/10944 cut-off events. For 173500/178366 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 55884 event pairs, 0 based on Foata normal form. 953/9387 useless extension candidates. Maximal degree in co-relation 202843. Up to 9284 conditions per place. [2022-12-13 07:51:28,653 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 2287 selfloop transitions, 183 changer transitions 154/2632 dead transitions. [2022-12-13 07:51:28,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 2632 transitions, 106295 flow [2022-12-13 07:51:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:51:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:51:28,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-12-13 07:51:28,654 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5172413793103449 [2022-12-13 07:51:28,654 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 76 predicate places. [2022-12-13 07:51:28,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 2632 transitions, 106295 flow [2022-12-13 07:51:28,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 2478 transitions, 100042 flow [2022-12-13 07:51:28,833 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:28,833 INFO L89 Accepts]: Start accepts. Operand has 113 places, 2478 transitions, 100042 flow [2022-12-13 07:51:28,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:28,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:28,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 2478 transitions, 100042 flow [2022-12-13 07:51:28,899 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 2478 transitions, 100042 flow [2022-12-13 07:51:28,899 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:28,904 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:28,905 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-13 07:51:28,905 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 2478 transitions, 100042 flow [2022-12-13 07:51:28,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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 07:51:28,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:28,905 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:28,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 07:51:28,905 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1184372920, now seen corresponding path program 6 times [2022-12-13 07:51:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:28,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185517683] [2022-12-13 07:51:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:28,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185517683] [2022-12-13 07:51:28,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185517683] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:28,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792485927] [2022-12-13 07:51:28,964 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:51:28,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:28,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:28,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:51:29,071 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:51:29,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:29,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:29,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:29,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:29,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792485927] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:29,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:29,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:51:29,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282261651] [2022-12-13 07:51:29,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:29,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:29,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:29,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:29,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:29,124 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 2478 transitions, 100042 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 07:51:29,124 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:29,124 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:29,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:33,002 INFO L130 PetriNetUnfolder]: 7465/10252 cut-off events. [2022-12-13 07:51:33,003 INFO L131 PetriNetUnfolder]: For 204299/208797 co-relation queries the response was YES. [2022-12-13 07:51:33,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204652 conditions, 10252 events. 7465/10252 cut-off events. For 204299/208797 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 50920 event pairs, 0 based on Foata normal form. 943/8943 useless extension candidates. Maximal degree in co-relation 199829. Up to 8933 conditions per place. [2022-12-13 07:51:33,097 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2153 selfloop transitions, 253 changer transitions 0/2414 dead transitions. [2022-12-13 07:51:33,097 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:51:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:51:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-13 07:51:33,098 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2022-12-13 07:51:33,098 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 07:51:33,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,289 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:33,289 INFO L89 Accepts]: Start accepts. Operand has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,310 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:33,310 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:33,310 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,356 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,356 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:33,361 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:33,362 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 73 [2022-12-13 07:51:33,362 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 2414 transitions, 102168 flow [2022-12-13 07:51:33,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 07:51:33,362 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:33,362 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:33,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:33,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:33,564 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:33,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2112162756, now seen corresponding path program 4 times [2022-12-13 07:51:33,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:33,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813995693] [2022-12-13 07:51:33,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:33,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:33,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813995693] [2022-12-13 07:51:33,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813995693] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:33,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075242673] [2022-12-13 07:51:33,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:33,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:33,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:33,624 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:33,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:51:33,715 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:33,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:33,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:33,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:33,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:33,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075242673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:33,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:33,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:51:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508631276] [2022-12-13 07:51:33,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:33,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:33,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:33,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:33,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:33,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 2414 transitions, 102168 flow. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 07:51:33,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:33,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:33,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:37,604 INFO L130 PetriNetUnfolder]: 7111/9710 cut-off events. [2022-12-13 07:51:37,604 INFO L131 PetriNetUnfolder]: For 216086/220585 co-relation queries the response was YES. [2022-12-13 07:51:37,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202999 conditions, 9710 events. 7111/9710 cut-off events. For 216086/220585 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 47418 event pairs, 0 based on Foata normal form. 729/8405 useless extension candidates. Maximal degree in co-relation 198821. Up to 8445 conditions per place. [2022-12-13 07:51:37,704 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2054 selfloop transitions, 164 changer transitions 0/2226 dead transitions. [2022-12-13 07:51:37,704 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-13 07:51:37,705 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.496551724137931 [2022-12-13 07:51:37,705 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 83 predicate places. [2022-12-13 07:51:37,705 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,895 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:37,895 INFO L89 Accepts]: Start accepts. Operand has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:37,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:37,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,962 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,962 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:37,968 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:37,969 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-13 07:51:37,969 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 2226 transitions, 98567 flow [2022-12-13 07:51:37,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 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 07:51:37,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:37,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:37,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:38,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 07:51:38,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:38,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781916, now seen corresponding path program 1 times [2022-12-13 07:51:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194145274] [2022-12-13 07:51:38,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:38,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194145274] [2022-12-13 07:51:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194145274] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393284518] [2022-12-13 07:51:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:38,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:38,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:38,326 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:38,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:51:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:38,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:51:38,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:38,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:38,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393284518] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:38,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:38,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-13 07:51:38,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081786741] [2022-12-13 07:51:38,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:38,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:38,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:38,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:38,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:38,615 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:51:38,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 2226 transitions, 98567 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 07:51:38,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:38,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:51:38,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:46,423 INFO L130 PetriNetUnfolder]: 16882/23225 cut-off events. [2022-12-13 07:51:46,424 INFO L131 PetriNetUnfolder]: For 479908/483950 co-relation queries the response was YES. [2022-12-13 07:51:46,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510803 conditions, 23225 events. 16882/23225 cut-off events. For 479908/483950 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 127988 event pairs, 0 based on Foata normal form. 29/17675 useless extension candidates. Maximal degree in co-relation 498941. Up to 21003 conditions per place. [2022-12-13 07:51:46,744 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 3748 selfloop transitions, 642 changer transitions 53/4457 dead transitions. [2022-12-13 07:51:46,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 4457 transitions, 207057 flow [2022-12-13 07:51:46,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:51:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:51:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions. [2022-12-13 07:51:46,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7684729064039408 [2022-12-13 07:51:46,746 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2022-12-13 07:51:46,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 4457 transitions, 207057 flow [2022-12-13 07:51:47,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 4404 transitions, 204517 flow [2022-12-13 07:51:47,204 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:47,205 INFO L89 Accepts]: Start accepts. Operand has 127 places, 4404 transitions, 204517 flow [2022-12-13 07:51:47,248 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:47,248 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:47,248 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 4404 transitions, 204517 flow [2022-12-13 07:51:47,368 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 4404 transitions, 204517 flow [2022-12-13 07:51:47,369 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:51:47,378 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:47,379 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 175 [2022-12-13 07:51:47,379 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 4404 transitions, 204517 flow [2022-12-13 07:51:47,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 07:51:47,379 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:47,379 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:47,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:47,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-13 07:51:47,586 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:47,586 INFO L85 PathProgramCache]: Analyzing trace with hash -818138786, now seen corresponding path program 2 times [2022-12-13 07:51:47,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:47,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66462768] [2022-12-13 07:51:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:47,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:47,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66462768] [2022-12-13 07:51:47,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66462768] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:47,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927834224] [2022-12-13 07:51:47,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:51:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:47,729 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:47,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:51:47,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:51:47,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:47,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 07:51:47,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:47,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:48,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927834224] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:48,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:48,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 2] total 5 [2022-12-13 07:51:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465810074] [2022-12-13 07:51:48,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:48,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:51:48,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:48,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:51:48,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:51:48,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:51:48,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 4404 transitions, 204517 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 07:51:48,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:48,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:51:48,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:10,050 INFO L130 PetriNetUnfolder]: 25245/34592 cut-off events. [2022-12-13 07:52:10,051 INFO L131 PetriNetUnfolder]: For 812906/817528 co-relation queries the response was YES. [2022-12-13 07:52:10,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795049 conditions, 34592 events. 25245/34592 cut-off events. For 812906/817528 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 199036 event pairs, 0 based on Foata normal form. 29/25694 useless extension candidates. Maximal degree in co-relation 778230. Up to 31649 conditions per place. [2022-12-13 07:52:10,460 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 5444 selfloop transitions, 622 changer transitions 61/6141 dead transitions. [2022-12-13 07:52:10,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 6141 transitions, 297441 flow [2022-12-13 07:52:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:52:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:52:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2022-12-13 07:52:10,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7487684729064039 [2022-12-13 07:52:10,462 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 95 predicate places. [2022-12-13 07:52:10,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 6141 transitions, 297441 flow [2022-12-13 07:52:10,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 6080 transitions, 294399 flow [2022-12-13 07:52:11,338 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:11,338 INFO L89 Accepts]: Start accepts. Operand has 133 places, 6080 transitions, 294399 flow [2022-12-13 07:52:11,418 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:11,418 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:11,418 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 6080 transitions, 294399 flow [2022-12-13 07:52:11,626 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 6080 transitions, 294399 flow [2022-12-13 07:52:11,626 INFO L226 LiptonReduction]: Number of co-enabled transitions 76 [2022-12-13 07:52:11,646 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:11,648 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 310 [2022-12-13 07:52:11,648 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 6080 transitions, 294399 flow [2022-12-13 07:52:11,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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 07:52:11,648 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:11,648 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:11,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 07:52:11,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:11,854 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:52:11,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:11,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1589265586, now seen corresponding path program 3 times [2022-12-13 07:52:11,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:11,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189131604] [2022-12-13 07:52:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:11,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189131604] [2022-12-13 07:52:11,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189131604] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:11,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368937026] [2022-12-13 07:52:11,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:52:11,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:11,942 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 07:52:12,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:52:12,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:12,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:52:12,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:12,118 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368937026] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:12,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:12,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:52:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142159664] [2022-12-13 07:52:12,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:12,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:52:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:12,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:52:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:52:12,154 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:52:12,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 6080 transitions, 294399 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 07:52:12,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:12,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:52:12,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:01,797 INFO L130 PetriNetUnfolder]: 33591/45998 cut-off events. [2022-12-13 07:53:01,797 INFO L131 PetriNetUnfolder]: For 1120532/1127315 co-relation queries the response was YES. [2022-12-13 07:53:01,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104589 conditions, 45998 events. 33591/45998 cut-off events. For 1120532/1127315 co-relation queries the response was YES. Maximal size of possible extension queue 1641. Compared 274628 event pairs, 0 based on Foata normal form. 767/34873 useless extension candidates. Maximal degree in co-relation 1084542. Up to 42471 conditions per place. [2022-12-13 07:53:02,487 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 7304 selfloop transitions, 558 changer transitions 0/7870 dead transitions. [2022-12-13 07:53:02,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:53:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:53:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 07:53:02,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5911330049261084 [2022-12-13 07:53:02,489 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 101 predicate places. [2022-12-13 07:53:02,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:03,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:03,705 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:03,706 INFO L89 Accepts]: Start accepts. Operand has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:03,781 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:03,781 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:03,781 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:04,039 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:04,039 INFO L226 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-13 07:53:04,062 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:04,063 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 358 [2022-12-13 07:53:04,063 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 7870 transitions, 397109 flow [2022-12-13 07:53:04,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 07:53:04,063 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:04,063 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:04,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 07:53:04,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:04,269 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:53:04,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:04,270 INFO L85 PathProgramCache]: Analyzing trace with hash -681370666, now seen corresponding path program 4 times [2022-12-13 07:53:04,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:04,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511942007] [2022-12-13 07:53:04,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:04,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:04,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:04,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511942007] [2022-12-13 07:53:04,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511942007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:04,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991703072] [2022-12-13 07:53:04,337 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:53:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:04,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:53:04,339 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:53:04,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 07:53:04,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:53:04,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:53:04,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:53:04,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:53:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:04,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:53:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:04,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991703072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:53:04,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:53:04,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 07:53:04,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144967058] [2022-12-13 07:53:04,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:53:04,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:53:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:53:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:53:04,505 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:53:04,505 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 7870 transitions, 397109 flow. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 07:53:04,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:04,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:53:04,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:21,168 INFO L130 PetriNetUnfolder]: 34674/47721 cut-off events. [2022-12-13 07:54:21,168 INFO L131 PetriNetUnfolder]: For 1229442/1236425 co-relation queries the response was YES. [2022-12-13 07:54:21,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190723 conditions, 47721 events. 34674/47721 cut-off events. For 1229442/1236425 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 289268 event pairs, 0 based on Foata normal form. 511/36149 useless extension candidates. Maximal degree in co-relation 1168771. Up to 44049 conditions per place. [2022-12-13 07:54:21,730 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 10225 selfloop transitions, 1611 changer transitions 665/12509 dead transitions. [2022-12-13 07:54:21,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 12509 transitions, 655980 flow [2022-12-13 07:54:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:54:21,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:54:21,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2022-12-13 07:54:21,732 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5329153605015674 [2022-12-13 07:54:21,732 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-13 07:54:21,732 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 12509 transitions, 655980 flow [2022-12-13 07:54:22,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 11844 transitions, 620857 flow [2022-12-13 07:54:23,145 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:23,145 INFO L89 Accepts]: Start accepts. Operand has 149 places, 11844 transitions, 620857 flow [2022-12-13 07:54:23,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:23,416 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:23,416 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 11844 transitions, 620857 flow [2022-12-13 07:54:23,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 11844 transitions, 620857 flow [2022-12-13 07:54:23,922 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 07:54:23,946 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:23,947 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 802 [2022-12-13 07:54:23,947 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 11844 transitions, 620857 flow [2022-12-13 07:54:23,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 07:54:23,947 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:23,947 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:23,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 07:54:24,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 07:54:24,154 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:54:24,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1367338264, now seen corresponding path program 5 times [2022-12-13 07:54:24,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:24,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293037055] [2022-12-13 07:54:24,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293037055] [2022-12-13 07:54:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293037055] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:54:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856078806] [2022-12-13 07:54:24,228 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:54:24,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:54:24,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:54:24,230 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:54:24,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 07:54:24,331 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:54:24,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:54:24,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:54:24,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:54:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:24,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:54:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:24,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856078806] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:54:24,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:54:24,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:54:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494779528] [2022-12-13 07:54:24,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:54:24,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:54:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:24,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:54:24,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:54:24,427 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:54:24,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 11844 transitions, 620857 flow. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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 07:54:24,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:24,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:54:24,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:19,916 INFO L130 PetriNetUnfolder]: 44769/62603 cut-off events. [2022-12-13 07:57:19,917 INFO L131 PetriNetUnfolder]: For 1757499/1765133 co-relation queries the response was YES. [2022-12-13 07:57:20,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622486 conditions, 62603 events. 44769/62603 cut-off events. For 1757499/1765133 co-relation queries the response was YES. Maximal size of possible extension queue 2283. Compared 406451 event pairs, 0 based on Foata normal form. 859/47624 useless extension candidates. Maximal degree in co-relation 1582513. Up to 58029 conditions per place. [2022-12-13 07:57:20,733 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 14277 selfloop transitions, 2364 changer transitions 283/16932 dead transitions. [2022-12-13 07:57:20,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 16932 transitions, 922191 flow [2022-12-13 07:57:20,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 07:57:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-13 07:57:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 276 transitions. [2022-12-13 07:57:20,735 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2022-12-13 07:57:20,735 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2022-12-13 07:57:20,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 16932 transitions, 922191 flow [2022-12-13 07:57:21,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 16649 transitions, 906699 flow [2022-12-13 07:57:23,037 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:23,037 INFO L89 Accepts]: Start accepts. Operand has 166 places, 16649 transitions, 906699 flow [2022-12-13 07:57:23,336 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:23,336 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:23,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 16649 transitions, 906699 flow [2022-12-13 07:57:24,794 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 16649 transitions, 906699 flow [2022-12-13 07:57:24,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 07:57:24,851 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:24,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1828 [2022-12-13 07:57:24,865 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 16649 transitions, 906699 flow [2022-12-13 07:57:24,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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 07:57:24,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:24,865 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:24,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 07:57:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 07:57:25,072 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:57:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1125284782, now seen corresponding path program 6 times [2022-12-13 07:57:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:25,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036317979] [2022-12-13 07:57:25,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:25,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:25,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036317979] [2022-12-13 07:57:25,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036317979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:57:25,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315471310] [2022-12-13 07:57:25,232 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:57:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:57:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:57:25,259 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:57:25,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 07:57:25,479 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:57:25,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:57:25,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 07:57:25,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:57:25,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:25,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:57:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:25,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315471310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:57:25,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:57:25,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 07:57:25,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159219358] [2022-12-13 07:57:25,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:57:25,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:57:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:57:25,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:57:25,608 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:57:25,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 16649 transitions, 906699 flow. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 07:57:25,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:25,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:57:25,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:03:11,638 INFO L130 PetriNetUnfolder]: 57412/79500 cut-off events. [2022-12-13 08:03:11,639 INFO L131 PetriNetUnfolder]: For 2431646/2439168 co-relation queries the response was YES. [2022-12-13 08:03:11,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142728 conditions, 79500 events. 57412/79500 cut-off events. For 2431646/2439168 co-relation queries the response was YES. Maximal size of possible extension queue 2718. Compared 517461 event pairs, 0 based on Foata normal form. 806/60964 useless extension candidates. Maximal degree in co-relation 2101311. Up to 74242 conditions per place. [2022-12-13 08:03:12,681 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 18783 selfloop transitions, 1262 changer transitions 0/20053 dead transitions. [2022-12-13 08:03:12,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:03:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 08:03:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2022-12-13 08:03:12,683 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.54858934169279 [2022-12-13 08:03:12,683 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 138 predicate places. [2022-12-13 08:03:12,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:14,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:15,238 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:03:15,238 INFO L89 Accepts]: Start accepts. Operand has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:15,510 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:03:15,510 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:03:15,510 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:16,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:16,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 08:03:16,657 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:03:16,658 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1420 [2022-12-13 08:03:16,658 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 20053 transitions, 1132549 flow [2022-12-13 08:03:16,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 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 08:03:16,658 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:03:16,658 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:03:16,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 08:03:16,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 08:03:16,861 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:03:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:03:16,862 INFO L85 PathProgramCache]: Analyzing trace with hash -865662420, now seen corresponding path program 7 times [2022-12-13 08:03:16,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:03:16,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733371351] [2022-12-13 08:03:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:03:16,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:03:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:03:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:03:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:03:16,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733371351] [2022-12-13 08:03:16,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733371351] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:03:16,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240055114] [2022-12-13 08:03:16,929 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 08:03:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:03:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:03:16,932 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:03:16,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 08:03:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:03:17,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:03:17,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:03:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:03:17,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:03:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:03:17,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240055114] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:03:17,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:03:17,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-12-13 08:03:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726494493] [2022-12-13 08:03:17,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:03:17,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 08:03:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:03:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 08:03:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-12-13 08:03:17,155 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 08:03:17,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 20053 transitions, 1132549 flow. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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 08:03:17,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:03:17,156 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 08:03:17,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:03:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 08:03:52,351 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 08:03:52,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:03:52,378 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:03:52,378 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:03:52,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:03:52,556 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). [2022-12-13 08:03:52,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 08:03:52,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 08:03:52,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 08:03:52,558 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 08:03:52,558 INFO L445 BasicCegarLoop]: Path program histogram: [7, 6, 5, 5, 4, 1] [2022-12-13 08:03:52,560 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:03:52,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:03:52,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:03:52 BasicIcfg [2022-12-13 08:03:52,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:03:52,563 INFO L158 Benchmark]: Toolchain (without parser) took 817636.75ms. Allocated memory was 185.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 162.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 3.7GB. Max. memory is 8.0GB. [2022-12-13 08:03:52,563 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 185.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:03:52,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.14ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 150.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 08:03:52,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.09ms. Allocated memory is still 185.6MB. Free memory was 150.0MB in the beginning and 148.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:03:52,564 INFO L158 Benchmark]: Boogie Preprocessor took 37.63ms. Allocated memory is still 185.6MB. Free memory was 148.1MB in the beginning and 146.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:03:52,564 INFO L158 Benchmark]: RCFGBuilder took 426.29ms. Allocated memory is still 185.6MB. Free memory was 146.4MB in the beginning and 128.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 08:03:52,564 INFO L158 Benchmark]: TraceAbstraction took 816821.27ms. Allocated memory was 185.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 127.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-12-13 08:03:52,565 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 185.6MB. Free memory is still 162.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.14ms. Allocated memory is still 185.6MB. Free memory was 162.2MB in the beginning and 150.0MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.09ms. Allocated memory is still 185.6MB. Free memory was 150.0MB in the beginning and 148.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.63ms. Allocated memory is still 185.6MB. Free memory was 148.1MB in the beginning and 146.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.29ms. Allocated memory is still 185.6MB. Free memory was 146.4MB in the beginning and 128.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 816821.27ms. Allocated memory was 185.6MB in the beginning and 4.3GB in the end (delta: 4.1GB). Free memory was 127.2MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 111 PlacesBefore, 38 PlacesAfterwards, 107 TransitionsBefore, 29 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 32 TrivialYvCompositions, 41 ConcurrentYvCompositions, 5 ChoiceCompositions, 78 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1252, independent: 1248, independent conditional: 1248, 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: 1252, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1252, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1252, independent: 1248, independent conditional: 0, independent unconditional: 1248, 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: 1252, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1252, independent: 1245, independent conditional: 0, independent unconditional: 1245, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1252, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1252, unknown conditional: 0, unknown unconditional: 1252] , Statistics on independence cache: Total cache size (in pairs): 1998, Positive cache size: 1994, Positive conditional cache size: 0, Positive unconditional cache size: 1994, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 216 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 140 TransitionsBefore, 140 TransitionsAfterwards, 346 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 634 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 686 TransitionsBefore, 686 TransitionsAfterwards, 48 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 1542 TransitionsBefore, 1542 TransitionsAfterwards, 72 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 1830 TransitionsBefore, 1830 TransitionsAfterwards, 80 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 2313 TransitionsBefore, 2313 TransitionsAfterwards, 94 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 2715 TransitionsBefore, 2715 TransitionsAfterwards, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 3473 TransitionsBefore, 3473 TransitionsAfterwards, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 77 PlacesBefore, 77 PlacesAfterwards, 3209 TransitionsBefore, 3209 TransitionsAfterwards, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 84 PlacesBefore, 84 PlacesAfterwards, 3515 TransitionsBefore, 3515 TransitionsAfterwards, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 3399 TransitionsBefore, 3399 TransitionsAfterwards, 104 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 2318 TransitionsBefore, 2318 TransitionsAfterwards, 92 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 1952 TransitionsBefore, 1952 TransitionsAfterwards, 64 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 95 PlacesBefore, 95 PlacesAfterwards, 2073 TransitionsBefore, 2073 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 102 PlacesBefore, 102 PlacesAfterwards, 2903 TransitionsBefore, 2903 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 106 PlacesBefore, 106 PlacesAfterwards, 3188 TransitionsBefore, 3188 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 109 PlacesBefore, 109 PlacesAfterwards, 2666 TransitionsBefore, 2666 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 2478 TransitionsBefore, 2478 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 119 PlacesBefore, 119 PlacesAfterwards, 2414 TransitionsBefore, 2414 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 121 PlacesBefore, 121 PlacesAfterwards, 2226 TransitionsBefore, 2226 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 4404 TransitionsBefore, 4404 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 133 PlacesBefore, 133 PlacesAfterwards, 6080 TransitionsBefore, 6080 TransitionsAfterwards, 76 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 139 PlacesBefore, 139 PlacesAfterwards, 7870 TransitionsBefore, 7870 TransitionsAfterwards, 90 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 11844 TransitionsBefore, 11844 TransitionsAfterwards, 118 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, 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, 166 PlacesBefore, 166 PlacesAfterwards, 16649 TransitionsBefore, 16649 TransitionsAfterwards, 114 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 176 PlacesBefore, 176 PlacesAfterwards, 20053 TransitionsBefore, 20053 TransitionsAfterwards, 114 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (12states, 2/29 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 205485 conditions, 7576 events (5653/7575 cut-off events. For 429424/435424 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 43557 event pairs, 0 based on Foata normal form. 547/7536 useless extension candidates. Maximal degree in co-relation 204710. Up to 6389 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 155 locations, 5 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: 816.6s, OverallIterations: 28, TraceHistogramMax: 2, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 783.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2312 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2312 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7599 IncrementalHoareTripleChecker+Invalid, 7716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 86 mSDtfsCounter, 7599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1191 GetRequests, 926 SyntacticMatches, 36 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1132549occurred in iteration=27, InterpolantAutomatonStates: 172, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 61 NumberOfCheckSat, 1635 ConstructedInterpolants, 0 QuantifiedInterpolants, 4523 SizeOfPredicates, 46 NumberOfNonLiveVariables, 3798 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 64 InterpolantComputations, 11 PerfectInterpolantSequences, 35/114 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 could not prove your program: Timeout Completed graceful shutdown