/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:46:48,271 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:46:48,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:46:48,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:46:48,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:46:48,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:46:48,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:46:48,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:46:48,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:46:48,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:46:48,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:46:48,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:46:48,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:46:48,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:46:48,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:46:48,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:46:48,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:46:48,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:46:48,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:46:48,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:46:48,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:46:48,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:46:48,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:46:48,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:46:48,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:46:48,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:46:48,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:46:48,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:46:48,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:46:48,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:46:48,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:46:48,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:46:48,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:46:48,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:46:48,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:46:48,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:46:48,325 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:46:48,325 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:46:48,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:46:48,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:46:48,326 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:46:48,330 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:46:48,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:46:48,364 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:46:48,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:46:48,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:46:48,366 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:46:48,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:46:48,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:46:48,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:46:48,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:46:48,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:46:48,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:46:48,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:48,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:46:48,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:46:48,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:46:48,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:46:48,370 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:46:48,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:46:48,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:46:48,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:46:48,669 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:46:48,670 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:46:48,671 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-06 05:46:49,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:46:49,811 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:46:49,812 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2022-12-06 05:46:49,817 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e6ee801/19f8ae828d6a4492933aa53288a4e03f/FLAG7776107bc [2022-12-06 05:46:49,834 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e6ee801/19f8ae828d6a4492933aa53288a4e03f [2022-12-06 05:46:49,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:46:49,837 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:46:49,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:49,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:46:49,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:46:49,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:49" (1/1) ... [2022-12-06 05:46:49,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6457c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:49, skipping insertion in model container [2022-12-06 05:46:49,845 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:46:49" (1/1) ... [2022-12-06 05:46:49,849 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:46:49,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:46:50,015 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-06 05:46:50,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:50,036 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:46:50,060 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/unroll-cond-3.wvr.c[2641,2654] [2022-12-06 05:46:50,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:46:50,073 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:46:50,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50 WrapperNode [2022-12-06 05:46:50,073 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:46:50,083 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:50,083 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:46:50,083 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:46:50,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,127 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 162 [2022-12-06 05:46:50,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:46:50,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:46:50,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:46:50,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:46:50,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,155 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:46:50,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:46:50,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:46:50,158 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:46:50,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (1/1) ... [2022-12-06 05:46:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:46:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:46:50,182 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-06 05:46:50,190 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-06 05:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:46:50,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:46:50,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:46:50,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:46:50,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:46:50,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:46:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:46:50,217 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:46:50,283 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:46:50,284 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:46:50,544 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:46:50,551 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:46:50,551 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:46:50,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:50 BoogieIcfgContainer [2022-12-06 05:46:50,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:46:50,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:46:50,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:46:50,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:46:50,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:46:49" (1/3) ... [2022-12-06 05:46:50,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f60764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:50, skipping insertion in model container [2022-12-06 05:46:50,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:46:50" (2/3) ... [2022-12-06 05:46:50,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f60764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:46:50, skipping insertion in model container [2022-12-06 05:46:50,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:46:50" (3/3) ... [2022-12-06 05:46:50,562 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2022-12-06 05:46:50,575 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:46:50,576 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:46:50,576 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:46:50,677 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:46:50,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 180 places, 191 transitions, 398 flow [2022-12-06 05:46:50,796 INFO L130 PetriNetUnfolder]: 18/189 cut-off events. [2022-12-06 05:46:50,797 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:50,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 189 events. 18/189 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-06 05:46:50,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 191 transitions, 398 flow [2022-12-06 05:46:50,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 181 transitions, 374 flow [2022-12-06 05:46:50,811 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:50,830 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-06 05:46:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 181 transitions, 374 flow [2022-12-06 05:46:50,884 INFO L130 PetriNetUnfolder]: 18/181 cut-off events. [2022-12-06 05:46:50,884 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:50,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 181 events. 18/181 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 274 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2022-12-06 05:46:50,890 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 181 transitions, 374 flow [2022-12-06 05:46:50,890 INFO L188 LiptonReduction]: Number of co-enabled transitions 4092 [2022-12-06 05:46:56,632 INFO L203 LiptonReduction]: Total number of compositions: 162 [2022-12-06 05:46:56,642 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:46:56,650 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;@7991c242, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:46:56,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:46:56,659 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-06 05:46:56,659 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:46:56,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:56,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:56,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:56,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1355763279, now seen corresponding path program 1 times [2022-12-06 05:46:56,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:56,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079878441] [2022-12-06 05:46:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:57,022 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-06 05:46:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:57,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079878441] [2022-12-06 05:46:57,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079878441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:57,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:57,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:46:57,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949931057] [2022-12-06 05:46:57,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:46:57,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:46:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:46:57,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 05:46:57,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 05:46:57,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:57,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 05:46:57,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:57,112 INFO L130 PetriNetUnfolder]: 45/80 cut-off events. [2022-12-06 05:46:57,112 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 05:46:57,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 80 events. 45/80 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 184 event pairs, 18 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2022-12-06 05:46:57,116 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-06 05:46:57,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-06 05:46:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:46:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:46:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 05:46:57,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 05:46:57,127 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 23 transitions. [2022-12-06 05:46:57,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 80 flow [2022-12-06 05:46:57,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 72 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:46:57,130 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:57,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2022-12-06 05:46:57,134 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2022-12-06 05:46:57,134 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:57,135 INFO L89 Accepts]: Start accepts. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:57,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:57,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:57,137 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:57,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:57,142 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:46:57,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:46:57,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2022-12-06 05:46:57,143 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 18 transitions, 50 flow [2022-12-06 05:46:57,143 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:46:57,818 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:57,819 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 685 [2022-12-06 05:46:57,819 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 46 flow [2022-12-06 05:46:57,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-06 05:46:57,819 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:57,820 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:57,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:46:57,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:57,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1825621982, now seen corresponding path program 1 times [2022-12-06 05:46:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:57,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349735676] [2022-12-06 05:46:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:58,008 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-06 05:46:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:58,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349735676] [2022-12-06 05:46:58,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349735676] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:58,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:58,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:46:58,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648760849] [2022-12-06 05:46:58,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:58,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:46:58,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:58,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:46:58,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:46:58,011 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 05:46:58,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:58,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:58,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 05:46:58,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:58,146 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-06 05:46:58,147 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:46:58,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 134 events. 72/134 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 368 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 274. Up to 76 conditions per place. [2022-12-06 05:46:58,148 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-06 05:46:58,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 39 transitions, 173 flow [2022-12-06 05:46:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:46:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:46:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-06 05:46:58,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-06 05:46:58,150 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 46 flow. Second operand 5 states and 40 transitions. [2022-12-06 05:46:58,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 39 transitions, 173 flow [2022-12-06 05:46:58,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 39 transitions, 165 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:58,151 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:58,151 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2022-12-06 05:46:58,152 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2022-12-06 05:46:58,152 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:58,152 INFO L89 Accepts]: Start accepts. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:58,153 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:58,153 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:58,153 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:58,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:58,158 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-06 05:46:58,159 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-06 05:46:58,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 4/28 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 32. Up to 6 conditions per place. [2022-12-06 05:46:58,160 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 74 flow [2022-12-06 05:46:58,160 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:46:58,275 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:58,276 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 124 [2022-12-06 05:46:58,276 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow [2022-12-06 05:46:58,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:58,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:58,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:58,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:46:58,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:58,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:58,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1532974384, now seen corresponding path program 1 times [2022-12-06 05:46:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:58,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197330245] [2022-12-06 05:46:58,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:58,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:58,409 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-06 05:46:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:58,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197330245] [2022-12-06 05:46:58,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197330245] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:58,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:58,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776946988] [2022-12-06 05:46:58,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:58,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:58,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:58,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:58,412 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 05:46:58,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:58,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:58,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 05:46:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:58,494 INFO L130 PetriNetUnfolder]: 87/169 cut-off events. [2022-12-06 05:46:58,494 INFO L131 PetriNetUnfolder]: For 142/142 co-relation queries the response was YES. [2022-12-06 05:46:58,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 169 events. 87/169 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 526 event pairs, 33 based on Foata normal form. 2/134 useless extension candidates. Maximal degree in co-relation 220. Up to 109 conditions per place. [2022-12-06 05:46:58,495 INFO L137 encePairwiseOnDemand]: 14/18 looper letters, 32 selfloop transitions, 3 changer transitions 1/36 dead transitions. [2022-12-06 05:46:58,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 36 transitions, 199 flow [2022-12-06 05:46:58,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:46:58,496 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:46:58,496 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 65 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:46:58,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 36 transitions, 199 flow [2022-12-06 05:46:58,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 169 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:58,497 INFO L231 Difference]: Finished difference. Result has 26 places, 20 transitions, 72 flow [2022-12-06 05:46:58,498 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2022-12-06 05:46:58,498 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:46:58,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:58,498 INFO L89 Accepts]: Start accepts. Operand has 26 places, 20 transitions, 72 flow [2022-12-06 05:46:58,499 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:58,499 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:58,499 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 72 flow [2022-12-06 05:46:58,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 20 transitions, 72 flow [2022-12-06 05:46:58,502 INFO L130 PetriNetUnfolder]: 3/32 cut-off events. [2022-12-06 05:46:58,503 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-06 05:46:58,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 6 conditions per place. [2022-12-06 05:46:58,503 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 20 transitions, 72 flow [2022-12-06 05:46:58,503 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 05:46:58,586 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:58,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 89 [2022-12-06 05:46:58,587 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 75 flow [2022-12-06 05:46:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:58,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:58,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:58,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:46:58,588 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:58,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:58,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1412493814, now seen corresponding path program 2 times [2022-12-06 05:46:58,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:58,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919270474] [2022-12-06 05:46:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:58,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:58,710 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-06 05:46:58,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:58,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919270474] [2022-12-06 05:46:58,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919270474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:58,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:58,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:58,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325359086] [2022-12-06 05:46:58,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:58,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:58,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:58,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:58,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:46:58,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:58,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:58,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:46:58,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:58,781 INFO L130 PetriNetUnfolder]: 77/149 cut-off events. [2022-12-06 05:46:58,782 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-12-06 05:46:58,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 149 events. 77/149 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 432 event pairs, 42 based on Foata normal form. 4/128 useless extension candidates. Maximal degree in co-relation 272. Up to 126 conditions per place. [2022-12-06 05:46:58,790 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 24 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2022-12-06 05:46:58,790 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2022-12-06 05:46:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-12-06 05:46:58,792 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40789473684210525 [2022-12-06 05:46:58,792 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 75 flow. Second operand 4 states and 31 transitions. [2022-12-06 05:46:58,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2022-12-06 05:46:58,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 148 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:46:58,794 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 70 flow [2022-12-06 05:46:58,794 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2022-12-06 05:46:58,795 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 6 predicate places. [2022-12-06 05:46:58,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:58,795 INFO L89 Accepts]: Start accepts. Operand has 27 places, 20 transitions, 70 flow [2022-12-06 05:46:58,797 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:58,797 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:58,797 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 20 transitions, 70 flow [2022-12-06 05:46:58,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 70 flow [2022-12-06 05:46:58,801 INFO L130 PetriNetUnfolder]: 3/29 cut-off events. [2022-12-06 05:46:58,801 INFO L131 PetriNetUnfolder]: For 13/14 co-relation queries the response was YES. [2022-12-06 05:46:58,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 29 events. 3/29 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-06 05:46:58,801 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 70 flow [2022-12-06 05:46:58,802 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:46:59,080 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:46:59,081 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-06 05:46:59,081 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 64 flow [2022-12-06 05:46:59,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:59,081 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:59,081 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:59,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:46:59,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:59,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1685689284, now seen corresponding path program 1 times [2022-12-06 05:46:59,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:59,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507675750] [2022-12-06 05:46:59,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:59,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:59,253 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-06 05:46:59,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:59,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507675750] [2022-12-06 05:46:59,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507675750] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:59,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:59,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282496745] [2022-12-06 05:46:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:59,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:59,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:59,256 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:46:59,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:59,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:59,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:46:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:59,359 INFO L130 PetriNetUnfolder]: 93/181 cut-off events. [2022-12-06 05:46:59,359 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 05:46:59,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 181 events. 93/181 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 577 event pairs, 42 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 413. Up to 130 conditions per place. [2022-12-06 05:46:59,360 INFO L137 encePairwiseOnDemand]: 15/19 looper letters, 32 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2022-12-06 05:46:59,360 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 36 transitions, 186 flow [2022-12-06 05:46:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:59,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 05:46:59,361 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4868421052631579 [2022-12-06 05:46:59,361 INFO L175 Difference]: Start difference. First operand has 24 places, 19 transitions, 64 flow. Second operand 4 states and 37 transitions. [2022-12-06 05:46:59,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 36 transitions, 186 flow [2022-12-06 05:46:59,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 166 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-12-06 05:46:59,362 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 81 flow [2022-12-06 05:46:59,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2022-12-06 05:46:59,363 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-06 05:46:59,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:59,363 INFO L89 Accepts]: Start accepts. Operand has 26 places, 22 transitions, 81 flow [2022-12-06 05:46:59,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:59,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:59,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-06 05:46:59,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 81 flow [2022-12-06 05:46:59,368 INFO L130 PetriNetUnfolder]: 5/41 cut-off events. [2022-12-06 05:46:59,368 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 05:46:59,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 41 events. 5/41 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 97 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2022-12-06 05:46:59,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 22 transitions, 81 flow [2022-12-06 05:46:59,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 96 [2022-12-06 05:46:59,376 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:46:59,777 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:46:59,778 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 415 [2022-12-06 05:46:59,778 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 92 flow [2022-12-06 05:46:59,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:59,778 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:46:59,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:46:59,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:46:59,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:46:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:46:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1941960187, now seen corresponding path program 1 times [2022-12-06 05:46:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:46:59,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621531966] [2022-12-06 05:46:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:46:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:46:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:46:59,867 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-06 05:46:59,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:46:59,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621531966] [2022-12-06 05:46:59,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621531966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:46:59,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:46:59,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:46:59,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700529249] [2022-12-06 05:46:59,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:46:59,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:46:59,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:46:59,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:46:59,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:46:59,870 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:46:59,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:46:59,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:46:59,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:46:59,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:46:59,984 INFO L130 PetriNetUnfolder]: 139/273 cut-off events. [2022-12-06 05:46:59,984 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2022-12-06 05:46:59,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 273 events. 139/273 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1071 event pairs, 62 based on Foata normal form. 4/234 useless extension candidates. Maximal degree in co-relation 512. Up to 180 conditions per place. [2022-12-06 05:46:59,986 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 40 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2022-12-06 05:46:59,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 258 flow [2022-12-06 05:46:59,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:46:59,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:46:59,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 05:46:59,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2022-12-06 05:46:59,987 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 92 flow. Second operand 4 states and 43 transitions. [2022-12-06 05:46:59,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 258 flow [2022-12-06 05:46:59,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 248 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 05:46:59,992 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 106 flow [2022-12-06 05:46:59,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=106, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 05:46:59,995 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2022-12-06 05:46:59,995 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:46:59,995 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 106 flow [2022-12-06 05:46:59,996 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:46:59,996 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:46:59,996 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-06 05:46:59,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 106 flow [2022-12-06 05:47:00,001 INFO L130 PetriNetUnfolder]: 4/54 cut-off events. [2022-12-06 05:47:00,001 INFO L131 PetriNetUnfolder]: For 19/23 co-relation queries the response was YES. [2022-12-06 05:47:00,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 54 events. 4/54 cut-off events. For 19/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 183 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-12-06 05:47:00,001 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 106 flow [2022-12-06 05:47:00,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 05:47:00,007 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [781] $Ultimate##0-->L59-2: Formula: (let ((.cse1 (select |v_#memory_int_153| v_~f~0.base_125))) (let ((.cse2 (select .cse1 (+ v_~f~0.offset_125 (* v_~x2~0_230 4))))) (let ((.cse0 (select .cse1 (+ v_~f~0.offset_125 (* 4 .cse2))))) (and (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_194| 4294967293) 4294967296) (mod (+ v_~n~0_95 4294967294) 4294967296)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| (ite (and (< .cse0 v_~size~0_111) (<= 0 .cse0)) 1 0)) (= 3 |v_thread2Thread1of1ForFork1_~i~1#1_194|) (not (= (ite (and (<= 0 v_~x2~0_230) (< v_~x2~0_230 v_~size~0_111)) 1 0) 0)) (= v_~x2~0_229 (select .cse1 (+ v_~f~0.offset_125 (* .cse0 4)))) (not (= (ite (and (<= 0 .cse2) (< .cse2 v_~size~0_111)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|))))) InVars {~x2~0=v_~x2~0_230, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, #memory_int=|v_#memory_int_153|, ~n~0=v_~n~0_95, ~f~0.offset=v_~f~0.offset_125} OutVars{~x2~0=v_~x2~0_229, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_31|, ~size~0=v_~size~0_111, ~f~0.base=v_~f~0.base_125, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_41|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_148|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_194|, ~f~0.offset=v_~f~0.offset_125, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_186|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_29|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_23|, #memory_int=|v_#memory_int_153|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_41|, ~n~0=v_~n~0_95, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_45|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] and [783] $Ultimate##0-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_157| v_~f~0.base_129))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_129 (* v_~x2~0_243 4))))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_129 (* .cse1 4))))) (and (not (= (ite (and (<= 0 v_~x2~0_243) (< v_~x2~0_243 v_~size~0_115)) 1 0) 0)) (= |v_thread1Thread1of1ForFork0_#res#1.base_15| 0) (= |v_thread2Thread1of1ForFork1_~i~1#1_207| (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_208|)) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_51| 4294967296) (mod v_~n~0_99 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_51| 0) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| (ite (and (< .cse0 v_~size~0_115) (<= 0 .cse0)) 1 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|) (not (= (ite (and (<= 0 .cse1) (< .cse1 v_~size~0_115)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_208| 4294967296) (mod (+ v_~n~0_99 4294967294) 4294967296)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_15| 0) (= (select .cse2 (+ v_~f~0.offset_129 (* .cse0 4))) v_~x2~0_242))))) InVars {~x2~0=v_~x2~0_243, ~size~0=v_~size~0_115, ~f~0.base=v_~f~0.base_129, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_208|, ~n~0=v_~n~0_99, ~f~0.offset=v_~f~0.offset_129} OutVars{~x2~0=v_~x2~0_242, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_33|, ~size~0=v_~size~0_115, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_15|, ~f~0.base=v_~f~0.base_129, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_43|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_159|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_207|, ~f~0.offset=v_~f~0.offset_129, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_197|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_31|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_51|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_25|, #memory_int=|v_#memory_int_157|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_43|, ~n~0=v_~n~0_99, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_47|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_15|} AuxVars[] AssignedVars[~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork0_~i~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_#t~post6#1, thread1Thread1of1ForFork0_#res#1.base] [2022-12-06 05:47:00,314 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:00,315 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 05:47:00,315 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 107 flow [2022-12-06 05:47:00,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:00,315 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:00,315 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:00,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:47:00,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1695881691, now seen corresponding path program 2 times [2022-12-06 05:47:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:00,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122176146] [2022-12-06 05:47:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:00,428 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-06 05:47:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:00,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122176146] [2022-12-06 05:47:00,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122176146] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:00,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:00,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977495583] [2022-12-06 05:47:00,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:00,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:00,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:00,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:00,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 05:47:00,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:00,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:00,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 05:47:00,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:00,518 INFO L130 PetriNetUnfolder]: 140/276 cut-off events. [2022-12-06 05:47:00,518 INFO L131 PetriNetUnfolder]: For 371/371 co-relation queries the response was YES. [2022-12-06 05:47:00,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 276 events. 140/276 cut-off events. For 371/371 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1039 event pairs, 89 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 672. Up to 241 conditions per place. [2022-12-06 05:47:00,520 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-06 05:47:00,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 222 flow [2022-12-06 05:47:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-06 05:47:00,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-06 05:47:00,521 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 107 flow. Second operand 4 states and 32 transitions. [2022-12-06 05:47:00,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 222 flow [2022-12-06 05:47:00,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 207 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:00,523 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 122 flow [2022-12-06 05:47:00,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 05:47:00,523 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 05:47:00,523 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:00,523 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 122 flow [2022-12-06 05:47:00,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:00,524 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:00,524 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-06 05:47:00,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 122 flow [2022-12-06 05:47:00,531 INFO L130 PetriNetUnfolder]: 7/64 cut-off events. [2022-12-06 05:47:00,531 INFO L131 PetriNetUnfolder]: For 48/54 co-relation queries the response was YES. [2022-12-06 05:47:00,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 64 events. 7/64 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 249 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 89. Up to 9 conditions per place. [2022-12-06 05:47:00,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 122 flow [2022-12-06 05:47:00,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 05:47:00,643 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:00,643 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 05:47:00,643 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 116 flow [2022-12-06 05:47:00,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:00,644 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:00,644 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:00,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:47:00,644 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:00,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1493526263, now seen corresponding path program 1 times [2022-12-06 05:47:00,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:00,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302242963] [2022-12-06 05:47:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:00,720 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-06 05:47:00,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:00,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302242963] [2022-12-06 05:47:00,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302242963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:00,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:00,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:00,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156195216] [2022-12-06 05:47:00,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:00,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:00,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:00,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:00,722 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:47:00,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 05:47:00,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:00,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:47:00,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:00,784 INFO L130 PetriNetUnfolder]: 142/280 cut-off events. [2022-12-06 05:47:00,784 INFO L131 PetriNetUnfolder]: For 476/476 co-relation queries the response was YES. [2022-12-06 05:47:00,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885 conditions, 280 events. 142/280 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1065 event pairs, 96 based on Foata normal form. 4/269 useless extension candidates. Maximal degree in co-relation 749. Up to 276 conditions per place. [2022-12-06 05:47:00,786 INFO L137 encePairwiseOnDemand]: 19/22 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 05:47:00,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 185 flow [2022-12-06 05:47:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:00,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 05:47:00,787 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2022-12-06 05:47:00,787 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 116 flow. Second operand 3 states and 27 transitions. [2022-12-06 05:47:00,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 185 flow [2022-12-06 05:47:00,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 176 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:00,788 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 121 flow [2022-12-06 05:47:00,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2022-12-06 05:47:00,789 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 05:47:00,789 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:00,789 INFO L89 Accepts]: Start accepts. Operand has 35 places, 26 transitions, 121 flow [2022-12-06 05:47:00,789 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:00,789 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:00,789 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-06 05:47:00,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 121 flow [2022-12-06 05:47:00,794 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 05:47:00,794 INFO L131 PetriNetUnfolder]: For 45/50 co-relation queries the response was YES. [2022-12-06 05:47:00,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 64 events. 6/64 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 259 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 103. Up to 9 conditions per place. [2022-12-06 05:47:00,795 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 121 flow [2022-12-06 05:47:00,795 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 05:47:01,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:01,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 541 [2022-12-06 05:47:01,330 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 117 flow [2022-12-06 05:47:01,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 05:47:01,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:47:01,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:01,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 68936365, now seen corresponding path program 3 times [2022-12-06 05:47:01,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011009761] [2022-12-06 05:47:01,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,403 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-06 05:47:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011009761] [2022-12-06 05:47:01,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011009761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:01,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:01,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014495699] [2022-12-06 05:47:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:01,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:01,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 05:47:01,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:01,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:01,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 05:47:01,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:01,488 INFO L130 PetriNetUnfolder]: 138/266 cut-off events. [2022-12-06 05:47:01,488 INFO L131 PetriNetUnfolder]: For 443/443 co-relation queries the response was YES. [2022-12-06 05:47:01,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 266 events. 138/266 cut-off events. For 443/443 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1017 event pairs, 54 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 797. Up to 182 conditions per place. [2022-12-06 05:47:01,489 INFO L137 encePairwiseOnDemand]: 18/22 looper letters, 35 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2022-12-06 05:47:01,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 251 flow [2022-12-06 05:47:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 05:47:01,491 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-06 05:47:01,491 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 117 flow. Second operand 4 states and 39 transitions. [2022-12-06 05:47:01,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 251 flow [2022-12-06 05:47:01,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 237 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:01,493 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 136 flow [2022-12-06 05:47:01,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2022-12-06 05:47:01,494 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2022-12-06 05:47:01,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:01,494 INFO L89 Accepts]: Start accepts. Operand has 37 places, 27 transitions, 136 flow [2022-12-06 05:47:01,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:01,495 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:01,495 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-06 05:47:01,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 27 transitions, 136 flow [2022-12-06 05:47:01,501 INFO L130 PetriNetUnfolder]: 8/59 cut-off events. [2022-12-06 05:47:01,501 INFO L131 PetriNetUnfolder]: For 74/85 co-relation queries the response was YES. [2022-12-06 05:47:01,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 59 events. 8/59 cut-off events. For 74/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 208 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 96. Up to 8 conditions per place. [2022-12-06 05:47:01,502 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 27 transitions, 136 flow [2022-12-06 05:47:01,502 INFO L188 LiptonReduction]: Number of co-enabled transitions 124 [2022-12-06 05:47:01,582 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [782] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (select |v_#memory_int_155| v_~f~0.base_127))) (let ((.cse1 (select .cse0 (+ v_~f~0.offset_127 (* v_~x2~0_236 4))))) (and (<= (mod (+ v_~n~0_97 4294967294) 4294967296) 0) (not (= (ite (and (<= 0 v_~x2~0_236) (< v_~x2~0_236 v_~size~0_113)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|) (= 0 |v_thread2Thread1of1ForFork1_#res#1.base_23|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190| 0)) (= (select .cse0 (+ (* .cse1 4) v_~f~0.offset_127)) v_~x2~0_235) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152| (ite (and (< .cse1 v_~size~0_113) (<= 0 .cse1)) 1 0)) (= 2 |v_thread2Thread1of1ForFork1_~i~1#1_200|) (= |v_thread2Thread1of1ForFork1_#res#1.offset_23| 0)))) InVars {~x2~0=v_~x2~0_236, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, ~f~0.offset=v_~f~0.offset_127, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} OutVars{~x2~0=v_~x2~0_235, thread2Thread1of1ForFork1_#t~post10#1=|v_thread2Thread1of1ForFork1_#t~post10#1_33|, thread2Thread1of1ForFork1_#t~post12#1=|v_thread2Thread1of1ForFork1_#t~post12#1_37|, ~size~0=v_~size~0_113, ~f~0.base=v_~f~0.base_127, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_23|, thread2Thread1of1ForFork1_#t~mem11#1=|v_thread2Thread1of1ForFork1_#t~mem11#1_37|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_152|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_200|, ~f~0.offset=v_~f~0.offset_127, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_190|, thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_23|, thread2Thread1of1ForFork1_#t~mem9#1=|v_thread2Thread1of1ForFork1_#t~mem9#1_45|, #memory_int=|v_#memory_int_155|, ~n~0=v_~n~0_97} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post10#1, thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#t~mem9#1, thread2Thread1of1ForFork1_#t~post12#1, thread2Thread1of1ForFork1_#res#1.offset, thread2Thread1of1ForFork1_#t~mem11#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_~i~1#1] and [766] L49-2-->L49-2: Formula: (and (= (ite (and (< v_~x1~0_In_8 v_~size~0_In_17) (<= 0 v_~x1~0_In_8)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|) (= v_~x1~0_Out_12 (select (select |v_#memory_int_In_33| v_~f~0.base_In_22) (+ v_~f~0.offset_In_22 (* v_~x1~0_In_8 4)))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8| 0)) (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 4294967296) (mod v_~n~0_In_5 4294967296)) (= (+ |v_thread1Thread1of1ForFork0_~i~0#1_In_5| 1) |v_thread1Thread1of1ForFork0_~i~0#1_Out_6|)) InVars {~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_In_5|, #memory_int=|v_#memory_int_In_33|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_In_8, ~f~0.offset=v_~f~0.offset_In_22} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_Out_12|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_4|, ~size~0=v_~size~0_In_17, ~f~0.base=v_~f~0.base_In_22, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_Out_6|, #memory_int=|v_#memory_int_In_33|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_8|, ~n~0=v_~n~0_In_5, ~x1~0=v_~x1~0_Out_12, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_Out_10|, ~f~0.offset=v_~f~0.offset_In_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 05:47:01,764 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:01,765 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 271 [2022-12-06 05:47:01,765 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 139 flow [2022-12-06 05:47:01,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:01,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:01,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:01,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:47:01,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:01,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1608042867, now seen corresponding path program 1 times [2022-12-06 05:47:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:01,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511606002] [2022-12-06 05:47:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:01,858 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-06 05:47:01,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511606002] [2022-12-06 05:47:01,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511606002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:01,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:01,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261502580] [2022-12-06 05:47:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:01,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:01,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:01,860 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:47:01,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 05:47:01,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:01,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:47:01,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:01,958 INFO L130 PetriNetUnfolder]: 140/270 cut-off events. [2022-12-06 05:47:01,959 INFO L131 PetriNetUnfolder]: For 741/741 co-relation queries the response was YES. [2022-12-06 05:47:01,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 270 events. 140/270 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 991 event pairs, 94 based on Foata normal form. 4/259 useless extension candidates. Maximal degree in co-relation 706. Up to 266 conditions per place. [2022-12-06 05:47:01,960 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 05:47:01,960 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 210 flow [2022-12-06 05:47:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-12-06 05:47:01,961 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2022-12-06 05:47:01,961 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 139 flow. Second operand 3 states and 29 transitions. [2022-12-06 05:47:01,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 210 flow [2022-12-06 05:47:01,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 191 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-12-06 05:47:01,962 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 134 flow [2022-12-06 05:47:01,963 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2022-12-06 05:47:01,963 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2022-12-06 05:47:01,963 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:01,963 INFO L89 Accepts]: Start accepts. Operand has 35 places, 27 transitions, 134 flow [2022-12-06 05:47:01,963 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:01,964 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:01,964 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-06 05:47:01,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 134 flow [2022-12-06 05:47:01,968 INFO L130 PetriNetUnfolder]: 7/59 cut-off events. [2022-12-06 05:47:01,969 INFO L131 PetriNetUnfolder]: For 59/72 co-relation queries the response was YES. [2022-12-06 05:47:01,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 59 events. 7/59 cut-off events. For 59/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 216 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 102. Up to 8 conditions per place. [2022-12-06 05:47:01,969 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 134 flow [2022-12-06 05:47:01,969 INFO L188 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-06 05:47:02,659 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:02,660 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 697 [2022-12-06 05:47:02,660 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 130 flow [2022-12-06 05:47:02,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 05:47:02,660 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:02,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:02,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:47:02,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1745000772, now seen corresponding path program 1 times [2022-12-06 05:47:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814387778] [2022-12-06 05:47:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:02,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:02,891 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-06 05:47:02,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:02,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814387778] [2022-12-06 05:47:02,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814387778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:02,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:02,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:02,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082064845] [2022-12-06 05:47:02,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:02,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:47:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:02,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:47:02,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:47:02,892 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 05:47:02,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 130 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:02,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:02,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 05:47:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:03,071 INFO L130 PetriNetUnfolder]: 275/534 cut-off events. [2022-12-06 05:47:03,071 INFO L131 PetriNetUnfolder]: For 1001/1001 co-relation queries the response was YES. [2022-12-06 05:47:03,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 534 events. 275/534 cut-off events. For 1001/1001 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2521 event pairs, 67 based on Foata normal form. 1/503 useless extension candidates. Maximal degree in co-relation 1630. Up to 248 conditions per place. [2022-12-06 05:47:03,074 INFO L137 encePairwiseOnDemand]: 11/24 looper letters, 59 selfloop transitions, 14 changer transitions 6/79 dead transitions. [2022-12-06 05:47:03,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 559 flow [2022-12-06 05:47:03,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:47:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:47:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-12-06 05:47:03,075 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-06 05:47:03,076 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 130 flow. Second operand 6 states and 75 transitions. [2022-12-06 05:47:03,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 559 flow [2022-12-06 05:47:03,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 535 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:03,079 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 277 flow [2022-12-06 05:47:03,079 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-06 05:47:03,079 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2022-12-06 05:47:03,079 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:03,080 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 277 flow [2022-12-06 05:47:03,080 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:03,080 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:03,080 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 277 flow [2022-12-06 05:47:03,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 277 flow [2022-12-06 05:47:03,124 INFO L130 PetriNetUnfolder]: 36/166 cut-off events. [2022-12-06 05:47:03,124 INFO L131 PetriNetUnfolder]: For 351/435 co-relation queries the response was YES. [2022-12-06 05:47:03,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 166 events. 36/166 cut-off events. For 351/435 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 904 event pairs, 0 based on Foata normal form. 6/155 useless extension candidates. Maximal degree in co-relation 336. Up to 55 conditions per place. [2022-12-06 05:47:03,125 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 277 flow [2022-12-06 05:47:03,125 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:47:04,803 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:47:04,804 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1725 [2022-12-06 05:47:04,804 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 266 flow [2022-12-06 05:47:04,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:47:04,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:04,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:04,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:47:04,805 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:04,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:04,805 INFO L85 PathProgramCache]: Analyzing trace with hash -2107765014, now seen corresponding path program 1 times [2022-12-06 05:47:04,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:04,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533614002] [2022-12-06 05:47:04,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:04,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:04,920 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-06 05:47:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:04,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533614002] [2022-12-06 05:47:04,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533614002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:04,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:04,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:04,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046304975] [2022-12-06 05:47:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:04,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:04,923 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:47:04,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:04,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:04,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:47:04,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:05,028 INFO L130 PetriNetUnfolder]: 283/581 cut-off events. [2022-12-06 05:47:05,028 INFO L131 PetriNetUnfolder]: For 1558/1558 co-relation queries the response was YES. [2022-12-06 05:47:05,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 581 events. 283/581 cut-off events. For 1558/1558 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2890 event pairs, 178 based on Foata normal form. 8/588 useless extension candidates. Maximal degree in co-relation 1642. Up to 572 conditions per place. [2022-12-06 05:47:05,031 INFO L137 encePairwiseOnDemand]: 22/25 looper letters, 37 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2022-12-06 05:47:05,031 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 359 flow [2022-12-06 05:47:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:05,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 05:47:05,032 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 05:47:05,032 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 266 flow. Second operand 3 states and 30 transitions. [2022-12-06 05:47:05,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 359 flow [2022-12-06 05:47:05,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 337 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:05,035 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 248 flow [2022-12-06 05:47:05,035 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 05:47:05,037 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-06 05:47:05,037 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:05,037 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 248 flow [2022-12-06 05:47:05,038 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:05,038 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:05,038 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 248 flow [2022-12-06 05:47:05,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 248 flow [2022-12-06 05:47:05,054 INFO L130 PetriNetUnfolder]: 30/187 cut-off events. [2022-12-06 05:47:05,054 INFO L131 PetriNetUnfolder]: For 368/425 co-relation queries the response was YES. [2022-12-06 05:47:05,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 187 events. 30/187 cut-off events. For 368/425 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1173 event pairs, 0 based on Foata normal form. 7/181 useless extension candidates. Maximal degree in co-relation 424. Up to 58 conditions per place. [2022-12-06 05:47:05,055 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 248 flow [2022-12-06 05:47:05,055 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 05:47:06,923 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:06,924 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1887 [2022-12-06 05:47:06,924 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 247 flow [2022-12-06 05:47:06,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:06,924 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:06,924 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:06,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:47:06,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:06,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1357341352, now seen corresponding path program 1 times [2022-12-06 05:47:06,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:06,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53910809] [2022-12-06 05:47:06,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:06,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:07,018 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-06 05:47:07,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:07,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53910809] [2022-12-06 05:47:07,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53910809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:07,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:07,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:07,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543914335] [2022-12-06 05:47:07,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:07,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:07,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:07,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:47:07,020 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:07,020 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:07,020 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:47:07,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:07,183 INFO L130 PetriNetUnfolder]: 279/585 cut-off events. [2022-12-06 05:47:07,183 INFO L131 PetriNetUnfolder]: For 1789/1789 co-relation queries the response was YES. [2022-12-06 05:47:07,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 585 events. 279/585 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3014 event pairs, 142 based on Foata normal form. 16/600 useless extension candidates. Maximal degree in co-relation 2010. Up to 450 conditions per place. [2022-12-06 05:47:07,186 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 45 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-06 05:47:07,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 412 flow [2022-12-06 05:47:07,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:07,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:47:07,187 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-06 05:47:07,188 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 247 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:47:07,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 412 flow [2022-12-06 05:47:07,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 388 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:07,191 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 266 flow [2022-12-06 05:47:07,191 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 05:47:07,192 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 05:47:07,192 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:07,192 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 266 flow [2022-12-06 05:47:07,193 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:07,193 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:07,193 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 266 flow [2022-12-06 05:47:07,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 266 flow [2022-12-06 05:47:07,209 INFO L130 PetriNetUnfolder]: 31/200 cut-off events. [2022-12-06 05:47:07,209 INFO L131 PetriNetUnfolder]: For 483/531 co-relation queries the response was YES. [2022-12-06 05:47:07,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 200 events. 31/200 cut-off events. For 483/531 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1280 event pairs, 2 based on Foata normal form. 7/200 useless extension candidates. Maximal degree in co-relation 419. Up to 62 conditions per place. [2022-12-06 05:47:07,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 266 flow [2022-12-06 05:47:07,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 05:47:07,616 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:07,617 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 425 [2022-12-06 05:47:07,617 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 260 flow [2022-12-06 05:47:07,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:07,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:07,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:07,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:47:07,617 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:07,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1077710224, now seen corresponding path program 1 times [2022-12-06 05:47:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:07,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369103055] [2022-12-06 05:47:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:07,718 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-06 05:47:07,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:07,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369103055] [2022-12-06 05:47:07,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369103055] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:07,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:07,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053411068] [2022-12-06 05:47:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:07,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:07,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:07,720 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:07,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:07,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:07,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:07,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:07,827 INFO L130 PetriNetUnfolder]: 273/571 cut-off events. [2022-12-06 05:47:07,827 INFO L131 PetriNetUnfolder]: For 2108/2108 co-relation queries the response was YES. [2022-12-06 05:47:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2184 conditions, 571 events. 273/571 cut-off events. For 2108/2108 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2888 event pairs, 170 based on Foata normal form. 8/578 useless extension candidates. Maximal degree in co-relation 1748. Up to 562 conditions per place. [2022-12-06 05:47:07,830 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 38 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-06 05:47:07,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 355 flow [2022-12-06 05:47:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 05:47:07,831 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3950617283950617 [2022-12-06 05:47:07,831 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 260 flow. Second operand 3 states and 32 transitions. [2022-12-06 05:47:07,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 355 flow [2022-12-06 05:47:07,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 338 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:07,835 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 264 flow [2022-12-06 05:47:07,835 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2022-12-06 05:47:07,836 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2022-12-06 05:47:07,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:07,836 INFO L89 Accepts]: Start accepts. Operand has 44 places, 38 transitions, 264 flow [2022-12-06 05:47:07,837 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:07,837 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:07,837 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 264 flow [2022-12-06 05:47:07,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 264 flow [2022-12-06 05:47:07,856 INFO L130 PetriNetUnfolder]: 30/195 cut-off events. [2022-12-06 05:47:07,856 INFO L131 PetriNetUnfolder]: For 430/477 co-relation queries the response was YES. [2022-12-06 05:47:07,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 195 events. 30/195 cut-off events. For 430/477 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1262 event pairs, 1 based on Foata normal form. 7/195 useless extension candidates. Maximal degree in co-relation 452. Up to 60 conditions per place. [2022-12-06 05:47:07,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 264 flow [2022-12-06 05:47:07,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-06 05:47:10,797 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:10,798 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2962 [2022-12-06 05:47:10,798 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 263 flow [2022-12-06 05:47:10,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:10,798 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:10,798 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:10,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:47:10,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:10,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:10,799 INFO L85 PathProgramCache]: Analyzing trace with hash -877721781, now seen corresponding path program 1 times [2022-12-06 05:47:10,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:10,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644890431] [2022-12-06 05:47:10,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:10,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:10,919 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-06 05:47:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:10,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644890431] [2022-12-06 05:47:10,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644890431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:10,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:10,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503614606] [2022-12-06 05:47:10,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:10,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:10,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:10,921 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 05:47:10,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:10,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:10,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 05:47:10,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,145 INFO L130 PetriNetUnfolder]: 350/734 cut-off events. [2022-12-06 05:47:11,146 INFO L131 PetriNetUnfolder]: For 2349/2349 co-relation queries the response was YES. [2022-12-06 05:47:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2759 conditions, 734 events. 350/734 cut-off events. For 2349/2349 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4027 event pairs, 168 based on Foata normal form. 16/749 useless extension candidates. Maximal degree in co-relation 2597. Up to 574 conditions per place. [2022-12-06 05:47:11,150 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 52 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2022-12-06 05:47:11,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 506 flow [2022-12-06 05:47:11,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:11,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:11,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 05:47:11,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2022-12-06 05:47:11,151 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 263 flow. Second operand 4 states and 46 transitions. [2022-12-06 05:47:11,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 506 flow [2022-12-06 05:47:11,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 480 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:11,155 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 321 flow [2022-12-06 05:47:11,155 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-06 05:47:11,155 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-06 05:47:11,155 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:11,155 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 321 flow [2022-12-06 05:47:11,157 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:11,157 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:11,157 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 321 flow [2022-12-06 05:47:11,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 321 flow [2022-12-06 05:47:11,177 INFO L130 PetriNetUnfolder]: 43/262 cut-off events. [2022-12-06 05:47:11,178 INFO L131 PetriNetUnfolder]: For 651/712 co-relation queries the response was YES. [2022-12-06 05:47:11,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 262 events. 43/262 cut-off events. For 651/712 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1848 event pairs, 1 based on Foata normal form. 8/261 useless extension candidates. Maximal degree in co-relation 553. Up to 84 conditions per place. [2022-12-06 05:47:11,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 321 flow [2022-12-06 05:47:11,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:47:11,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:11,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [779] $Ultimate##0-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res#1.offset_13| 0) (= |v_thread1Thread1of1ForFork0_#res#1.base_13| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_45| 4294967296) (mod v_~n~0_91 4294967296))) (= |v_thread1Thread1of1ForFork0_~i~0#1_45| 0)) InVars {~n~0=v_~n~0_91} OutVars{thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_13|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_45|, ~n~0=v_~n~0_91, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_13|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:11,477 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [777] L59-2-->L59-2: Formula: (let ((.cse2 (select |v_#memory_int_145| v_~f~0.base_119))) (let ((.cse0 (select .cse2 (+ v_~f~0.offset_119 (* v_~x2~0_220 4))))) (let ((.cse1 (select .cse2 (+ v_~f~0.offset_119 (* .cse0 4))))) (and (not (= (ite (and (< .cse0 v_~size~0_105) (<= 0 .cse0)) 1 0) 0)) (= (+ 3 |v_thread2Thread1of1ForFork1_~i~1#1_187|) |v_thread2Thread1of1ForFork1_~i~1#1_185|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| (ite (and (< .cse1 v_~size~0_105) (<= 0 .cse1)) 1 0)) (not (= (ite (and (< v_~x2~0_220 v_~size~0_105) (<= 0 v_~x2~0_220)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|) (= v_~x2~0_218 (select .cse2 (+ v_~f~0.offset_119 (* .cse1 4)))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179| 0)) (< (mod |v_thread2Thread1of1ForFork1_~i~1#1_187| 4294967296) (mod (+ v_~n~0_87 4294967294) 4294967296)))))) InVars {~x2~0=v_~x2~0_220, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_187|, ~n~0=v_~n~0_87, ~f~0.offset=v_~f~0.offset_119} OutVars{~x2~0=v_~x2~0_218, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_29|, ~size~0=v_~size~0_105, ~f~0.base=v_~f~0.base_119, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_39|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_143|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_185|, ~f~0.offset=v_~f~0.offset_119, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_179|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_27|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_145|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_39|, ~n~0=v_~n~0_87, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_43|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:11,644 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:11,644 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 489 [2022-12-06 05:47:11,644 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 357 flow [2022-12-06 05:47:11,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:11,645 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:11,645 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:11,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:47:11,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:11,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:11,645 INFO L85 PathProgramCache]: Analyzing trace with hash -47655434, now seen corresponding path program 1 times [2022-12-06 05:47:11,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:11,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49393553] [2022-12-06 05:47:11,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:11,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:11,738 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-06 05:47:11,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:11,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49393553] [2022-12-06 05:47:11,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49393553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:11,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:11,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139398959] [2022-12-06 05:47:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:11,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:11,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:11,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:11,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:11,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:11,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 357 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:11,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:11,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:11,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:11,866 INFO L130 PetriNetUnfolder]: 347/735 cut-off events. [2022-12-06 05:47:11,866 INFO L131 PetriNetUnfolder]: For 2671/2671 co-relation queries the response was YES. [2022-12-06 05:47:11,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2900 conditions, 735 events. 347/735 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4005 event pairs, 220 based on Foata normal form. 8/742 useless extension candidates. Maximal degree in co-relation 2370. Up to 726 conditions per place. [2022-12-06 05:47:11,870 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-06 05:47:11,870 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 464 flow [2022-12-06 05:47:11,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:47:11,871 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 05:47:11,871 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 357 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:47:11,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 464 flow [2022-12-06 05:47:11,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 448 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-12-06 05:47:11,876 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 362 flow [2022-12-06 05:47:11,877 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 05:47:11,877 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 28 predicate places. [2022-12-06 05:47:11,877 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:11,877 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 362 flow [2022-12-06 05:47:11,878 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:11,878 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:11,878 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 362 flow [2022-12-06 05:47:11,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 362 flow [2022-12-06 05:47:11,897 INFO L130 PetriNetUnfolder]: 43/263 cut-off events. [2022-12-06 05:47:11,898 INFO L131 PetriNetUnfolder]: For 743/806 co-relation queries the response was YES. [2022-12-06 05:47:11,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 263 events. 43/263 cut-off events. For 743/806 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1845 event pairs, 1 based on Foata normal form. 9/263 useless extension candidates. Maximal degree in co-relation 670. Up to 85 conditions per place. [2022-12-06 05:47:11,899 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 362 flow [2022-12-06 05:47:11,899 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 05:47:15,484 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:15,485 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3608 [2022-12-06 05:47:15,485 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 363 flow [2022-12-06 05:47:15,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:15,485 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:15,485 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:15,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:47:15,485 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:15,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:15,486 INFO L85 PathProgramCache]: Analyzing trace with hash -502319514, now seen corresponding path program 1 times [2022-12-06 05:47:15,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:15,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364589001] [2022-12-06 05:47:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:15,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:15,590 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-06 05:47:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364589001] [2022-12-06 05:47:15,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364589001] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:15,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:15,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:15,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145371072] [2022-12-06 05:47:15,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:15,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:15,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:15,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:15,592 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:15,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 363 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:15,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:15,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:15,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:15,814 INFO L130 PetriNetUnfolder]: 334/708 cut-off events. [2022-12-06 05:47:15,814 INFO L131 PetriNetUnfolder]: For 2926/2926 co-relation queries the response was YES. [2022-12-06 05:47:15,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 708 events. 334/708 cut-off events. For 2926/2926 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3830 event pairs, 160 based on Foata normal form. 8/715 useless extension candidates. Maximal degree in co-relation 2698. Up to 548 conditions per place. [2022-12-06 05:47:15,818 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 58 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2022-12-06 05:47:15,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 600 flow [2022-12-06 05:47:15,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-06 05:47:15,819 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2022-12-06 05:47:15,819 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 363 flow. Second operand 4 states and 47 transitions. [2022-12-06 05:47:15,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 600 flow [2022-12-06 05:47:15,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 574 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:15,824 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,824 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=371, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2022-12-06 05:47:15,824 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-06 05:47:15,824 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:15,824 INFO L89 Accepts]: Start accepts. Operand has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:15,825 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:15,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,844 INFO L130 PetriNetUnfolder]: 42/252 cut-off events. [2022-12-06 05:47:15,844 INFO L131 PetriNetUnfolder]: For 798/861 co-relation queries the response was YES. [2022-12-06 05:47:15,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 252 events. 42/252 cut-off events. For 798/861 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1737 event pairs, 0 based on Foata normal form. 9/252 useless extension candidates. Maximal degree in co-relation 600. Up to 81 conditions per place. [2022-12-06 05:47:15,845 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,846 INFO L188 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-06 05:47:15,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:47:15,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:47:15,847 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 371 flow [2022-12-06 05:47:15,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:15,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:15,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:15,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:47:15,847 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1869903037, now seen corresponding path program 1 times [2022-12-06 05:47:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:15,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697280641] [2022-12-06 05:47:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:15,943 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-06 05:47:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:15,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697280641] [2022-12-06 05:47:15,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697280641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:15,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:15,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:15,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835871386] [2022-12-06 05:47:15,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:15,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:15,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:15,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:15,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:15,944 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:15,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:15,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:16,080 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:16,080 INFO L131 PetriNetUnfolder]: For 3149/3149 co-relation queries the response was YES. [2022-12-06 05:47:16,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 717 events. 339/717 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3871 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2538. Up to 708 conditions per place. [2022-12-06 05:47:16,084 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:47:16,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 48 transitions, 480 flow [2022-12-06 05:47:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:16,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:47:16,084 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 05:47:16,084 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 371 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:47:16,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 48 transitions, 480 flow [2022-12-06 05:47:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 05:47:16,089 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:16,089 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 05:47:16,089 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:47:16,089 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:16,089 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:16,089 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:16,089 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:16,090 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:16,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:16,117 INFO L130 PetriNetUnfolder]: 42/254 cut-off events. [2022-12-06 05:47:16,117 INFO L131 PetriNetUnfolder]: For 830/893 co-relation queries the response was YES. [2022-12-06 05:47:16,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 254 events. 42/254 cut-off events. For 830/893 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1750 event pairs, 0 based on Foata normal form. 9/254 useless extension candidates. Maximal degree in co-relation 656. Up to 81 conditions per place. [2022-12-06 05:47:16,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:16,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:20,782 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:20,782 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4693 [2022-12-06 05:47:20,782 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 05:47:20,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:20,783 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:20,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:20,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:47:20,783 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:20,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:20,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1017359416, now seen corresponding path program 1 times [2022-12-06 05:47:20,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:20,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707514296] [2022-12-06 05:47:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:20,867 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-06 05:47:20,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:20,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707514296] [2022-12-06 05:47:20,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707514296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:20,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:20,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:20,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172880798] [2022-12-06 05:47:20,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:20,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:20,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:20,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:20,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:20,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:20,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:20,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:20,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:21,029 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:21,029 INFO L131 PetriNetUnfolder]: For 3400/3400 co-relation queries the response was YES. [2022-12-06 05:47:21,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3400/3400 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3904 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 05:47:21,033 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 05:47:21,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:47:21,034 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:47:21,034 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:47:21,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:21,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:21,039 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:21,039 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:47:21,039 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:47:21,039 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:21,039 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:21,040 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:21,040 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:21,040 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:21,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:21,070 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 05:47:21,070 INFO L131 PetriNetUnfolder]: For 912/975 co-relation queries the response was YES. [2022-12-06 05:47:21,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 912/975 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1804 event pairs, 0 based on Foata normal form. 9/259 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 05:47:21,071 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:21,071 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:21,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:21,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 616 [2022-12-06 05:47:21,655 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 393 flow [2022-12-06 05:47:21,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:21,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:21,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:21,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:47:21,655 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:21,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1991555393, now seen corresponding path program 1 times [2022-12-06 05:47:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994752618] [2022-12-06 05:47:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:21,763 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-06 05:47:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:21,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994752618] [2022-12-06 05:47:21,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994752618] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:21,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:21,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429336519] [2022-12-06 05:47:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:21,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:21,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:21,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:21,764 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:21,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:21,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:21,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:21,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:21,899 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:21,900 INFO L131 PetriNetUnfolder]: For 3644/3644 co-relation queries the response was YES. [2022-12-06 05:47:21,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 717 events. 339/717 cut-off events. For 3644/3644 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3869 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2706. Up to 708 conditions per place. [2022-12-06 05:47:21,905 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:47:21,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 504 flow [2022-12-06 05:47:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:47:21,906 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 05:47:21,906 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 393 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:47:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 504 flow [2022-12-06 05:47:21,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:21,912 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:21,913 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 05:47:21,913 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:47:21,913 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:21,913 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:21,913 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:21,914 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:21,914 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:21,934 INFO L130 PetriNetUnfolder]: 42/256 cut-off events. [2022-12-06 05:47:21,934 INFO L131 PetriNetUnfolder]: For 841/904 co-relation queries the response was YES. [2022-12-06 05:47:21,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 256 events. 42/256 cut-off events. For 841/904 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1780 event pairs, 0 based on Foata normal form. 9/256 useless extension candidates. Maximal degree in co-relation 671. Up to 81 conditions per place. [2022-12-06 05:47:21,936 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:21,936 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:28,977 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:28,978 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7065 [2022-12-06 05:47:28,978 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 05:47:28,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:28,979 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:28,979 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:28,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:47:28,979 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash 979328285, now seen corresponding path program 1 times [2022-12-06 05:47:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:28,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800562003] [2022-12-06 05:47:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:29,091 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-06 05:47:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:29,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800562003] [2022-12-06 05:47:29,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800562003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:29,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:29,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296041580] [2022-12-06 05:47:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:29,093 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:29,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:29,093 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:29,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:29,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:29,335 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:29,336 INFO L131 PetriNetUnfolder]: For 3400/3400 co-relation queries the response was YES. [2022-12-06 05:47:29,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3400/3400 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3887 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 05:47:29,344 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 05:47:29,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:47:29,345 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:47:29,345 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:47:29,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:29,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:29,351 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:29,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:47:29,351 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:47:29,351 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:29,352 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:29,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:29,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:29,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:29,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:29,374 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 05:47:29,374 INFO L131 PetriNetUnfolder]: For 910/973 co-relation queries the response was YES. [2022-12-06 05:47:29,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 910/973 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1798 event pairs, 0 based on Foata normal form. 9/259 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 05:47:29,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:29,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:30,448 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:30,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1098 [2022-12-06 05:47:30,449 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 393 flow [2022-12-06 05:47:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:30,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:30,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:30,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:47:30,449 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:30,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:30,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2131636997, now seen corresponding path program 1 times [2022-12-06 05:47:30,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:30,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606554820] [2022-12-06 05:47:30,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:30,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:30,538 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-06 05:47:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:30,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606554820] [2022-12-06 05:47:30,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606554820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:30,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:30,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831613049] [2022-12-06 05:47:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:30,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:30,540 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:30,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:30,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:30,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:30,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:30,664 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:30,664 INFO L131 PetriNetUnfolder]: For 3643/3643 co-relation queries the response was YES. [2022-12-06 05:47:30,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 717 events. 339/717 cut-off events. For 3643/3643 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3879 event pairs, 212 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2706. Up to 708 conditions per place. [2022-12-06 05:47:30,668 INFO L137 encePairwiseOnDemand]: 26/30 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:47:30,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 504 flow [2022-12-06 05:47:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:47:30,668 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-06 05:47:30,669 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 393 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:47:30,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 504 flow [2022-12-06 05:47:30,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 476 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 05:47:30,673 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:30,674 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2022-12-06 05:47:30,674 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:47:30,674 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:30,674 INFO L89 Accepts]: Start accepts. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:30,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:30,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:30,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:30,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:30,693 INFO L130 PetriNetUnfolder]: 42/254 cut-off events. [2022-12-06 05:47:30,693 INFO L131 PetriNetUnfolder]: For 846/909 co-relation queries the response was YES. [2022-12-06 05:47:30,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 254 events. 42/254 cut-off events. For 846/909 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1763 event pairs, 0 based on Foata normal form. 9/254 useless extension candidates. Maximal degree in co-relation 656. Up to 81 conditions per place. [2022-12-06 05:47:30,702 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 45 transitions, 388 flow [2022-12-06 05:47:30,702 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:42,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:42,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11656 [2022-12-06 05:47:42,330 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 389 flow [2022-12-06 05:47:42,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:42,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:42,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:42,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:47:42,331 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:42,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:42,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1151103191, now seen corresponding path program 1 times [2022-12-06 05:47:42,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:42,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671728709] [2022-12-06 05:47:42,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:42,432 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-06 05:47:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:42,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671728709] [2022-12-06 05:47:42,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671728709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:42,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:42,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:47:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802747061] [2022-12-06 05:47:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:47:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:42,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:47:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:47:42,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 30 [2022-12-06 05:47:42,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:42,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:42,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 30 [2022-12-06 05:47:42,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:42,644 INFO L130 PetriNetUnfolder]: 339/717 cut-off events. [2022-12-06 05:47:42,644 INFO L131 PetriNetUnfolder]: For 3415/3415 co-relation queries the response was YES. [2022-12-06 05:47:42,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 717 events. 339/717 cut-off events. For 3415/3415 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3893 event pairs, 191 based on Foata normal form. 8/724 useless extension candidates. Maximal degree in co-relation 2828. Up to 591 conditions per place. [2022-12-06 05:47:42,650 INFO L137 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2022-12-06 05:47:42,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:47:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:47:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 05:47:42,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2022-12-06 05:47:42,652 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 389 flow. Second operand 4 states and 44 transitions. [2022-12-06 05:47:42,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 557 flow [2022-12-06 05:47:42,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 529 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:42,659 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:42,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=397, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:47:42,660 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:47:42,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:42,660 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:42,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:42,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:42,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:42,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:42,689 INFO L130 PetriNetUnfolder]: 42/258 cut-off events. [2022-12-06 05:47:42,689 INFO L131 PetriNetUnfolder]: For 882/945 co-relation queries the response was YES. [2022-12-06 05:47:42,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 258 events. 42/258 cut-off events. For 882/945 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1794 event pairs, 0 based on Foata normal form. 9/258 useless extension candidates. Maximal degree in co-relation 646. Up to 81 conditions per place. [2022-12-06 05:47:42,691 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 397 flow [2022-12-06 05:47:42,691 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 05:47:42,726 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [826] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_243| v_~f~0.base_195))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_197 (* v_~x2~0_380 4))))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_197 (* .cse13 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse3))))) (let ((.cse11 (select .cse10 (+ v_~f~0.offset_197 (* .cse1 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_197 (* .cse11 4))))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_197 (* .cse8 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_197 (* .cse4 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_197 (* .cse2 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_197 (* .cse7 4))))) (let ((.cse9 (select .cse10 (+ (* 4 .cse0) v_~f~0.offset_197)))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse9))))) (let ((.cse14 (select .cse10 (+ v_~f~0.offset_197 (* .cse12 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_197 (* .cse14 4))))) (let ((.cse5 (select .cse10 (+ v_~f~0.offset_197 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_301| 15) (not (= (ite (and (<= 0 v_~x2~0_380) (< v_~x2~0_380 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse0 v_~size~0_181) (<= 0 .cse0)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_181) (<= 0 .cse1)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (not (= (ite (and (< .cse4 v_~size~0_181) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_181)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_181) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse5))) v_~x2~0_378) (not (= (ite (and (< .cse11 v_~size~0_181) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_181) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (not (= (ite (and (< .cse13 v_~size~0_181) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_301| 4294967293) 4294967296) (mod (+ 4294967294 v_~n~0_165) 4294967296)) (not (= (ite (and (< .cse14 v_~size~0_181) (<= 0 .cse14)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_380, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_243|, ~n~0=v_~n~0_165, ~f~0.offset=v_~f~0.offset_197} OutVars{~x2~0=v_~x2~0_378, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_301|, ~f~0.offset=v_~f~0.offset_197, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_103|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_97|, #memory_int=|v_#memory_int_243|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:44,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [792] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_119 4294967296))) (and (= |v_thread1Thread1of1ForFork0_#res#1.base_21| 0) (not (< (mod |v_thread1Thread1of1ForFork0_~i~0#1_77| 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork0_#res#1.offset_21| 0) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| 0)) (= (ite (and (<= 0 v_~x1~0_97) (< v_~x1~0_97 v_~size~0_133)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= v_~x1~0_96 (select (select |v_#memory_int_183| v_~f~0.base_147) (+ v_~f~0.offset_147 (* v_~x1~0_97 4)))) (< 0 .cse0) (= |v_thread1Thread1of1ForFork0_~i~0#1_77| 1))) InVars {~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, #memory_int=|v_#memory_int_183|, ~n~0=v_~n~0_119, ~x1~0=v_~x1~0_97, ~f~0.offset=v_~f~0.offset_147} OutVars{thread1Thread1of1ForFork0_#t~post2#1=|v_thread1Thread1of1ForFork0_#t~post2#1_49|, thread1Thread1of1ForFork0_#res#1.offset=|v_thread1Thread1of1ForFork0_#res#1.offset_21|, ~size~0=v_~size~0_133, ~f~0.base=v_~f~0.base_147, ~x1~0=v_~x1~0_96, ~f~0.offset=v_~f~0.offset_147, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_77|, #memory_int=|v_#memory_int_183|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_59|, ~n~0=v_~n~0_119, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_57|, thread1Thread1of1ForFork0_#res#1.base=|v_thread1Thread1of1ForFork0_#res#1.base_21|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#res#1.offset, thread1Thread1of1ForFork0_~i~0#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, ~x1~0, thread1Thread1of1ForFork0_#t~mem1#1, thread1Thread1of1ForFork0_#res#1.base] and [826] $Ultimate##0-->L59-2: Formula: (let ((.cse10 (select |v_#memory_int_243| v_~f~0.base_195))) (let ((.cse13 (select .cse10 (+ v_~f~0.offset_197 (* v_~x2~0_380 4))))) (let ((.cse3 (select .cse10 (+ v_~f~0.offset_197 (* .cse13 4))))) (let ((.cse1 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse3))))) (let ((.cse11 (select .cse10 (+ v_~f~0.offset_197 (* .cse1 4))))) (let ((.cse8 (select .cse10 (+ v_~f~0.offset_197 (* .cse11 4))))) (let ((.cse4 (select .cse10 (+ v_~f~0.offset_197 (* .cse8 4))))) (let ((.cse2 (select .cse10 (+ v_~f~0.offset_197 (* .cse4 4))))) (let ((.cse7 (select .cse10 (+ v_~f~0.offset_197 (* .cse2 4))))) (let ((.cse0 (select .cse10 (+ v_~f~0.offset_197 (* .cse7 4))))) (let ((.cse9 (select .cse10 (+ (* 4 .cse0) v_~f~0.offset_197)))) (let ((.cse12 (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse9))))) (let ((.cse14 (select .cse10 (+ v_~f~0.offset_197 (* .cse12 4))))) (let ((.cse6 (select .cse10 (+ v_~f~0.offset_197 (* .cse14 4))))) (let ((.cse5 (select .cse10 (+ v_~f~0.offset_197 (* .cse6 4))))) (and (= |v_thread2Thread1of1ForFork1_~i~1#1_301| 15) (not (= (ite (and (<= 0 v_~x2~0_380) (< v_~x2~0_380 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse0 v_~size~0_181) (<= 0 .cse0)) 1 0) 0)) (not (= 0 (ite (and (< .cse1 v_~size~0_181) (<= 0 .cse1)) 1 0))) (not (= (ite (and (< .cse2 v_~size~0_181) (<= 0 .cse2)) 1 0) 0)) (not (= (ite (and (< .cse3 v_~size~0_181) (<= 0 .cse3)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|) (not (= (ite (and (< .cse4 v_~size~0_181) (<= 0 .cse4)) 1 0) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245| (ite (and (<= 0 .cse5) (< .cse5 v_~size~0_181)) 1 0)) (not (= (ite (and (< .cse6 v_~size~0_181) (<= 0 .cse6)) 1 0) 0)) (not (= (ite (and (<= 0 .cse7) (< .cse7 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (<= 0 .cse8) (< .cse8 v_~size~0_181)) 1 0) 0)) (not (= (ite (and (< .cse9 v_~size~0_181) (<= 0 .cse9)) 1 0) 0)) (= (select .cse10 (+ v_~f~0.offset_197 (* 4 .cse5))) v_~x2~0_378) (not (= (ite (and (< .cse11 v_~size~0_181) (<= 0 .cse11)) 1 0) 0)) (not (= (ite (and (< .cse12 v_~size~0_181) (<= 0 .cse12)) 1 0) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283| 0)) (not (= (ite (and (< .cse13 v_~size~0_181) (<= 0 .cse13)) 1 0) 0)) (< (mod (+ |v_thread2Thread1of1ForFork1_~i~1#1_301| 4294967293) 4294967296) (mod (+ 4294967294 v_~n~0_165) 4294967296)) (not (= (ite (and (< .cse14 v_~size~0_181) (<= 0 .cse14)) 1 0) 0)))))))))))))))))) InVars {~x2~0=v_~x2~0_380, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, #memory_int=|v_#memory_int_243|, ~n~0=v_~n~0_165, ~f~0.offset=v_~f~0.offset_197} OutVars{~x2~0=v_~x2~0_378, thread2Thread1of1ForFork1_#t~post4#1=|v_thread2Thread1of1ForFork1_#t~post4#1_105|, ~size~0=v_~size~0_181, ~f~0.base=v_~f~0.base_195, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_115|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_245|, thread2Thread1of1ForFork1_~i~1#1=|v_thread2Thread1of1ForFork1_~i~1#1_301|, ~f~0.offset=v_~f~0.offset_197, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_283|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_103|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_97|, #memory_int=|v_#memory_int_243|, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_115|, ~n~0=v_~n~0_165, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_119|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, ~x2~0, thread2Thread1of1ForFork1_#t~post4#1, thread2Thread1of1ForFork1_#t~mem7#1, thread2Thread1of1ForFork1_#t~mem3#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_~i~1#1, thread2Thread1of1ForFork1_#t~post6#1] [2022-12-06 05:47:45,845 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:47:45,846 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3186 [2022-12-06 05:47:45,846 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 434 flow [2022-12-06 05:47:45,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:47:45,846 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:47:45,846 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:47:45,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:47:45,846 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:47:45,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:47:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1109907251, now seen corresponding path program 1 times [2022-12-06 05:47:45,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:47:45,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729306254] [2022-12-06 05:47:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:47:45,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:47:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:47:45,933 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-06 05:47:45,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:47:45,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729306254] [2022-12-06 05:47:45,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729306254] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:47:45,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:47:45,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:47:45,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412313282] [2022-12-06 05:47:45,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:47:45,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:47:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:47:45,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:47:45,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:47:45,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 05:47:45,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:47:45,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:47:45,935 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 05:47:45,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:47:46,082 INFO L130 PetriNetUnfolder]: 349/755 cut-off events. [2022-12-06 05:47:46,083 INFO L131 PetriNetUnfolder]: For 3700/3700 co-relation queries the response was YES. [2022-12-06 05:47:46,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3175 conditions, 755 events. 349/755 cut-off events. For 3700/3700 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4241 event pairs, 224 based on Foata normal form. 8/762 useless extension candidates. Maximal degree in co-relation 2824. Up to 746 conditions per place. [2022-12-06 05:47:46,087 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 43 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2022-12-06 05:47:46,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 499 flow [2022-12-06 05:47:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:47:46,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:47:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:47:46,088 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2022-12-06 05:47:46,088 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 434 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:47:46,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 499 flow [2022-12-06 05:47:46,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 481 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:47:46,095 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 380 flow [2022-12-06 05:47:46,095 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-06 05:47:46,096 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 05:47:46,096 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:47:46,096 INFO L89 Accepts]: Start accepts. Operand has 56 places, 43 transitions, 380 flow [2022-12-06 05:47:46,096 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:47:46,096 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:47:46,096 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 380 flow [2022-12-06 05:47:46,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 380 flow [2022-12-06 05:47:46,116 INFO L130 PetriNetUnfolder]: 38/265 cut-off events. [2022-12-06 05:47:46,116 INFO L131 PetriNetUnfolder]: For 872/929 co-relation queries the response was YES. [2022-12-06 05:47:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 265 events. 38/265 cut-off events. For 872/929 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1925 event pairs, 1 based on Foata normal form. 9/266 useless extension candidates. Maximal degree in co-relation 690. Up to 85 conditions per place. [2022-12-06 05:47:46,118 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 43 transitions, 380 flow [2022-12-06 05:47:46,118 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 05:48:03,896 WARN L233 SmtUtils]: Spent 5.60s on a formula simplification. DAG size of input: 445 DAG size of output: 440 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:48:07,404 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:07,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21309 [2022-12-06 05:48:07,405 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 383 flow [2022-12-06 05:48:07,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:07,405 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:07,405 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:07,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:48:07,405 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:07,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:07,406 INFO L85 PathProgramCache]: Analyzing trace with hash -79852461, now seen corresponding path program 1 times [2022-12-06 05:48:07,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:07,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076309723] [2022-12-06 05:48:07,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:07,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:07,498 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-06 05:48:07,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:07,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076309723] [2022-12-06 05:48:07,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076309723] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:07,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:07,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:48:07,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803403338] [2022-12-06 05:48:07,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:07,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:48:07,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:07,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:48:07,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:48:07,500 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:48:07,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:07,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:07,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:48:07,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:07,678 INFO L130 PetriNetUnfolder]: 340/732 cut-off events. [2022-12-06 05:48:07,679 INFO L131 PetriNetUnfolder]: For 4080/4080 co-relation queries the response was YES. [2022-12-06 05:48:07,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 732 events. 340/732 cut-off events. For 4080/4080 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4065 event pairs, 215 based on Foata normal form. 8/739 useless extension candidates. Maximal degree in co-relation 2949. Up to 723 conditions per place. [2022-12-06 05:48:07,684 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:48:07,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 492 flow [2022-12-06 05:48:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:48:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:48:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:48:07,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:48:07,686 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 383 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:48:07,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 492 flow [2022-12-06 05:48:07,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 458 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:07,696 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 374 flow [2022-12-06 05:48:07,696 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-06 05:48:07,696 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:48:07,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:07,697 INFO L89 Accepts]: Start accepts. Operand has 54 places, 43 transitions, 374 flow [2022-12-06 05:48:07,697 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:07,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:07,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 374 flow [2022-12-06 05:48:07,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 374 flow [2022-12-06 05:48:07,725 INFO L130 PetriNetUnfolder]: 38/265 cut-off events. [2022-12-06 05:48:07,725 INFO L131 PetriNetUnfolder]: For 815/872 co-relation queries the response was YES. [2022-12-06 05:48:07,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 265 events. 38/265 cut-off events. For 815/872 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1933 event pairs, 1 based on Foata normal form. 9/267 useless extension candidates. Maximal degree in co-relation 672. Up to 85 conditions per place. [2022-12-06 05:48:07,727 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 374 flow [2022-12-06 05:48:07,727 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 05:48:24,284 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 370 DAG size of output: 365 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:48:30,133 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:30,134 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22438 [2022-12-06 05:48:30,134 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 375 flow [2022-12-06 05:48:30,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:30,134 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:30,135 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:30,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 05:48:30,135 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:30,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash -957615367, now seen corresponding path program 1 times [2022-12-06 05:48:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:30,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455025605] [2022-12-06 05:48:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:30,218 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-06 05:48:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:30,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455025605] [2022-12-06 05:48:30,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455025605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:30,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:30,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:48:30,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957502920] [2022-12-06 05:48:30,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:30,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:48:30,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:30,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:48:30,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:48:30,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:48:30,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:48:30,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:30,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:48:30,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:30,487 INFO L130 PetriNetUnfolder]: 330/690 cut-off events. [2022-12-06 05:48:30,487 INFO L131 PetriNetUnfolder]: For 3383/3383 co-relation queries the response was YES. [2022-12-06 05:48:30,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2934 conditions, 690 events. 330/690 cut-off events. For 3383/3383 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3680 event pairs, 163 based on Foata normal form. 8/697 useless extension candidates. Maximal degree in co-relation 2743. Up to 563 conditions per place. [2022-12-06 05:48:30,494 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 55 selfloop transitions, 4 changer transitions 2/61 dead transitions. [2022-12-06 05:48:30,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 601 flow [2022-12-06 05:48:30,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:48:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:48:30,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:48:30,495 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41379310344827586 [2022-12-06 05:48:30,495 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 375 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:48:30,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 601 flow [2022-12-06 05:48:30,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 575 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 05:48:30,504 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 365 flow [2022-12-06 05:48:30,504 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-06 05:48:30,505 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 05:48:30,505 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:30,505 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 365 flow [2022-12-06 05:48:30,506 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:30,506 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:30,506 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 365 flow [2022-12-06 05:48:30,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 365 flow [2022-12-06 05:48:30,524 INFO L130 PetriNetUnfolder]: 38/234 cut-off events. [2022-12-06 05:48:30,525 INFO L131 PetriNetUnfolder]: For 749/804 co-relation queries the response was YES. [2022-12-06 05:48:30,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 234 events. 38/234 cut-off events. For 749/804 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1555 event pairs, 1 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 570. Up to 78 conditions per place. [2022-12-06 05:48:30,526 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 365 flow [2022-12-06 05:48:30,526 INFO L188 LiptonReduction]: Number of co-enabled transitions 178 [2022-12-06 05:48:30,527 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:48:30,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:48:30,528 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 365 flow [2022-12-06 05:48:30,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:48:30,528 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:30,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:30,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:48:30,528 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:30,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -824805033, now seen corresponding path program 1 times [2022-12-06 05:48:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:30,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867237745] [2022-12-06 05:48:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:30,616 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-06 05:48:30,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867237745] [2022-12-06 05:48:30,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867237745] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:30,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:30,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:48:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282707578] [2022-12-06 05:48:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:48:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:48:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:48:30,617 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:48:30,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:30,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:30,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:48:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:30,759 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 05:48:30,759 INFO L131 PetriNetUnfolder]: For 3529/3529 co-relation queries the response was YES. [2022-12-06 05:48:30,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 689 events. 333/689 cut-off events. For 3529/3529 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3597 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2551. Up to 680 conditions per place. [2022-12-06 05:48:30,763 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:48:30,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 470 flow [2022-12-06 05:48:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:48:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:48:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:48:30,763 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:48:30,763 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 365 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:48:30,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 470 flow [2022-12-06 05:48:30,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 05:48:30,768 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:30,768 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:48:30,768 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:48:30,768 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:30,768 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:30,769 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:30,769 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:30,769 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:30,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:30,786 INFO L130 PetriNetUnfolder]: 38/238 cut-off events. [2022-12-06 05:48:30,787 INFO L131 PetriNetUnfolder]: For 672/727 co-relation queries the response was YES. [2022-12-06 05:48:30,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 238 events. 38/238 cut-off events. For 672/727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1605 event pairs, 1 based on Foata normal form. 8/238 useless extension candidates. Maximal degree in co-relation 606. Up to 78 conditions per place. [2022-12-06 05:48:30,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:30,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:48:36,891 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 397 DAG size of output: 392 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:48:54,834 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 517 DAG size of output: 512 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:48:58,067 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:48:58,068 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27300 [2022-12-06 05:48:58,068 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 05:48:58,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:58,068 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:48:58,068 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:48:58,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:48:58,068 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:48:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:48:58,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1569757605, now seen corresponding path program 1 times [2022-12-06 05:48:58,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:48:58,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735159804] [2022-12-06 05:48:58,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:48:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:48:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:48:58,163 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-06 05:48:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:48:58,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735159804] [2022-12-06 05:48:58,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735159804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:48:58,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:48:58,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:48:58,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652747702] [2022-12-06 05:48:58,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:48:58,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:48:58,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:48:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:48:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:48:58,164 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:48:58,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:48:58,165 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:48:58,165 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:48:58,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:48:58,300 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 05:48:58,301 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 05:48:58,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3601 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 05:48:58,304 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:48:58,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 05:48:58,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:48:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:48:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:48:58,311 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:48:58,312 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:48:58,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 05:48:58,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:48:58,316 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:58,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:48:58,316 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:48:58,316 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:48:58,316 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:58,316 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:48:58,316 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:48:58,316 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:58,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:58,334 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 05:48:58,335 INFO L131 PetriNetUnfolder]: For 689/744 co-relation queries the response was YES. [2022-12-06 05:48:58,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 689/744 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1587 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 05:48:58,336 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:48:58,336 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:49:08,228 WARN L233 SmtUtils]: Spent 9.88s on a formula simplification. DAG size of input: 424 DAG size of output: 419 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:49:18,535 WARN L233 SmtUtils]: Spent 9.04s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:49:27,859 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 424 DAG size of output: 419 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:49:35,862 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 553 DAG size of output: 548 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:49:38,626 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:49:38,626 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40310 [2022-12-06 05:49:38,626 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 05:49:38,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:49:38,627 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:49:38,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:49:38,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:49:38,627 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:49:38,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:49:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1444537373, now seen corresponding path program 1 times [2022-12-06 05:49:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:49:38,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190741434] [2022-12-06 05:49:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:49:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:49:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:49:38,723 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-06 05:49:38,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:49:38,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190741434] [2022-12-06 05:49:38,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190741434] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:49:38,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:49:38,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:49:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24712432] [2022-12-06 05:49:38,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:49:38,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:49:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:49:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:49:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:49:38,725 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:49:38,725 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:49:38,725 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:49:38,725 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:49:38,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:49:38,862 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 05:49:38,862 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 05:49:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3602 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 05:49:38,865 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:49:38,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 05:49:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:49:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:49:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:49:38,866 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:49:38,866 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:49:38,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 05:49:38,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:49:38,870 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 05:49:38,870 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:49:38,871 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:49:38,872 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:49:38,872 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:49:38,872 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:49:38,872 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:49:38,872 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:49:38,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:49:38,890 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 05:49:38,890 INFO L131 PetriNetUnfolder]: For 682/737 co-relation queries the response was YES. [2022-12-06 05:49:38,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 682/737 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1595 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 05:49:38,892 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:49:38,892 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:49:44,238 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 451 DAG size of output: 446 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:49:54,364 WARN L233 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:50:00,333 WARN L233 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 574 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:50:15,058 WARN L233 SmtUtils]: Spent 10.56s on a formula simplification. DAG size of input: 589 DAG size of output: 584 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:50:18,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:50:18,020 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 39148 [2022-12-06 05:50:18,020 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 05:50:18,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:50:18,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:50:18,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:50:18,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:50:18,020 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:50:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:50:18,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1330020769, now seen corresponding path program 1 times [2022-12-06 05:50:18,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:50:18,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610872165] [2022-12-06 05:50:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:50:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:50:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:50:18,150 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-06 05:50:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:50:18,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610872165] [2022-12-06 05:50:18,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610872165] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:50:18,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:50:18,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:50:18,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357634042] [2022-12-06 05:50:18,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:50:18,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:50:18,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:50:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:50:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:50:18,152 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:50:18,152 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:50:18,152 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:50:18,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:50:18,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:50:18,298 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 05:50:18,299 INFO L131 PetriNetUnfolder]: For 3066/3066 co-relation queries the response was YES. [2022-12-06 05:50:18,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3066/3066 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3595 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2617. Up to 680 conditions per place. [2022-12-06 05:50:18,301 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:50:18,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 05:50:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:50:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:50:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:50:18,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:50:18,302 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:50:18,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 05:50:18,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:50:18,306 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 05:50:18,306 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:50:18,306 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:50:18,306 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:50:18,307 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:50:18,307 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:50:18,307 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:50:18,307 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:50:18,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:50:18,325 INFO L130 PetriNetUnfolder]: 38/236 cut-off events. [2022-12-06 05:50:18,325 INFO L131 PetriNetUnfolder]: For 668/723 co-relation queries the response was YES. [2022-12-06 05:50:18,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 236 events. 38/236 cut-off events. For 668/723 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1589 event pairs, 1 based on Foata normal form. 8/237 useless extension candidates. Maximal degree in co-relation 592. Up to 78 conditions per place. [2022-12-06 05:50:18,326 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:50:18,326 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:50:27,043 WARN L233 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:50:35,262 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 463 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:50:54,942 WARN L233 SmtUtils]: Spent 19.68s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:00,375 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 610 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:10,909 WARN L233 SmtUtils]: Spent 10.53s on a formula simplification. DAG size of input: 478 DAG size of output: 473 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:18,208 WARN L233 SmtUtils]: Spent 7.29s on a formula simplification that was a NOOP. DAG size: 463 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:28,900 WARN L233 SmtUtils]: Spent 10.69s on a formula simplification. DAG size of input: 625 DAG size of output: 620 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:33,333 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:51:33,334 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75028 [2022-12-06 05:51:33,334 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 05:51:33,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:51:33,334 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:51:33,334 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:51:33,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:51:33,334 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:51:33,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:51:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1215504165, now seen corresponding path program 1 times [2022-12-06 05:51:33,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:51:33,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080770483] [2022-12-06 05:51:33,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:51:33,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:51:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:51:33,505 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-06 05:51:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:51:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080770483] [2022-12-06 05:51:33,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080770483] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:51:33,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:51:33,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:51:33,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258537260] [2022-12-06 05:51:33,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:51:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:51:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:51:33,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:51:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:51:33,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:51:33,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:51:33,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:51:33,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:51:33,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:51:33,675 INFO L130 PetriNetUnfolder]: 333/689 cut-off events. [2022-12-06 05:51:33,675 INFO L131 PetriNetUnfolder]: For 3067/3067 co-relation queries the response was YES. [2022-12-06 05:51:33,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 689 events. 333/689 cut-off events. For 3067/3067 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3602 event pairs, 208 based on Foata normal form. 8/696 useless extension candidates. Maximal degree in co-relation 2682. Up to 680 conditions per place. [2022-12-06 05:51:33,678 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 43 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2022-12-06 05:51:33,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 46 transitions, 476 flow [2022-12-06 05:51:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:51:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:51:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:51:33,679 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:51:33,679 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:51:33,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 46 transitions, 476 flow [2022-12-06 05:51:33,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 452 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:51:33,683 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 368 flow [2022-12-06 05:51:33,684 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-12-06 05:51:33,684 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2022-12-06 05:51:33,684 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:51:33,684 INFO L89 Accepts]: Start accepts. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:51:33,684 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:51:33,684 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:51:33,685 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:51:33,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 368 flow [2022-12-06 05:51:33,705 INFO L130 PetriNetUnfolder]: 38/238 cut-off events. [2022-12-06 05:51:33,705 INFO L131 PetriNetUnfolder]: For 672/727 co-relation queries the response was YES. [2022-12-06 05:51:33,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 238 events. 38/238 cut-off events. For 672/727 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1607 event pairs, 1 based on Foata normal form. 8/239 useless extension candidates. Maximal degree in co-relation 607. Up to 78 conditions per place. [2022-12-06 05:51:33,707 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 43 transitions, 368 flow [2022-12-06 05:51:33,707 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 05:51:39,171 WARN L233 SmtUtils]: Spent 5.45s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:51:48,278 WARN L233 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:52:18,657 WARN L233 SmtUtils]: Spent 30.38s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:52:24,208 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:52:38,831 WARN L233 SmtUtils]: Spent 14.62s on a formula simplification. DAG size of input: 505 DAG size of output: 500 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:52:49,985 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification that was a NOOP. DAG size: 490 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:53:04,829 WARN L233 SmtUtils]: Spent 14.84s on a formula simplification. DAG size of input: 661 DAG size of output: 656 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:53:13,067 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 646 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:53:13,070 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:53:13,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 99386 [2022-12-06 05:53:13,070 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 369 flow [2022-12-06 05:53:13,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:53:13,070 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:13,070 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:13,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:53:13,070 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:53:13,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -760576519, now seen corresponding path program 1 times [2022-12-06 05:53:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:13,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422716628] [2022-12-06 05:53:13,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:13,151 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-06 05:53:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:53:13,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422716628] [2022-12-06 05:53:13,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422716628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:53:13,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:53:13,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:53:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691530045] [2022-12-06 05:53:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:53:13,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:53:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:53:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:53:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:53:13,153 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:53:13,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:53:13,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:53:13,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:53:13,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:13,365 INFO L130 PetriNetUnfolder]: 339/703 cut-off events. [2022-12-06 05:53:13,365 INFO L131 PetriNetUnfolder]: For 3140/3140 co-relation queries the response was YES. [2022-12-06 05:53:13,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 703 events. 339/703 cut-off events. For 3140/3140 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3736 event pairs, 183 based on Foata normal form. 16/718 useless extension candidates. Maximal degree in co-relation 2721. Up to 621 conditions per place. [2022-12-06 05:53:13,369 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 47 selfloop transitions, 9 changer transitions 5/61 dead transitions. [2022-12-06 05:53:13,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 601 flow [2022-12-06 05:53:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:53:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:53:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 05:53:13,370 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32413793103448274 [2022-12-06 05:53:13,370 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 369 flow. Second operand 5 states and 47 transitions. [2022-12-06 05:53:13,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 601 flow [2022-12-06 05:53:13,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 573 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-06 05:53:13,378 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 415 flow [2022-12-06 05:53:13,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-06 05:53:13,378 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 35 predicate places. [2022-12-06 05:53:13,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:13,378 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 415 flow [2022-12-06 05:53:13,378 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:13,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:13,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 415 flow [2022-12-06 05:53:13,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 415 flow [2022-12-06 05:53:13,403 INFO L130 PetriNetUnfolder]: 38/233 cut-off events. [2022-12-06 05:53:13,404 INFO L131 PetriNetUnfolder]: For 740/793 co-relation queries the response was YES. [2022-12-06 05:53:13,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 233 events. 38/233 cut-off events. For 740/793 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1552 event pairs, 1 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 592. Up to 77 conditions per place. [2022-12-06 05:53:13,405 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 415 flow [2022-12-06 05:53:13,405 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:53:14,478 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:53:14,479 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1101 [2022-12-06 05:53:14,479 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 415 flow [2022-12-06 05:53:14,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:53:14,479 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:53:14,479 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:53:14,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:53:14,479 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:53:14,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:53:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1158245863, now seen corresponding path program 1 times [2022-12-06 05:53:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:53:14,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425654992] [2022-12-06 05:53:14,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:53:14,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:53:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:53:14,574 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-06 05:53:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:53:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425654992] [2022-12-06 05:53:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425654992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:53:14,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:53:14,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:53:14,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650438984] [2022-12-06 05:53:14,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:53:14,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:53:14,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:53:14,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:53:14,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:53:14,575 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:53:14,575 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 415 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:53:14,575 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:53:14,575 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:53:14,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:53:14,719 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 05:53:14,720 INFO L131 PetriNetUnfolder]: For 3460/3460 co-relation queries the response was YES. [2022-12-06 05:53:14,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 674 events. 330/674 cut-off events. For 3460/3460 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3449 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2597. Up to 665 conditions per place. [2022-12-06 05:53:14,722 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:53:14,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 526 flow [2022-12-06 05:53:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:53:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:53:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:53:14,723 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:53:14,723 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 415 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:53:14,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 526 flow [2022-12-06 05:53:14,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 472 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 05:53:14,728 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 384 flow [2022-12-06 05:53:14,728 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 05:53:14,729 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 05:53:14,729 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:53:14,729 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 384 flow [2022-12-06 05:53:14,729 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:53:14,729 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:53:14,729 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 384 flow [2022-12-06 05:53:14,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 384 flow [2022-12-06 05:53:14,747 INFO L130 PetriNetUnfolder]: 38/227 cut-off events. [2022-12-06 05:53:14,747 INFO L131 PetriNetUnfolder]: For 675/729 co-relation queries the response was YES. [2022-12-06 05:53:14,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 227 events. 38/227 cut-off events. For 675/729 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1479 event pairs, 1 based on Foata normal form. 7/226 useless extension candidates. Maximal degree in co-relation 568. Up to 77 conditions per place. [2022-12-06 05:53:14,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 384 flow [2022-12-06 05:53:14,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:53:31,029 WARN L233 SmtUtils]: Spent 16.27s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:53:37,766 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:53:49,458 WARN L233 SmtUtils]: Spent 11.69s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:00,172 WARN L233 SmtUtils]: Spent 10.71s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:12,616 WARN L233 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 532 DAG size of output: 527 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:27,006 WARN L233 SmtUtils]: Spent 14.38s on a formula simplification that was a NOOP. DAG size: 517 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:46,757 WARN L233 SmtUtils]: Spent 19.75s on a formula simplification. DAG size of input: 697 DAG size of output: 692 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:55,271 WARN L233 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 682 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:54:55,273 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:54:55,273 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 100544 [2022-12-06 05:54:55,274 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 385 flow [2022-12-06 05:54:55,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:54:55,274 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:54:55,274 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:54:55,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-06 05:54:55,274 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:54:55,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:54:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash -167906439, now seen corresponding path program 1 times [2022-12-06 05:54:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:54:55,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437570822] [2022-12-06 05:54:55,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:54:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:54:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:54:55,384 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-06 05:54:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:54:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437570822] [2022-12-06 05:54:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437570822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:54:55,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:54:55,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:54:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344859299] [2022-12-06 05:54:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:54:55,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:54:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:54:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:54:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:54:55,385 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:54:55,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:54:55,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:54:55,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:54:55,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:54:55,528 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 05:54:55,528 INFO L131 PetriNetUnfolder]: For 3162/3162 co-relation queries the response was YES. [2022-12-06 05:54:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 674 events. 330/674 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3459 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2667. Up to 665 conditions per place. [2022-12-06 05:54:55,530 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:54:55,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 496 flow [2022-12-06 05:54:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:54:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:54:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:54:55,531 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:54:55,531 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 385 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:54:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 496 flow [2022-12-06 05:54:55,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:54:55,535 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 05:54:55,535 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:54:55,535 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:54:55,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:54:55,535 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:54:55,535 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:54:55,535 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:54:55,535 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:54:55,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:54:55,553 INFO L130 PetriNetUnfolder]: 38/231 cut-off events. [2022-12-06 05:54:55,554 INFO L131 PetriNetUnfolder]: For 682/736 co-relation queries the response was YES. [2022-12-06 05:54:55,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 231 events. 38/231 cut-off events. For 682/736 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1542 event pairs, 1 based on Foata normal form. 7/230 useless extension candidates. Maximal degree in co-relation 594. Up to 77 conditions per place. [2022-12-06 05:54:55,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:54:55,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:55:06,827 WARN L233 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:55:27,986 WARN L233 SmtUtils]: Spent 18.62s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:55:45,826 WARN L233 SmtUtils]: Spent 17.83s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:56:00,706 WARN L233 SmtUtils]: Spent 14.88s on a formula simplification. DAG size of input: 559 DAG size of output: 554 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:56:08,111 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification that was a NOOP. DAG size: 544 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:56:49,694 WARN L233 SmtUtils]: Spent 41.58s on a formula simplification. DAG size of input: 733 DAG size of output: 728 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:57:00,611 WARN L233 SmtUtils]: Spent 10.91s on a formula simplification that was a NOOP. DAG size: 718 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:57:00,613 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:57:00,613 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 125078 [2022-12-06 05:57:00,613 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 383 flow [2022-12-06 05:57:00,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:57:00,613 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:00,613 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:00,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-06 05:57:00,614 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:57:00,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:00,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1417579526, now seen corresponding path program 1 times [2022-12-06 05:57:00,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:00,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869627981] [2022-12-06 05:57:00,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:00,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:00,698 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-06 05:57:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:57:00,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869627981] [2022-12-06 05:57:00,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869627981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:57:00,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:57:00,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:57:00,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259859868] [2022-12-06 05:57:00,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:57:00,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:57:00,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:57:00,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:57:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:57:00,699 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:57:00,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 383 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:57:00,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:57:00,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:57:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:57:00,894 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 05:57:00,894 INFO L131 PetriNetUnfolder]: For 3137/3137 co-relation queries the response was YES. [2022-12-06 05:57:00,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 674 events. 330/674 cut-off events. For 3137/3137 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3522 event pairs, 183 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2593. Up to 617 conditions per place. [2022-12-06 05:57:00,896 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 47 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2022-12-06 05:57:00,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 552 flow [2022-12-06 05:57:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:57:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:57:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 05:57:00,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2022-12-06 05:57:00,897 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 383 flow. Second operand 4 states and 42 transitions. [2022-12-06 05:57:00,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 552 flow [2022-12-06 05:57:00,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 528 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:57:00,901 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 392 flow [2022-12-06 05:57:00,901 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=392, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 05:57:00,901 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 34 predicate places. [2022-12-06 05:57:00,902 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:57:00,902 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 392 flow [2022-12-06 05:57:00,902 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:57:00,902 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:57:00,902 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 392 flow [2022-12-06 05:57:00,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 392 flow [2022-12-06 05:57:00,920 INFO L130 PetriNetUnfolder]: 38/227 cut-off events. [2022-12-06 05:57:00,920 INFO L131 PetriNetUnfolder]: For 679/733 co-relation queries the response was YES. [2022-12-06 05:57:00,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 227 events. 38/227 cut-off events. For 679/733 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1491 event pairs, 1 based on Foata normal form. 7/226 useless extension candidates. Maximal degree in co-relation 550. Up to 77 conditions per place. [2022-12-06 05:57:00,921 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 392 flow [2022-12-06 05:57:00,921 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:57:02,566 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:57:02,567 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1665 [2022-12-06 05:57:02,567 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 393 flow [2022-12-06 05:57:02,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-06 05:57:02,567 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:57:02,567 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:57:02,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:57:02,567 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:57:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:57:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -714450951, now seen corresponding path program 1 times [2022-12-06 05:57:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:57:02,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676159398] [2022-12-06 05:57:02,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:57:02,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:57:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:57:02,684 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-06 05:57:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:57:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676159398] [2022-12-06 05:57:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676159398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:57:02,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:57:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:57:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310032569] [2022-12-06 05:57:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:57:02,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:57:02,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:57:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:57:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:57:02,686 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:57:02,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:57:02,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:57:02,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:57:02,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:57:02,829 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 05:57:02,829 INFO L131 PetriNetUnfolder]: For 3287/3287 co-relation queries the response was YES. [2022-12-06 05:57:02,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 674 events. 330/674 cut-off events. For 3287/3287 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3456 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2487. Up to 665 conditions per place. [2022-12-06 05:57:02,831 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:57:02,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 48 transitions, 504 flow [2022-12-06 05:57:02,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:57:02,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:57:02,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:57:02,832 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:57:02,832 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 393 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:57:02,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 48 transitions, 504 flow [2022-12-06 05:57:02,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 9 selfloop flow, removed 3 redundant places. [2022-12-06 05:57:02,835 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 05:57:02,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:57:02,836 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:57:02,836 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:57:02,836 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:57:02,836 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:57:02,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:57:02,836 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:57:02,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:57:02,854 INFO L130 PetriNetUnfolder]: 38/229 cut-off events. [2022-12-06 05:57:02,855 INFO L131 PetriNetUnfolder]: For 670/724 co-relation queries the response was YES. [2022-12-06 05:57:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 229 events. 38/229 cut-off events. For 670/724 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1516 event pairs, 1 based on Foata normal form. 7/228 useless extension candidates. Maximal degree in co-relation 579. Up to 77 conditions per place. [2022-12-06 05:57:02,855 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:57:02,856 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 05:57:35,303 WARN L233 SmtUtils]: Spent 32.44s on a formula simplification. DAG size of input: 586 DAG size of output: 581 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:57:50,983 WARN L233 SmtUtils]: Spent 15.67s on a formula simplification that was a NOOP. DAG size: 571 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:58:19,800 WARN L233 SmtUtils]: Spent 28.81s on a formula simplification. DAG size of input: 769 DAG size of output: 764 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:58:37,221 WARN L233 SmtUtils]: Spent 17.41s on a formula simplification that was a NOOP. DAG size: 754 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:58:50,497 WARN L233 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 586 DAG size of output: 581 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:58:56,022 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 571 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:59:36,921 WARN L233 SmtUtils]: Spent 40.90s on a formula simplification. DAG size of input: 769 DAG size of output: 764 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:59:42,746 WARN L233 SmtUtils]: Spent 5.82s on a formula simplification that was a NOOP. DAG size: 754 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 05:59:42,748 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:59:42,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 159913 [2022-12-06 05:59:42,749 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 383 flow [2022-12-06 05:59:42,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:59:42,749 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:59:42,749 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:59:42,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:59:42,749 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:59:42,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:59:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1892203141, now seen corresponding path program 1 times [2022-12-06 05:59:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:59:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895734131] [2022-12-06 05:59:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:59:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:59:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:59:42,856 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-06 05:59:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:59:42,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895734131] [2022-12-06 05:59:42,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895734131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:59:42,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:59:42,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:59:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613501859] [2022-12-06 05:59:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:59:42,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:59:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:59:42,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:59:42,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:59:42,857 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:59:42,858 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-06 05:59:42,858 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:59:42,858 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:59:42,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:59:42,998 INFO L130 PetriNetUnfolder]: 330/674 cut-off events. [2022-12-06 05:59:42,998 INFO L131 PetriNetUnfolder]: For 3126/3126 co-relation queries the response was YES. [2022-12-06 05:59:42,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 674 events. 330/674 cut-off events. For 3126/3126 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3459 event pairs, 205 based on Foata normal form. 8/681 useless extension candidates. Maximal degree in co-relation 2667. Up to 665 conditions per place. [2022-12-06 05:59:43,001 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 45 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2022-12-06 05:59:43,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 494 flow [2022-12-06 05:59:43,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:59:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:59:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:59:43,003 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2022-12-06 05:59:43,004 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 383 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:59:43,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 494 flow [2022-12-06 05:59:43,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 470 flow, removed 12 selfloop flow, removed 2 redundant places. [2022-12-06 05:59:43,007 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 382 flow [2022-12-06 05:59:43,007 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=382, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2022-12-06 05:59:43,008 INFO L294 CegarLoopForPetriNet]: 21 programPoint places, 33 predicate places. [2022-12-06 05:59:43,008 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:59:43,008 INFO L89 Accepts]: Start accepts. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:59:43,008 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:59:43,008 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:59:43,008 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:59:43,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 45 transitions, 382 flow [2022-12-06 05:59:43,026 INFO L130 PetriNetUnfolder]: 38/231 cut-off events. [2022-12-06 05:59:43,026 INFO L131 PetriNetUnfolder]: For 674/728 co-relation queries the response was YES. [2022-12-06 05:59:43,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 231 events. 38/231 cut-off events. For 674/728 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1540 event pairs, 1 based on Foata normal form. 7/230 useless extension candidates. Maximal degree in co-relation 594. Up to 77 conditions per place. [2022-12-06 05:59:43,027 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 45 transitions, 382 flow [2022-12-06 05:59:43,027 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 06:00:11,536 WARN L233 SmtUtils]: Spent 28.50s on a formula simplification. DAG size of input: 613 DAG size of output: 608 (called from [L 287] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-06 06:00:31,565 WARN L233 SmtUtils]: Spent 20.02s on a formula simplification that was a NOOP. DAG size: 598 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) Received shutdown request... [2022-12-06 06:01:06,796 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-06 06:01:06,808 WARN L249 SmtUtils]: Removed 38 from assertion stack [2022-12-06 06:01:06,809 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 06:01:06,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 06:01:06,809 WARN L619 AbstractCegarLoop]: Verification canceled: while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 805 for 35238ms.. [2022-12-06 06:01:06,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 06:01:06,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 06:01:06,811 INFO L458 BasicCegarLoop]: Path program histogram: [3, 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, 1, 1, 1, 1, 1, 1] [2022-12-06 06:01:06,814 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:01:06,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:01:06,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:01:06 BasicIcfg [2022-12-06 06:01:06,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:01:06,816 INFO L158 Benchmark]: Toolchain (without parser) took 856978.79ms. Allocated memory was 185.6MB in the beginning and 558.9MB in the end (delta: 373.3MB). Free memory was 161.0MB in the beginning and 291.7MB in the end (delta: -130.7MB). Peak memory consumption was 375.8MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,816 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:01:06,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.35ms. Allocated memory is still 185.6MB. Free memory was 160.5MB in the beginning and 149.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.43ms. Allocated memory is still 185.6MB. Free memory was 149.0MB in the beginning and 146.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,817 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 185.6MB. Free memory was 146.9MB in the beginning and 145.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,817 INFO L158 Benchmark]: RCFGBuilder took 399.25ms. Allocated memory is still 185.6MB. Free memory was 144.8MB in the beginning and 127.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,817 INFO L158 Benchmark]: TraceAbstraction took 856257.56ms. Allocated memory was 185.6MB in the beginning and 558.9MB in the end (delta: 373.3MB). Free memory was 126.4MB in the beginning and 291.7MB in the end (delta: -165.3MB). Peak memory consumption was 341.2MB. Max. memory is 8.0GB. [2022-12-06 06:01:06,818 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.10ms. Allocated memory is still 185.6MB. Free memory is still 162.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.35ms. Allocated memory is still 185.6MB. Free memory was 160.5MB in the beginning and 149.0MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.43ms. Allocated memory is still 185.6MB. Free memory was 149.0MB in the beginning and 146.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 185.6MB. Free memory was 146.9MB in the beginning and 145.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 399.25ms. Allocated memory is still 185.6MB. Free memory was 144.8MB in the beginning and 127.5MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 856257.56ms. Allocated memory was 185.6MB in the beginning and 558.9MB in the end (delta: 373.3MB). Free memory was 126.4MB in the beginning and 291.7MB in the end (delta: -165.3MB). Peak memory consumption was 341.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 170 PlacesBefore, 21 PlacesAfterwards, 181 TransitionsBefore, 17 TransitionsAfterwards, 4092 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 85 ConcurrentYvCompositions, 13 ChoiceCompositions, 162 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 2766, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2768, independent: 2766, independent conditional: 0, independent unconditional: 2766, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2535, independent: 2533, independent conditional: 0, independent unconditional: 2533, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2768, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2535, unknown conditional: 0, unknown unconditional: 2535] , Statistics on independence cache: Total cache size (in pairs): 5095, Positive cache size: 5093, Positive conditional cache size: 0, Positive unconditional cache size: 5093, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.7s, 20 PlacesBefore, 19 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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, 24 PlacesBefore, 23 PlacesAfterwards, 21 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 15, independent: 15, independent conditional: 3, independent unconditional: 12, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 3, Positive unconditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 25 PlacesBefore, 25 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 17, Positive conditional cache size: 10, Positive unconditional cache size: 7, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 10, Positive unconditional cache size: 14, 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.4s, 26 PlacesBefore, 26 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 9, independent: 9, independent conditional: 3, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 9, unknown conditional: 3, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 13, Positive unconditional cache size: 21, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 16, independent conditional: 4, independent unconditional: 12, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 38, Positive conditional cache size: 15, Positive unconditional cache size: 23, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 43, Positive conditional cache size: 18, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 35 PlacesBefore, 34 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 46, Positive conditional cache size: 21, Positive unconditional cache size: 25, Negative cache size: 2, Negative conditional cache size: 1, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 37 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 9, dependent conditional: 3, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, independent: 26, independent conditional: 14, independent unconditional: 12, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 9, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 38, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 59, Positive conditional cache size: 31, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, 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.7s, 35 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 21, independent conditional: 9, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 62, Positive conditional cache size: 34, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 2, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.7s, 41 PlacesBefore, 41 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, 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: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 72, Positive conditional cache size: 44, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 42 PlacesBefore, 41 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 75, Positive conditional cache size: 47, Positive unconditional cache size: 28, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 82, Positive conditional cache size: 52, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 44 PlacesBefore, 43 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 85, Positive conditional cache size: 55, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 43 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 88, Positive conditional cache size: 58, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 49 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 91, Positive conditional cache size: 61, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 182 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): 96, Positive cache size: 91, Positive conditional cache size: 61, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, 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: 4.7s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 94, Positive conditional cache size: 64, Positive unconditional cache size: 30, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 101, Positive conditional cache size: 69, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 104, Positive conditional cache size: 72, Positive unconditional cache size: 32, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 111, Positive conditional cache size: 77, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6s, 53 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 114, Positive conditional cache size: 80, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 54 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 46 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 120, Positive conditional cache size: 86, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.3s, 55 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 123, Positive conditional cache size: 89, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.4s, 54 PlacesBefore, 53 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 176 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 126, Positive conditional cache size: 92, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 178 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): 131, Positive cache size: 126, Positive conditional cache size: 92, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, 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: 27.3s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 129, Positive conditional cache size: 95, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.3s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 132, Positive conditional cache size: 98, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 135, Positive conditional cache size: 101, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.0s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 138, Positive conditional cache size: 104, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 99.4s, 53 PlacesBefore, 52 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 141, Positive conditional cache size: 107, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, 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: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 144, Positive conditional cache size: 110, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.5s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 147, Positive conditional cache size: 113, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 125.1s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 150, Positive conditional cache size: 116, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 55 PlacesBefore, 54 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 153, Positive conditional cache size: 119, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.9s, 54 PlacesBefore, 53 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 156, Positive conditional cache size: 122, Positive unconditional cache size: 34, Negative cache size: 5, Negative conditional cache size: 4, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 805 for 35238ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 805 for 35238ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while TransFormulaUtils was doing sequential composition of 2 TransFormulas,while SimplifyDDAWithTimeout was simplifying term of DAG size 805 for 35238ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 260 locations, 3 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: 856.1s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 345 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2780 IncrementalHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 6 mSDtfsCounter, 2780 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=434occurred in iteration=23, InterpolantAutomatonStates: 132, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 438 NumberOfCodeBlocks, 438 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 2225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown