/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/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:14:29,126 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:14:29,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:14:29,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:14:29,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:14:29,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:14:29,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:14:29,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:14:29,201 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:14:29,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:14:29,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:14:29,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:14:29,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:14:29,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:14:29,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:14:29,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:14:29,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:14:29,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:14:29,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:14:29,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:14:29,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:14:29,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:14:29,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:14:29,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:14:29,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:14:29,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:14:29,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:14:29,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:14:29,237 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:14:29,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:14:29,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:14:29,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:14:29,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:14:29,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:14:29,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:14:29,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:14:29,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:14:29,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:14:29,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:14:29,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:14:29,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:14:29,245 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:14:29,275 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:14:29,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:14:29,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:14:29,276 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:14:29,277 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:14:29,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:14:29,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:14:29,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:14:29,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:14:29,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:14:29,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:14:29,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:14:29,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:14:29,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:14:29,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:14:29,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:14:29,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:14:29,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:14:29,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:14:29,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:14:29,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:14:29,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:29,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:14:29,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:14:29,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:14:29,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:14:29,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:14:29,285 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:14:29,285 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:14:29,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:14:29,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:14:29,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:14:29,639 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:14:29,639 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:14:29,640 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-06 05:14:30,725 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:14:30,921 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:14:30,922 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-06 05:14:30,928 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a76dfb9f/ae54d019cc29419eba490e70640e3475/FLAGe21f3c86f [2022-12-06 05:14:30,940 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a76dfb9f/ae54d019cc29419eba490e70640e3475 [2022-12-06 05:14:30,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:14:30,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:14:30,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:30,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:14:30,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:14:30,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:30" (1/1) ... [2022-12-06 05:14:30,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ad3e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:30, skipping insertion in model container [2022-12-06 05:14:30,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:30" (1/1) ... [2022-12-06 05:14:30,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:14:30,989 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:14:31,224 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/chl-word-subst.wvr.c[3345,3358] [2022-12-06 05:14:31,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:31,252 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:14:31,292 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/chl-word-subst.wvr.c[3345,3358] [2022-12-06 05:14:31,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:14:31,316 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:14:31,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31 WrapperNode [2022-12-06 05:14:31,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:14:31,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:31,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:14:31,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:14:31,325 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:14:31" (1/1) ... [2022-12-06 05:14:31,346 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:14:31" (1/1) ... [2022-12-06 05:14:31,381 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 176 [2022-12-06 05:14:31,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:14:31,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:14:31,383 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:14:31,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:14:31,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,423 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:14:31,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:14:31,428 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:14:31,428 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:14:31,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (1/1) ... [2022-12-06 05:14:31,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:14:31,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:14:31,465 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:14:31,491 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:14:31,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:14:31,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:14:31,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:14:31,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:14:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:14:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:14:31,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:14:31,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:14:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:14:31,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:14:31,514 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:14:31,633 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:14:31,635 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:14:32,061 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:14:32,072 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:14:32,072 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:14:32,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:32 BoogieIcfgContainer [2022-12-06 05:14:32,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:14:32,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:14:32,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:14:32,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:14:32,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:30" (1/3) ... [2022-12-06 05:14:32,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faba26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:32, skipping insertion in model container [2022-12-06 05:14:32,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:31" (2/3) ... [2022-12-06 05:14:32,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4faba26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:32, skipping insertion in model container [2022-12-06 05:14:32,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:32" (3/3) ... [2022-12-06 05:14:32,081 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2022-12-06 05:14:32,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:14:32,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:14:32,097 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:14:32,194 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:14:32,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 288 transitions, 600 flow [2022-12-06 05:14:32,378 INFO L130 PetriNetUnfolder]: 29/285 cut-off events. [2022-12-06 05:14:32,378 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:32,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 285 events. 29/285 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 05:14:32,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 288 transitions, 600 flow [2022-12-06 05:14:32,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 275 transitions, 568 flow [2022-12-06 05:14:32,404 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:32,419 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-06 05:14:32,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 275 transitions, 568 flow [2022-12-06 05:14:32,479 INFO L130 PetriNetUnfolder]: 29/275 cut-off events. [2022-12-06 05:14:32,480 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:32,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 275 events. 29/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 371 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-06 05:14:32,489 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-06 05:14:32,490 INFO L188 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-06 05:14:42,984 INFO L203 LiptonReduction]: Total number of compositions: 235 [2022-12-06 05:14:42,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:14:43,003 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;@674e9511, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:14:43,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:14:43,010 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-06 05:14:43,010 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:14:43,010 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:43,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:43,011 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1687508420, now seen corresponding path program 1 times [2022-12-06 05:14:43,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634086989] [2022-12-06 05:14:43,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:43,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:43,455 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:14:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634086989] [2022-12-06 05:14:43,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634086989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:43,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:43,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:14:43,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027821242] [2022-12-06 05:14:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:43,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:14:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:14:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:14:43,484 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:14:43,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:43,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:14:43,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:43,753 INFO L130 PetriNetUnfolder]: 1087/1478 cut-off events. [2022-12-06 05:14:43,754 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-06 05:14:43,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1478 events. 1087/1478 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4933 event pairs, 481 based on Foata normal form. 1/940 useless extension candidates. Maximal degree in co-relation 2496. Up to 1127 conditions per place. [2022-12-06 05:14:43,764 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 34 selfloop transitions, 0 changer transitions 25/60 dead transitions. [2022-12-06 05:14:43,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 271 flow [2022-12-06 05:14:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:14:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:14:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-06 05:14:43,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 05:14:43,779 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 96 flow. Second operand 3 states and 63 transitions. [2022-12-06 05:14:43,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 271 flow [2022-12-06 05:14:43,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 249 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:14:43,790 INFO L231 Difference]: Finished difference. Result has 35 places, 35 transitions, 78 flow [2022-12-06 05:14:43,791 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=35, PETRI_TRANSITIONS=35} [2022-12-06 05:14:43,795 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-06 05:14:43,795 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:43,796 INFO L89 Accepts]: Start accepts. Operand has 35 places, 35 transitions, 78 flow [2022-12-06 05:14:43,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:43,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:43,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 35 transitions, 78 flow [2022-12-06 05:14:43,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 35 transitions, 78 flow [2022-12-06 05:14:43,810 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2022-12-06 05:14:43,811 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:14:43,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 35 events. 9/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 37. Up to 3 conditions per place. [2022-12-06 05:14:43,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 35 transitions, 78 flow [2022-12-06 05:14:43,812 INFO L188 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-06 05:14:43,825 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:43,829 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 34 [2022-12-06 05:14:43,829 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 78 flow [2022-12-06 05:14:43,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:43,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:43,830 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:43,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:14:43,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:43,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1714978131, now seen corresponding path program 1 times [2022-12-06 05:14:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129049740] [2022-12-06 05:14:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:44,782 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:14:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:44,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129049740] [2022-12-06 05:14:44,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129049740] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:44,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:44,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585936381] [2022-12-06 05:14:44,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:44,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:44,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:44,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:44,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:44,794 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:44,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:44,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:44,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:44,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:45,120 INFO L130 PetriNetUnfolder]: 644/906 cut-off events. [2022-12-06 05:14:45,120 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:14:45,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 906 events. 644/906 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3187 event pairs, 38 based on Foata normal form. 1/611 useless extension candidates. Maximal degree in co-relation 1833. Up to 635 conditions per place. [2022-12-06 05:14:45,125 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 63 selfloop transitions, 2 changer transitions 10/76 dead transitions. [2022-12-06 05:14:45,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 76 transitions, 321 flow [2022-12-06 05:14:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:45,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 05:14:45,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-06 05:14:45,127 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 78 flow. Second operand 5 states and 81 transitions. [2022-12-06 05:14:45,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 76 transitions, 321 flow [2022-12-06 05:14:45,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 76 transitions, 317 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:45,130 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 91 flow [2022-12-06 05:14:45,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2022-12-06 05:14:45,131 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-06 05:14:45,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:45,131 INFO L89 Accepts]: Start accepts. Operand has 37 places, 36 transitions, 91 flow [2022-12-06 05:14:45,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:45,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:45,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 36 transitions, 91 flow [2022-12-06 05:14:45,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 36 transitions, 91 flow [2022-12-06 05:14:45,138 INFO L130 PetriNetUnfolder]: 10/49 cut-off events. [2022-12-06 05:14:45,139 INFO L131 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-12-06 05:14:45,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 49 events. 10/49 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 58. Up to 5 conditions per place. [2022-12-06 05:14:45,139 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 36 transitions, 91 flow [2022-12-06 05:14:45,139 INFO L188 LiptonReduction]: Number of co-enabled transitions 330 [2022-12-06 05:14:45,140 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:45,141 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:14:45,141 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 91 flow [2022-12-06 05:14:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:45,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:45,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:14:45,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 650819307, now seen corresponding path program 2 times [2022-12-06 05:14:45,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:45,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117103712] [2022-12-06 05:14:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:45,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:45,810 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:14:45,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:45,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117103712] [2022-12-06 05:14:45,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117103712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:45,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:45,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:45,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713390774] [2022-12-06 05:14:45,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:45,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:45,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:45,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:45,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:45,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:45,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:45,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:45,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:45,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:46,120 INFO L130 PetriNetUnfolder]: 706/1037 cut-off events. [2022-12-06 05:14:46,120 INFO L131 PetriNetUnfolder]: For 280/280 co-relation queries the response was YES. [2022-12-06 05:14:46,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 1037 events. 706/1037 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3692 event pairs, 323 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 2270. Up to 759 conditions per place. [2022-12-06 05:14:46,126 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 59 selfloop transitions, 3 changer transitions 10/73 dead transitions. [2022-12-06 05:14:46,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 73 transitions, 331 flow [2022-12-06 05:14:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 05:14:46,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44 [2022-12-06 05:14:46,128 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 91 flow. Second operand 5 states and 77 transitions. [2022-12-06 05:14:46,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 73 transitions, 331 flow [2022-12-06 05:14:46,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 322 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:46,130 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 108 flow [2022-12-06 05:14:46,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2022-12-06 05:14:46,131 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-06 05:14:46,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:46,131 INFO L89 Accepts]: Start accepts. Operand has 41 places, 37 transitions, 108 flow [2022-12-06 05:14:46,132 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:46,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:46,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 37 transitions, 108 flow [2022-12-06 05:14:46,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 108 flow [2022-12-06 05:14:46,139 INFO L130 PetriNetUnfolder]: 10/66 cut-off events. [2022-12-06 05:14:46,139 INFO L131 PetriNetUnfolder]: For 25/27 co-relation queries the response was YES. [2022-12-06 05:14:46,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 66 events. 10/66 cut-off events. For 25/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 186 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 89. Up to 6 conditions per place. [2022-12-06 05:14:46,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 37 transitions, 108 flow [2022-12-06 05:14:46,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 05:14:46,141 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:46,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:14:46,142 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 108 flow [2022-12-06 05:14:46,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:46,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:46,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:46,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:14:46,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1929550383, now seen corresponding path program 3 times [2022-12-06 05:14:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317754993] [2022-12-06 05:14:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:46,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:46,668 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:14:46,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:46,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317754993] [2022-12-06 05:14:46,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317754993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:46,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:46,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:46,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616614261] [2022-12-06 05:14:46,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:46,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:46,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:46,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:46,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:46,672 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:46,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:46,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:46,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:46,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:47,015 INFO L130 PetriNetUnfolder]: 775/1141 cut-off events. [2022-12-06 05:14:47,016 INFO L131 PetriNetUnfolder]: For 699/699 co-relation queries the response was YES. [2022-12-06 05:14:47,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1141 events. 775/1141 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4577 event pairs, 68 based on Foata normal form. 1/898 useless extension candidates. Maximal degree in co-relation 2671. Up to 797 conditions per place. [2022-12-06 05:14:47,022 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 64 selfloop transitions, 3 changer transitions 11/79 dead transitions. [2022-12-06 05:14:47,022 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 375 flow [2022-12-06 05:14:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 05:14:47,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2022-12-06 05:14:47,026 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 108 flow. Second operand 5 states and 82 transitions. [2022-12-06 05:14:47,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 375 flow [2022-12-06 05:14:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 79 transitions, 364 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:47,032 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 123 flow [2022-12-06 05:14:47,032 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-06 05:14:47,033 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-06 05:14:47,033 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:47,034 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 123 flow [2022-12-06 05:14:47,035 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:47,035 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:47,035 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 123 flow [2022-12-06 05:14:47,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 123 flow [2022-12-06 05:14:47,045 INFO L130 PetriNetUnfolder]: 11/76 cut-off events. [2022-12-06 05:14:47,046 INFO L131 PetriNetUnfolder]: For 62/71 co-relation queries the response was YES. [2022-12-06 05:14:47,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 76 events. 11/76 cut-off events. For 62/71 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 235 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 108. Up to 8 conditions per place. [2022-12-06 05:14:47,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 123 flow [2022-12-06 05:14:47,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:14:47,049 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:47,054 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:14:47,054 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 123 flow [2022-12-06 05:14:47,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,054 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:47,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:47,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:14:47,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:47,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1899883405, now seen corresponding path program 4 times [2022-12-06 05:14:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:47,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087568744] [2022-12-06 05:14:47,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:47,592 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:14:47,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:47,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087568744] [2022-12-06 05:14:47,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087568744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:47,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:47,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131595795] [2022-12-06 05:14:47,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:47,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:47,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:47,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:47,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:47,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:47,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:47,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:47,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:47,895 INFO L130 PetriNetUnfolder]: 860/1301 cut-off events. [2022-12-06 05:14:47,895 INFO L131 PetriNetUnfolder]: For 1345/1345 co-relation queries the response was YES. [2022-12-06 05:14:47,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3193 conditions, 1301 events. 860/1301 cut-off events. For 1345/1345 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5139 event pairs, 424 based on Foata normal form. 1/1021 useless extension candidates. Maximal degree in co-relation 3162. Up to 930 conditions per place. [2022-12-06 05:14:47,902 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 61 selfloop transitions, 4 changer transitions 11/77 dead transitions. [2022-12-06 05:14:47,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 392 flow [2022-12-06 05:14:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-06 05:14:47,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44571428571428573 [2022-12-06 05:14:47,904 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 123 flow. Second operand 5 states and 78 transitions. [2022-12-06 05:14:47,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 392 flow [2022-12-06 05:14:47,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 376 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:14:47,907 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 148 flow [2022-12-06 05:14:47,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-06 05:14:47,908 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-06 05:14:47,908 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:47,908 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 148 flow [2022-12-06 05:14:47,909 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:47,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:47,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 148 flow [2022-12-06 05:14:47,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 148 flow [2022-12-06 05:14:47,916 INFO L130 PetriNetUnfolder]: 9/71 cut-off events. [2022-12-06 05:14:47,917 INFO L131 PetriNetUnfolder]: For 65/76 co-relation queries the response was YES. [2022-12-06 05:14:47,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 71 events. 9/71 cut-off events. For 65/76 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 212 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 103. Up to 8 conditions per place. [2022-12-06 05:14:47,917 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 148 flow [2022-12-06 05:14:47,917 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 05:14:47,929 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:14:47,931 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 05:14:47,932 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 148 flow [2022-12-06 05:14:47,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:47,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:47,932 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:47,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:14:47,932 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1735604801, now seen corresponding path program 5 times [2022-12-06 05:14:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619697636] [2022-12-06 05:14:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:48,382 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:14:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:48,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619697636] [2022-12-06 05:14:48,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619697636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:48,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:48,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:48,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747483276] [2022-12-06 05:14:48,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:48,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:48,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:48,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:48,384 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:48,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:48,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:48,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:48,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:48,718 INFO L130 PetriNetUnfolder]: 854/1281 cut-off events. [2022-12-06 05:14:48,719 INFO L131 PetriNetUnfolder]: For 1833/1833 co-relation queries the response was YES. [2022-12-06 05:14:48,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 1281 events. 854/1281 cut-off events. For 1833/1833 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5063 event pairs, 462 based on Foata normal form. 1/999 useless extension candidates. Maximal degree in co-relation 3230. Up to 1000 conditions per place. [2022-12-06 05:14:48,727 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 64 selfloop transitions, 4 changer transitions 10/79 dead transitions. [2022-12-06 05:14:48,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 405 flow [2022-12-06 05:14:48,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 05:14:48,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-06 05:14:48,729 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 148 flow. Second operand 5 states and 81 transitions. [2022-12-06 05:14:48,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 405 flow [2022-12-06 05:14:48,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 385 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 05:14:48,735 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 144 flow [2022-12-06 05:14:48,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-06 05:14:48,738 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 05:14:48,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:48,738 INFO L89 Accepts]: Start accepts. Operand has 51 places, 39 transitions, 144 flow [2022-12-06 05:14:48,740 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:48,740 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:48,740 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 39 transitions, 144 flow [2022-12-06 05:14:48,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 144 flow [2022-12-06 05:14:48,748 INFO L130 PetriNetUnfolder]: 9/68 cut-off events. [2022-12-06 05:14:48,748 INFO L131 PetriNetUnfolder]: For 51/58 co-relation queries the response was YES. [2022-12-06 05:14:48,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 68 events. 9/68 cut-off events. For 51/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 196 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 97. Up to 7 conditions per place. [2022-12-06 05:14:48,749 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 144 flow [2022-12-06 05:14:48,749 INFO L188 LiptonReduction]: Number of co-enabled transitions 366 [2022-12-06 05:14:48,753 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [963] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= (ite (< v_~count3~0_33 v_~count1~0_39) 1 (- 1)) v_~res2~0_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (not (= v_~count1~0_39 v_~count3~0_33)) (= v_thread2Thread1of1ForFork1_~stop~1_17 0)) InVars {~count3~0=v_~count3~0_33, ~count1~0=v_~count1~0_39} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~count3~0=v_~count3~0_33, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_17, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, ~count1~0=v_~count1~0_39, ~res2~0=v_~res2~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:48,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [963] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= (ite (< v_~count3~0_33 v_~count1~0_39) 1 (- 1)) v_~res2~0_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (not (= v_~count1~0_39 v_~count3~0_33)) (= v_thread2Thread1of1ForFork1_~stop~1_17 0)) InVars {~count3~0=v_~count3~0_33, ~count1~0=v_~count1~0_39} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~count3~0=v_~count3~0_33, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_17, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, ~count1~0=v_~count1~0_39, ~res2~0=v_~res2~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] and [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:48,839 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:48,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 103 [2022-12-06 05:14:48,841 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 167 flow [2022-12-06 05:14:48,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:48,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:48,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:48,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:14:48,841 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:48,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1096613335, now seen corresponding path program 6 times [2022-12-06 05:14:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:48,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591715928] [2022-12-06 05:14:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:49,344 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:14:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:49,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591715928] [2022-12-06 05:14:49,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591715928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:49,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:49,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384416456] [2022-12-06 05:14:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:49,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:14:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:14:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:14:49,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:14:49,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:49,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:49,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:14:49,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:49,656 INFO L130 PetriNetUnfolder]: 830/1237 cut-off events. [2022-12-06 05:14:49,656 INFO L131 PetriNetUnfolder]: For 1544/1544 co-relation queries the response was YES. [2022-12-06 05:14:49,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3116 conditions, 1237 events. 830/1237 cut-off events. For 1544/1544 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4679 event pairs, 415 based on Foata normal form. 1/963 useless extension candidates. Maximal degree in co-relation 3091. Up to 911 conditions per place. [2022-12-06 05:14:49,663 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 66 selfloop transitions, 3 changer transitions 10/80 dead transitions. [2022-12-06 05:14:49,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 401 flow [2022-12-06 05:14:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:14:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:14:49,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-06 05:14:49,664 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4540540540540541 [2022-12-06 05:14:49,664 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 167 flow. Second operand 5 states and 84 transitions. [2022-12-06 05:14:49,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 401 flow [2022-12-06 05:14:49,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 375 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 05:14:49,669 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 129 flow [2022-12-06 05:14:49,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-06 05:14:49,670 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 05:14:49,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:49,670 INFO L89 Accepts]: Start accepts. Operand has 51 places, 38 transitions, 129 flow [2022-12-06 05:14:49,671 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:49,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:49,671 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 129 flow [2022-12-06 05:14:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 129 flow [2022-12-06 05:14:49,678 INFO L130 PetriNetUnfolder]: 9/62 cut-off events. [2022-12-06 05:14:49,678 INFO L131 PetriNetUnfolder]: For 30/38 co-relation queries the response was YES. [2022-12-06 05:14:49,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 62 events. 9/62 cut-off events. For 30/38 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 162 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 85. Up to 6 conditions per place. [2022-12-06 05:14:49,679 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 129 flow [2022-12-06 05:14:49,679 INFO L188 LiptonReduction]: Number of co-enabled transitions 358 [2022-12-06 05:14:49,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [1017] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_9| 0) (= (ite (< v_~count3~0_45 v_~count2~0_45) 1 (- 1)) v_~res3~0_38) (= v_thread3Thread1of1ForFork2_~stop~2_19 0) (not (= v_~count2~0_45 v_~count3~0_45)) (= |v_thread3Thread1of1ForFork2_#res.base_9| 0)) InVars {~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_19, ~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_9|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_9|, ~res3~0=v_~res3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, ~res3~0] [2022-12-06 05:14:49,733 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:14:49,734 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-06 05:14:49,734 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 145 flow [2022-12-06 05:14:49,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:49,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:49,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:49,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:14:49,735 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1316943419, now seen corresponding path program 1 times [2022-12-06 05:14:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:49,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560807934] [2022-12-06 05:14:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:49,809 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:14:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:49,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560807934] [2022-12-06 05:14:49,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560807934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:49,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:49,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122351428] [2022-12-06 05:14:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:49,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:14:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:49,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:14:49,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:14:49,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 37 [2022-12-06 05:14:49,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:49,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:49,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 37 [2022-12-06 05:14:49,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:49,997 INFO L130 PetriNetUnfolder]: 809/1205 cut-off events. [2022-12-06 05:14:49,997 INFO L131 PetriNetUnfolder]: For 1043/1043 co-relation queries the response was YES. [2022-12-06 05:14:49,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3016 conditions, 1205 events. 809/1205 cut-off events. For 1043/1043 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4543 event pairs, 380 based on Foata normal form. 10/942 useless extension candidates. Maximal degree in co-relation 2993. Up to 820 conditions per place. [2022-12-06 05:14:50,004 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 52 selfloop transitions, 3 changer transitions 2/58 dead transitions. [2022-12-06 05:14:50,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 289 flow [2022-12-06 05:14:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:14:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:14:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-06 05:14:50,005 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2022-12-06 05:14:50,005 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 145 flow. Second operand 3 states and 60 transitions. [2022-12-06 05:14:50,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 289 flow [2022-12-06 05:14:50,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 283 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:50,011 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 136 flow [2022-12-06 05:14:50,011 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-12-06 05:14:50,013 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2022-12-06 05:14:50,014 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:50,014 INFO L89 Accepts]: Start accepts. Operand has 50 places, 38 transitions, 136 flow [2022-12-06 05:14:50,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:50,015 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:50,015 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 136 flow [2022-12-06 05:14:50,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 136 flow [2022-12-06 05:14:50,024 INFO L130 PetriNetUnfolder]: 10/70 cut-off events. [2022-12-06 05:14:50,025 INFO L131 PetriNetUnfolder]: For 66/75 co-relation queries the response was YES. [2022-12-06 05:14:50,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 70 events. 10/70 cut-off events. For 66/75 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 200 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2022-12-06 05:14:50,026 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 136 flow [2022-12-06 05:14:50,026 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 05:14:50,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1017] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_9| 0) (= (ite (< v_~count3~0_45 v_~count2~0_45) 1 (- 1)) v_~res3~0_38) (= v_thread3Thread1of1ForFork2_~stop~2_19 0) (not (= v_~count2~0_45 v_~count3~0_45)) (= |v_thread3Thread1of1ForFork2_#res.base_9| 0)) InVars {~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_19, ~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_9|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_9|, ~res3~0=v_~res3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, ~res3~0] and [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:50,075 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1017] $Ultimate##0-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_9| 0) (= (ite (< v_~count3~0_45 v_~count2~0_45) 1 (- 1)) v_~res3~0_38) (= v_thread3Thread1of1ForFork2_~stop~2_19 0) (not (= v_~count2~0_45 v_~count3~0_45)) (= |v_thread3Thread1of1ForFork2_#res.base_9| 0)) InVars {~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_19, ~count3~0=v_~count3~0_45, ~count2~0=v_~count2~0_45, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_9|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_9|, ~res3~0=v_~res3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, ~res3~0] and [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] [2022-12-06 05:14:50,121 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:50,122 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-06 05:14:50,122 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 150 flow [2022-12-06 05:14:50,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:50,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:50,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:14:50,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:50,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash -882314299, now seen corresponding path program 2 times [2022-12-06 05:14:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:50,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589900497] [2022-12-06 05:14:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:50,222 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:14:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:50,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589900497] [2022-12-06 05:14:50,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589900497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:50,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:50,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259883985] [2022-12-06 05:14:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:50,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:14:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:14:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:14:50,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-06 05:14:50,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:50,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-06 05:14:50,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:50,385 INFO L130 PetriNetUnfolder]: 754/1140 cut-off events. [2022-12-06 05:14:50,386 INFO L131 PetriNetUnfolder]: For 1603/1603 co-relation queries the response was YES. [2022-12-06 05:14:50,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 1140 events. 754/1140 cut-off events. For 1603/1603 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4554 event pairs, 119 based on Foata normal form. 12/895 useless extension candidates. Maximal degree in co-relation 1992. Up to 952 conditions per place. [2022-12-06 05:14:50,393 INFO L137 encePairwiseOnDemand]: 34/38 looper letters, 48 selfloop transitions, 2 changer transitions 1/52 dead transitions. [2022-12-06 05:14:50,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 293 flow [2022-12-06 05:14:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:14:50,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:14:50,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-12-06 05:14:50,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 05:14:50,395 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 150 flow. Second operand 3 states and 56 transitions. [2022-12-06 05:14:50,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 293 flow [2022-12-06 05:14:50,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 273 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 05:14:50,400 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 127 flow [2022-12-06 05:14:50,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-06 05:14:50,401 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 05:14:50,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:50,401 INFO L89 Accepts]: Start accepts. Operand has 51 places, 38 transitions, 127 flow [2022-12-06 05:14:50,403 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:50,403 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:50,403 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 127 flow [2022-12-06 05:14:50,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 127 flow [2022-12-06 05:14:50,410 INFO L130 PetriNetUnfolder]: 12/62 cut-off events. [2022-12-06 05:14:50,411 INFO L131 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2022-12-06 05:14:50,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 12/62 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 143 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 76. Up to 5 conditions per place. [2022-12-06 05:14:50,412 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 38 transitions, 127 flow [2022-12-06 05:14:50,412 INFO L188 LiptonReduction]: Number of co-enabled transitions 346 [2022-12-06 05:14:50,417 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:50,418 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:14:50,418 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 127 flow [2022-12-06 05:14:50,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:50,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:50,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:14:50,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:50,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2132898103, now seen corresponding path program 1 times [2022-12-06 05:14:50,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:50,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906212190] [2022-12-06 05:14:50,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:50,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:50,491 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:14:50,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:50,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906212190] [2022-12-06 05:14:50,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906212190] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:50,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:50,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:14:50,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298053712] [2022-12-06 05:14:50,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:50,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:14:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:50,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:14:50,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:14:50,494 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:14:50,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:50,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:14:50,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:50,646 INFO L130 PetriNetUnfolder]: 681/997 cut-off events. [2022-12-06 05:14:50,647 INFO L131 PetriNetUnfolder]: For 943/943 co-relation queries the response was YES. [2022-12-06 05:14:50,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 997 events. 681/997 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3472 event pairs, 382 based on Foata normal form. 8/772 useless extension candidates. Maximal degree in co-relation 1780. Up to 856 conditions per place. [2022-12-06 05:14:50,653 INFO L137 encePairwiseOnDemand]: 33/36 looper letters, 50 selfloop transitions, 1 changer transitions 1/53 dead transitions. [2022-12-06 05:14:50,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 271 flow [2022-12-06 05:14:50,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:14:50,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:14:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 05:14:50,655 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 05:14:50,655 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 127 flow. Second operand 3 states and 54 transitions. [2022-12-06 05:14:50,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 271 flow [2022-12-06 05:14:50,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 260 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:50,657 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 112 flow [2022-12-06 05:14:50,658 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-06 05:14:50,659 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 05:14:50,659 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:50,659 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 112 flow [2022-12-06 05:14:50,660 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:50,660 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:50,661 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 112 flow [2022-12-06 05:14:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 112 flow [2022-12-06 05:14:50,666 INFO L130 PetriNetUnfolder]: 9/45 cut-off events. [2022-12-06 05:14:50,666 INFO L131 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2022-12-06 05:14:50,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 45 events. 9/45 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 57. Up to 4 conditions per place. [2022-12-06 05:14:50,667 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 112 flow [2022-12-06 05:14:50,667 INFO L188 LiptonReduction]: Number of co-enabled transitions 344 [2022-12-06 05:14:50,668 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:50,669 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 05:14:50,669 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 112 flow [2022-12-06 05:14:50,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,669 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:50,670 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:50,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:14:50,670 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:50,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:50,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1553652108, now seen corresponding path program 1 times [2022-12-06 05:14:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93523330] [2022-12-06 05:14:50,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:50,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:50,758 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:14:50,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:50,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93523330] [2022-12-06 05:14:50,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93523330] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:50,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:50,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770404819] [2022-12-06 05:14:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:50,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:50,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:50,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:50,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:50,761 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:50,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:50,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:50,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:50,963 INFO L130 PetriNetUnfolder]: 868/1279 cut-off events. [2022-12-06 05:14:50,963 INFO L131 PetriNetUnfolder]: For 1056/1056 co-relation queries the response was YES. [2022-12-06 05:14:50,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1279 events. 868/1279 cut-off events. For 1056/1056 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5046 event pairs, 54 based on Foata normal form. 34/1027 useless extension candidates. Maximal degree in co-relation 2832. Up to 804 conditions per place. [2022-12-06 05:14:50,971 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 63 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2022-12-06 05:14:50,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 346 flow [2022-12-06 05:14:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:50,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 05:14:50,973 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 05:14:50,973 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 112 flow. Second operand 4 states and 72 transitions. [2022-12-06 05:14:50,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 346 flow [2022-12-06 05:14:50,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 338 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:50,977 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,977 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2022-12-06 05:14:50,978 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-06 05:14:50,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:50,978 INFO L89 Accepts]: Start accepts. Operand has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:50,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:50,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,988 INFO L130 PetriNetUnfolder]: 20/82 cut-off events. [2022-12-06 05:14:50,988 INFO L131 PetriNetUnfolder]: For 37/44 co-relation queries the response was YES. [2022-12-06 05:14:50,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 82 events. 20/82 cut-off events. For 37/44 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 249 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 109. Up to 10 conditions per place. [2022-12-06 05:14:50,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 05:14:50,990 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:50,991 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:14:50,991 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 162 flow [2022-12-06 05:14:50,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:50,991 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:50,991 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:50,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:14:50,992 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:50,992 INFO L85 PathProgramCache]: Analyzing trace with hash -342399408, now seen corresponding path program 2 times [2022-12-06 05:14:50,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56442] [2022-12-06 05:14:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:50,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:51,086 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:14:51,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:51,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56442] [2022-12-06 05:14:51,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:51,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:51,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973426164] [2022-12-06 05:14:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:51,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:51,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:51,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:51,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:51,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:51,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:51,279 INFO L130 PetriNetUnfolder]: 782/1158 cut-off events. [2022-12-06 05:14:51,279 INFO L131 PetriNetUnfolder]: For 1174/1174 co-relation queries the response was YES. [2022-12-06 05:14:51,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 1158 events. 782/1158 cut-off events. For 1174/1174 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4420 event pairs, 43 based on Foata normal form. 34/929 useless extension candidates. Maximal degree in co-relation 2333. Up to 710 conditions per place. [2022-12-06 05:14:51,286 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 63 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2022-12-06 05:14:51,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 381 flow [2022-12-06 05:14:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 05:14:51,287 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 05:14:51,287 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 162 flow. Second operand 4 states and 72 transitions. [2022-12-06 05:14:51,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 381 flow [2022-12-06 05:14:51,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:14:51,290 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,290 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2022-12-06 05:14:51,291 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-06 05:14:51,291 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:51,291 INFO L89 Accepts]: Start accepts. Operand has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,293 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:51,293 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:51,293 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,301 INFO L130 PetriNetUnfolder]: 20/79 cut-off events. [2022-12-06 05:14:51,301 INFO L131 PetriNetUnfolder]: For 97/109 co-relation queries the response was YES. [2022-12-06 05:14:51,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 79 events. 20/79 cut-off events. For 97/109 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 228 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 115. Up to 10 conditions per place. [2022-12-06 05:14:51,302 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,302 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 05:14:51,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:51,304 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 05:14:51,304 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 198 flow [2022-12-06 05:14:51,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:51,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:51,305 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:51,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:14:51,305 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash -53395044, now seen corresponding path program 3 times [2022-12-06 05:14:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:51,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937787000] [2022-12-06 05:14:51,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:51,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:14:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937787000] [2022-12-06 05:14:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937787000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:51,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:51,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351608500] [2022-12-06 05:14:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:51,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:51,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:51,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:51,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:51,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:51,602 INFO L130 PetriNetUnfolder]: 722/1051 cut-off events. [2022-12-06 05:14:51,602 INFO L131 PetriNetUnfolder]: For 1650/1650 co-relation queries the response was YES. [2022-12-06 05:14:51,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3014 conditions, 1051 events. 722/1051 cut-off events. For 1650/1650 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3849 event pairs, 164 based on Foata normal form. 8/820 useless extension candidates. Maximal degree in co-relation 2480. Up to 855 conditions per place. [2022-12-06 05:14:51,611 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 61 selfloop transitions, 5 changer transitions 1/68 dead transitions. [2022-12-06 05:14:51,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 398 flow [2022-12-06 05:14:51,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 05:14:51,612 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-06 05:14:51,612 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 198 flow. Second operand 4 states and 67 transitions. [2022-12-06 05:14:51,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 398 flow [2022-12-06 05:14:51,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 389 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:14:51,616 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 189 flow [2022-12-06 05:14:51,616 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2022-12-06 05:14:51,617 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-06 05:14:51,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:51,617 INFO L89 Accepts]: Start accepts. Operand has 59 places, 42 transitions, 189 flow [2022-12-06 05:14:51,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:51,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:51,619 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 42 transitions, 189 flow [2022-12-06 05:14:51,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 189 flow [2022-12-06 05:14:51,627 INFO L130 PetriNetUnfolder]: 18/67 cut-off events. [2022-12-06 05:14:51,627 INFO L131 PetriNetUnfolder]: For 75/82 co-relation queries the response was YES. [2022-12-06 05:14:51,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 67 events. 18/67 cut-off events. For 75/82 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 167 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 118. Up to 9 conditions per place. [2022-12-06 05:14:51,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 189 flow [2022-12-06 05:14:51,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:14:51,633 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [976] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_15 0) (= v_thread3Thread1of1ForFork2_~i~2_43 0) (= v_~count2~0_35 v_~count3~0_37)) InVars {~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_15, ~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [963] $Ultimate##0-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (= (ite (< v_~count3~0_33 v_~count1~0_39) 1 (- 1)) v_~res2~0_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0) (not (= v_~count1~0_39 v_~count3~0_33)) (= v_thread2Thread1of1ForFork1_~stop~1_17 0)) InVars {~count3~0=v_~count3~0_33, ~count1~0=v_~count1~0_39} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~count3~0=v_~count3~0_33, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_17, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|, ~count1~0=v_~count1~0_39, ~res2~0=v_~res2~0_30} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:14:51,678 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:14:51,680 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-06 05:14:51,680 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 213 flow [2022-12-06 05:14:51,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:51,680 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:51,680 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:51,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 05:14:51,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:51,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1374824088, now seen corresponding path program 1 times [2022-12-06 05:14:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:51,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061556695] [2022-12-06 05:14:51,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:51,766 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:14:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:51,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061556695] [2022-12-06 05:14:51,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061556695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:51,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:51,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389611985] [2022-12-06 05:14:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:51,768 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-06 05:14:51,769 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:51,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:51,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-06 05:14:51,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:51,971 INFO L130 PetriNetUnfolder]: 949/1403 cut-off events. [2022-12-06 05:14:51,972 INFO L131 PetriNetUnfolder]: For 1610/1610 co-relation queries the response was YES. [2022-12-06 05:14:51,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 1403 events. 949/1403 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5632 event pairs, 130 based on Foata normal form. 16/1072 useless extension candidates. Maximal degree in co-relation 3291. Up to 1214 conditions per place. [2022-12-06 05:14:51,980 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 56 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2022-12-06 05:14:51,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 372 flow [2022-12-06 05:14:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:51,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 05:14:51,981 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-06 05:14:51,981 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 213 flow. Second operand 4 states and 62 transitions. [2022-12-06 05:14:51,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 372 flow [2022-12-06 05:14:51,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 352 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 05:14:51,985 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:51,986 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-06 05:14:51,986 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2022-12-06 05:14:51,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:51,987 INFO L89 Accepts]: Start accepts. Operand has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:51,987 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:51,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:51,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:51,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:51,996 INFO L130 PetriNetUnfolder]: 23/93 cut-off events. [2022-12-06 05:14:51,997 INFO L131 PetriNetUnfolder]: For 59/65 co-relation queries the response was YES. [2022-12-06 05:14:51,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 93 events. 23/93 cut-off events. For 59/65 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 310 event pairs, 0 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 142. Up to 11 conditions per place. [2022-12-06 05:14:51,998 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:51,998 INFO L188 LiptonReduction]: Number of co-enabled transitions 398 [2022-12-06 05:14:51,999 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:52,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 05:14:52,000 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 212 flow [2022-12-06 05:14:52,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:52,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:52,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:52,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:14:52,001 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:52,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash -652144506, now seen corresponding path program 2 times [2022-12-06 05:14:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:52,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289005852] [2022-12-06 05:14:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:52,099 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:14:52,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:52,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289005852] [2022-12-06 05:14:52,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289005852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:52,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:52,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:14:52,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129253096] [2022-12-06 05:14:52,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:52,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:14:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:52,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:14:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:14:52,101 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-06 05:14:52,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:52,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:52,101 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-06 05:14:52,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:52,316 INFO L130 PetriNetUnfolder]: 913/1331 cut-off events. [2022-12-06 05:14:52,316 INFO L131 PetriNetUnfolder]: For 978/978 co-relation queries the response was YES. [2022-12-06 05:14:52,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1331 events. 913/1331 cut-off events. For 978/978 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5192 event pairs, 256 based on Foata normal form. 10/1008 useless extension candidates. Maximal degree in co-relation 1025. Up to 1239 conditions per place. [2022-12-06 05:14:52,329 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 46 selfloop transitions, 4 changer transitions 11/62 dead transitions. [2022-12-06 05:14:52,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 373 flow [2022-12-06 05:14:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:14:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:14:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 05:14:52,330 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4264705882352941 [2022-12-06 05:14:52,330 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 212 flow. Second operand 4 states and 58 transitions. [2022-12-06 05:14:52,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 373 flow [2022-12-06 05:14:52,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:14:52,333 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 197 flow [2022-12-06 05:14:52,333 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2022-12-06 05:14:52,333 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 05:14:52,333 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:52,333 INFO L89 Accepts]: Start accepts. Operand has 57 places, 44 transitions, 197 flow [2022-12-06 05:14:52,334 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:52,334 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:52,334 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 44 transitions, 197 flow [2022-12-06 05:14:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 44 transitions, 197 flow [2022-12-06 05:14:52,343 INFO L130 PetriNetUnfolder]: 21/84 cut-off events. [2022-12-06 05:14:52,343 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-12-06 05:14:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 84 events. 21/84 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 249 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 142. Up to 9 conditions per place. [2022-12-06 05:14:52,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 44 transitions, 197 flow [2022-12-06 05:14:52,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 378 [2022-12-06 05:14:52,345 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:14:52,345 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:14:52,346 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 197 flow [2022-12-06 05:14:52,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:14:52,346 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:14:52,346 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:14:52,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 05:14:52,347 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:14:52,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:14:52,347 INFO L85 PathProgramCache]: Analyzing trace with hash -593502347, now seen corresponding path program 1 times [2022-12-06 05:14:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:14:52,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866523897] [2022-12-06 05:14:52,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:14:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:14:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:14:52,967 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:14:52,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:14:52,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866523897] [2022-12-06 05:14:52,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866523897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:14:52,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:14:52,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:14:52,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394411305] [2022-12-06 05:14:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:14:52,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:14:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:14:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:14:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:14:52,969 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:14:52,969 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:14:52,969 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:14:52,969 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:14:52,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:14:53,459 INFO L130 PetriNetUnfolder]: 1677/2489 cut-off events. [2022-12-06 05:14:53,459 INFO L131 PetriNetUnfolder]: For 1675/1675 co-relation queries the response was YES. [2022-12-06 05:14:53,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6382 conditions, 2489 events. 1677/2489 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 11212 event pairs, 510 based on Foata normal form. 2/1939 useless extension candidates. Maximal degree in co-relation 5982. Up to 677 conditions per place. [2022-12-06 05:14:53,476 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 96 selfloop transitions, 17 changer transitions 7/121 dead transitions. [2022-12-06 05:14:53,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 121 transitions, 758 flow [2022-12-06 05:14:53,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:14:53,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:14:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-06 05:14:53,478 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-06 05:14:53,478 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 197 flow. Second operand 8 states and 104 transitions. [2022-12-06 05:14:53,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 121 transitions, 758 flow [2022-12-06 05:14:53,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 121 transitions, 732 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 05:14:53,482 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 342 flow [2022-12-06 05:14:53,482 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=342, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2022-12-06 05:14:53,483 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-06 05:14:53,483 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:14:53,483 INFO L89 Accepts]: Start accepts. Operand has 61 places, 60 transitions, 342 flow [2022-12-06 05:14:53,485 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:14:53,485 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:14:53,485 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 60 transitions, 342 flow [2022-12-06 05:14:53,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 342 flow [2022-12-06 05:14:53,503 INFO L130 PetriNetUnfolder]: 49/185 cut-off events. [2022-12-06 05:14:53,503 INFO L131 PetriNetUnfolder]: For 88/96 co-relation queries the response was YES. [2022-12-06 05:14:53,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 185 events. 49/185 cut-off events. For 88/96 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 896 event pairs, 3 based on Foata normal form. 2/165 useless extension candidates. Maximal degree in co-relation 285. Up to 30 conditions per place. [2022-12-06 05:14:53,505 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 60 transitions, 342 flow [2022-12-06 05:14:53,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 05:15:05,209 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:15:05,209 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11726 [2022-12-06 05:15:05,210 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 339 flow [2022-12-06 05:15:05,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:15:05,210 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:05,210 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:05,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 05:15:05,210 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1503204281, now seen corresponding path program 1 times [2022-12-06 05:15:05,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:05,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988761022] [2022-12-06 05:15:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:05,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:05,398 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:15:05,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:05,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988761022] [2022-12-06 05:15:05,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988761022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:05,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:05,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828138462] [2022-12-06 05:15:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:05,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:05,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:05,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:05,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:05,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:15:05,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:05,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:05,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:15:05,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:06,176 INFO L130 PetriNetUnfolder]: 3452/4996 cut-off events. [2022-12-06 05:15:06,176 INFO L131 PetriNetUnfolder]: For 4442/4445 co-relation queries the response was YES. [2022-12-06 05:15:06,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 4996 events. 3452/4996 cut-off events. For 4442/4445 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 24342 event pairs, 1142 based on Foata normal form. 4/4380 useless extension candidates. Maximal degree in co-relation 12001. Up to 2411 conditions per place. [2022-12-06 05:15:06,205 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 54 selfloop transitions, 3 changer transitions 153/211 dead transitions. [2022-12-06 05:15:06,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 211 transitions, 1481 flow [2022-12-06 05:15:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:15:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:15:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2022-12-06 05:15:06,207 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4361111111111111 [2022-12-06 05:15:06,207 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 339 flow. Second operand 10 states and 157 transitions. [2022-12-06 05:15:06,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 211 transitions, 1481 flow [2022-12-06 05:15:06,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 211 transitions, 1439 flow, removed 21 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:06,230 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 349 flow [2022-12-06 05:15:06,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=349, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2022-12-06 05:15:06,284 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-06 05:15:06,284 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:06,284 INFO L89 Accepts]: Start accepts. Operand has 71 places, 58 transitions, 349 flow [2022-12-06 05:15:06,285 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:06,285 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:06,285 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 58 transitions, 349 flow [2022-12-06 05:15:06,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 58 transitions, 349 flow [2022-12-06 05:15:06,304 INFO L130 PetriNetUnfolder]: 49/187 cut-off events. [2022-12-06 05:15:06,304 INFO L131 PetriNetUnfolder]: For 150/162 co-relation queries the response was YES. [2022-12-06 05:15:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 187 events. 49/187 cut-off events. For 150/162 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 919 event pairs, 3 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 443. Up to 30 conditions per place. [2022-12-06 05:15:06,307 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 58 transitions, 349 flow [2022-12-06 05:15:06,307 INFO L188 LiptonReduction]: Number of co-enabled transitions 550 [2022-12-06 05:15:06,605 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:06,606 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 322 [2022-12-06 05:15:06,606 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 345 flow [2022-12-06 05:15:06,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:06,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:06,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:06,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 05:15:06,606 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:06,607 INFO L85 PathProgramCache]: Analyzing trace with hash -524714777, now seen corresponding path program 1 times [2022-12-06 05:15:06,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:06,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562522180] [2022-12-06 05:15:06,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:06,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:07,431 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:15:07,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:07,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562522180] [2022-12-06 05:15:07,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562522180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:07,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:07,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:15:07,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819024630] [2022-12-06 05:15:07,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:07,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:07,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:07,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-06 05:15:07,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 345 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:07,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:07,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-06 05:15:07,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:08,440 INFO L130 PetriNetUnfolder]: 3561/5211 cut-off events. [2022-12-06 05:15:08,441 INFO L131 PetriNetUnfolder]: For 6854/6857 co-relation queries the response was YES. [2022-12-06 05:15:08,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16890 conditions, 5211 events. 3561/5211 cut-off events. For 6854/6857 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26350 event pairs, 1118 based on Foata normal form. 85/5006 useless extension candidates. Maximal degree in co-relation 16863. Up to 2658 conditions per place. [2022-12-06 05:15:08,475 INFO L137 encePairwiseOnDemand]: 27/36 looper letters, 178 selfloop transitions, 35 changer transitions 11/225 dead transitions. [2022-12-06 05:15:08,475 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 225 transitions, 1623 flow [2022-12-06 05:15:08,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:15:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:15:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions. [2022-12-06 05:15:08,477 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5055555555555555 [2022-12-06 05:15:08,477 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 345 flow. Second operand 10 states and 182 transitions. [2022-12-06 05:15:08,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 225 transitions, 1623 flow [2022-12-06 05:15:08,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 225 transitions, 1483 flow, removed 68 selfloop flow, removed 9 redundant places. [2022-12-06 05:15:08,510 INFO L231 Difference]: Finished difference. Result has 71 places, 91 transitions, 681 flow [2022-12-06 05:15:08,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=681, PETRI_PLACES=71, PETRI_TRANSITIONS=91} [2022-12-06 05:15:08,511 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-06 05:15:08,511 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:08,511 INFO L89 Accepts]: Start accepts. Operand has 71 places, 91 transitions, 681 flow [2022-12-06 05:15:08,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:08,512 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:08,512 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 91 transitions, 681 flow [2022-12-06 05:15:08,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 91 transitions, 681 flow [2022-12-06 05:15:08,550 INFO L130 PetriNetUnfolder]: 121/424 cut-off events. [2022-12-06 05:15:08,551 INFO L131 PetriNetUnfolder]: For 545/596 co-relation queries the response was YES. [2022-12-06 05:15:08,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 424 events. 121/424 cut-off events. For 545/596 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2703 event pairs, 4 based on Foata normal form. 8/382 useless extension candidates. Maximal degree in co-relation 1121. Up to 80 conditions per place. [2022-12-06 05:15:08,557 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 91 transitions, 681 flow [2022-12-06 05:15:08,557 INFO L188 LiptonReduction]: Number of co-enabled transitions 1084 [2022-12-06 05:15:08,560 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:08,834 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:09,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:09,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:09,630 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:09,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1120 [2022-12-06 05:15:09,631 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 90 transitions, 690 flow [2022-12-06 05:15:09,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:09,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:09,631 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:09,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 05:15:09,631 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:09,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 236148369, now seen corresponding path program 2 times [2022-12-06 05:15:09,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:09,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489427322] [2022-12-06 05:15:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:09,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:10,119 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:15:10,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:10,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489427322] [2022-12-06 05:15:10,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489427322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:10,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:10,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:15:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899933810] [2022-12-06 05:15:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:10,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:10,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:10,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:10,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:15:10,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 90 transitions, 690 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:10,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:10,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:15:10,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:11,057 INFO L130 PetriNetUnfolder]: 3453/5225 cut-off events. [2022-12-06 05:15:11,059 INFO L131 PetriNetUnfolder]: For 10660/10663 co-relation queries the response was YES. [2022-12-06 05:15:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17793 conditions, 5225 events. 3453/5225 cut-off events. For 10660/10663 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 27944 event pairs, 1454 based on Foata normal form. 238/4798 useless extension candidates. Maximal degree in co-relation 17760. Up to 2412 conditions per place. [2022-12-06 05:15:11,090 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 165 selfloop transitions, 32 changer transitions 13/211 dead transitions. [2022-12-06 05:15:11,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 211 transitions, 1612 flow [2022-12-06 05:15:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:15:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:15:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2022-12-06 05:15:11,091 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46111111111111114 [2022-12-06 05:15:11,091 INFO L175 Difference]: Start difference. First operand has 69 places, 90 transitions, 690 flow. Second operand 9 states and 166 transitions. [2022-12-06 05:15:11,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 211 transitions, 1612 flow [2022-12-06 05:15:11,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 211 transitions, 1576 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 05:15:11,128 INFO L231 Difference]: Finished difference. Result has 80 places, 102 transitions, 926 flow [2022-12-06 05:15:11,128 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=926, PETRI_PLACES=80, PETRI_TRANSITIONS=102} [2022-12-06 05:15:11,128 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-06 05:15:11,128 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:11,129 INFO L89 Accepts]: Start accepts. Operand has 80 places, 102 transitions, 926 flow [2022-12-06 05:15:11,131 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:11,131 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:11,132 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 102 transitions, 926 flow [2022-12-06 05:15:11,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 102 transitions, 926 flow [2022-12-06 05:15:11,175 INFO L130 PetriNetUnfolder]: 122/452 cut-off events. [2022-12-06 05:15:11,175 INFO L131 PetriNetUnfolder]: For 950/993 co-relation queries the response was YES. [2022-12-06 05:15:11,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 452 events. 122/452 cut-off events. For 950/993 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3034 event pairs, 5 based on Foata normal form. 11/409 useless extension candidates. Maximal degree in co-relation 1281. Up to 88 conditions per place. [2022-12-06 05:15:11,181 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 102 transitions, 926 flow [2022-12-06 05:15:11,181 INFO L188 LiptonReduction]: Number of co-enabled transitions 1138 [2022-12-06 05:15:14,410 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [941] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_15 0) (= v_~count1~0_33 v_~count3~0_27) (= v_thread2Thread1of1ForFork1_~i~1_33 0)) InVars {~count3~0=v_~count3~0_27, ~count1~0=v_~count1~0_33} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, ~count3~0=v_~count3~0_27, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_15, ~count1~0=v_~count1~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_~stop~1] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:14,454 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:14,455 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3327 [2022-12-06 05:15:14,455 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 934 flow [2022-12-06 05:15:14,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:14,456 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:14,456 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:14,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 05:15:14,456 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:14,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash -455930497, now seen corresponding path program 3 times [2022-12-06 05:15:14,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:14,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30453282] [2022-12-06 05:15:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:14,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:14,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:14,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:14,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30453282] [2022-12-06 05:15:14,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30453282] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:14,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:14,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:15:14,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006345314] [2022-12-06 05:15:14,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:14,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:14,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:14,874 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-06 05:15:14,875 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 934 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:14,875 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:14,875 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-06 05:15:14,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:16,031 INFO L130 PetriNetUnfolder]: 3677/5723 cut-off events. [2022-12-06 05:15:16,032 INFO L131 PetriNetUnfolder]: For 13925/13928 co-relation queries the response was YES. [2022-12-06 05:15:16,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19872 conditions, 5723 events. 3677/5723 cut-off events. For 13925/13928 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 32784 event pairs, 1590 based on Foata normal form. 4/4974 useless extension candidates. Maximal degree in co-relation 19811. Up to 2412 conditions per place. [2022-12-06 05:15:16,069 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 182 selfloop transitions, 36 changer transitions 28/247 dead transitions. [2022-12-06 05:15:16,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 247 transitions, 1925 flow [2022-12-06 05:15:16,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:15:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:15:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2022-12-06 05:15:16,071 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42291666666666666 [2022-12-06 05:15:16,071 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 934 flow. Second operand 12 states and 203 transitions. [2022-12-06 05:15:16,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 247 transitions, 1925 flow [2022-12-06 05:15:16,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 247 transitions, 1835 flow, removed 40 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:16,136 INFO L231 Difference]: Finished difference. Result has 91 places, 108 transitions, 995 flow [2022-12-06 05:15:16,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=995, PETRI_PLACES=91, PETRI_TRANSITIONS=108} [2022-12-06 05:15:16,136 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 53 predicate places. [2022-12-06 05:15:16,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:16,137 INFO L89 Accepts]: Start accepts. Operand has 91 places, 108 transitions, 995 flow [2022-12-06 05:15:16,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:16,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:16,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 108 transitions, 995 flow [2022-12-06 05:15:16,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 108 transitions, 995 flow [2022-12-06 05:15:16,197 INFO L130 PetriNetUnfolder]: 111/478 cut-off events. [2022-12-06 05:15:16,197 INFO L131 PetriNetUnfolder]: For 965/1011 co-relation queries the response was YES. [2022-12-06 05:15:16,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 478 events. 111/478 cut-off events. For 965/1011 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3388 event pairs, 5 based on Foata normal form. 14/439 useless extension candidates. Maximal degree in co-relation 1333. Up to 80 conditions per place. [2022-12-06 05:15:16,204 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 108 transitions, 995 flow [2022-12-06 05:15:16,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 1198 [2022-12-06 05:15:16,207 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:16,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 05:15:16,208 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 108 transitions, 995 flow [2022-12-06 05:15:16,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:16,208 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:16,208 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:16,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 05:15:16,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash -328501897, now seen corresponding path program 4 times [2022-12-06 05:15:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:16,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780380971] [2022-12-06 05:15:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:16,612 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:15:16,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:16,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780380971] [2022-12-06 05:15:16,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780380971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:16,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:16,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:15:16,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472385711] [2022-12-06 05:15:16,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:16,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:16,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:16,613 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:15:16,613 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 108 transitions, 995 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:16,613 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:16,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:15:16,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:17,701 INFO L130 PetriNetUnfolder]: 3569/5491 cut-off events. [2022-12-06 05:15:17,702 INFO L131 PetriNetUnfolder]: For 13153/13156 co-relation queries the response was YES. [2022-12-06 05:15:17,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19541 conditions, 5491 events. 3569/5491 cut-off events. For 13153/13156 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 30761 event pairs, 1450 based on Foata normal form. 4/4759 useless extension candidates. Maximal degree in co-relation 19488. Up to 2412 conditions per place. [2022-12-06 05:15:17,748 INFO L137 encePairwiseOnDemand]: 31/39 looper letters, 178 selfloop transitions, 36 changer transitions 26/241 dead transitions. [2022-12-06 05:15:17,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 241 transitions, 1909 flow [2022-12-06 05:15:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:15:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:15:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 201 transitions. [2022-12-06 05:15:17,752 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42948717948717946 [2022-12-06 05:15:17,753 INFO L175 Difference]: Start difference. First operand has 89 places, 108 transitions, 995 flow. Second operand 12 states and 201 transitions. [2022-12-06 05:15:17,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 241 transitions, 1909 flow [2022-12-06 05:15:17,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 241 transitions, 1863 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-06 05:15:17,806 INFO L231 Difference]: Finished difference. Result has 98 places, 106 transitions, 1015 flow [2022-12-06 05:15:17,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1015, PETRI_PLACES=98, PETRI_TRANSITIONS=106} [2022-12-06 05:15:17,806 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 60 predicate places. [2022-12-06 05:15:17,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:17,808 INFO L89 Accepts]: Start accepts. Operand has 98 places, 106 transitions, 1015 flow [2022-12-06 05:15:17,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:17,809 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:17,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 106 transitions, 1015 flow [2022-12-06 05:15:17,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 106 transitions, 1015 flow [2022-12-06 05:15:17,851 INFO L130 PetriNetUnfolder]: 111/456 cut-off events. [2022-12-06 05:15:17,851 INFO L131 PetriNetUnfolder]: For 978/1024 co-relation queries the response was YES. [2022-12-06 05:15:17,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 456 events. 111/456 cut-off events. For 978/1024 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3167 event pairs, 5 based on Foata normal form. 14/417 useless extension candidates. Maximal degree in co-relation 1318. Up to 74 conditions per place. [2022-12-06 05:15:17,858 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 106 transitions, 1015 flow [2022-12-06 05:15:17,858 INFO L188 LiptonReduction]: Number of co-enabled transitions 1170 [2022-12-06 05:15:17,861 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:18,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:18,349 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:18,350 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 543 [2022-12-06 05:15:18,350 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 104 transitions, 1007 flow [2022-12-06 05:15:18,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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:15:18,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:18,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:18,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 05:15:18,350 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:18,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:18,351 INFO L85 PathProgramCache]: Analyzing trace with hash -318466196, now seen corresponding path program 1 times [2022-12-06 05:15:18,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:18,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748783815] [2022-12-06 05:15:18,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:18,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:18,463 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:15:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:18,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748783815] [2022-12-06 05:15:18,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748783815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:18,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:18,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:15:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085466484] [2022-12-06 05:15:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:18,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:18,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:15:18,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 104 transitions, 1007 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:15:18,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:18,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:15:18,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:19,260 INFO L130 PetriNetUnfolder]: 4149/6278 cut-off events. [2022-12-06 05:15:19,260 INFO L131 PetriNetUnfolder]: For 16002/16005 co-relation queries the response was YES. [2022-12-06 05:15:19,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22734 conditions, 6278 events. 4149/6278 cut-off events. For 16002/16005 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34956 event pairs, 2020 based on Foata normal form. 2/5460 useless extension candidates. Maximal degree in co-relation 22680. Up to 4864 conditions per place. [2022-12-06 05:15:19,305 INFO L137 encePairwiseOnDemand]: 37/41 looper letters, 102 selfloop transitions, 0 changer transitions 79/182 dead transitions. [2022-12-06 05:15:19,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 182 transitions, 1824 flow [2022-12-06 05:15:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 05:15:19,307 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4975609756097561 [2022-12-06 05:15:19,307 INFO L175 Difference]: Start difference. First operand has 92 places, 104 transitions, 1007 flow. Second operand 5 states and 102 transitions. [2022-12-06 05:15:19,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 182 transitions, 1824 flow [2022-12-06 05:15:19,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 182 transitions, 1742 flow, removed 4 selfloop flow, removed 10 redundant places. [2022-12-06 05:15:19,368 INFO L231 Difference]: Finished difference. Result has 89 places, 103 transitions, 932 flow [2022-12-06 05:15:19,368 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=932, PETRI_PLACES=89, PETRI_TRANSITIONS=103} [2022-12-06 05:15:19,369 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-06 05:15:19,369 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:19,369 INFO L89 Accepts]: Start accepts. Operand has 89 places, 103 transitions, 932 flow [2022-12-06 05:15:19,370 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:19,370 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:19,370 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 103 transitions, 932 flow [2022-12-06 05:15:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 103 transitions, 932 flow [2022-12-06 05:15:19,412 INFO L130 PetriNetUnfolder]: 110/449 cut-off events. [2022-12-06 05:15:19,412 INFO L131 PetriNetUnfolder]: For 856/896 co-relation queries the response was YES. [2022-12-06 05:15:19,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 449 events. 110/449 cut-off events. For 856/896 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3069 event pairs, 5 based on Foata normal form. 8/419 useless extension candidates. Maximal degree in co-relation 1299. Up to 71 conditions per place. [2022-12-06 05:15:19,418 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 103 transitions, 932 flow [2022-12-06 05:15:19,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 1126 [2022-12-06 05:15:19,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:19,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-06 05:15:19,421 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 103 transitions, 932 flow [2022-12-06 05:15:19,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:15:19,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:19,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:19,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 05:15:19,422 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:19,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:19,423 INFO L85 PathProgramCache]: Analyzing trace with hash -631411842, now seen corresponding path program 1 times [2022-12-06 05:15:19,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:19,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169745175] [2022-12-06 05:15:19,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:19,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:19,480 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:15:19,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:19,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169745175] [2022-12-06 05:15:19,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169745175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:19,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:19,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:15:19,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568943578] [2022-12-06 05:15:19,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:19,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:15:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:15:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:15:19,481 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-06 05:15:19,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 103 transitions, 932 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:19,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:19,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-06 05:15:19,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:19,876 INFO L130 PetriNetUnfolder]: 1915/2958 cut-off events. [2022-12-06 05:15:19,876 INFO L131 PetriNetUnfolder]: For 7443/7443 co-relation queries the response was YES. [2022-12-06 05:15:19,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11544 conditions, 2958 events. 1915/2958 cut-off events. For 7443/7443 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14270 event pairs, 821 based on Foata normal form. 228/3112 useless extension candidates. Maximal degree in co-relation 11513. Up to 1500 conditions per place. [2022-12-06 05:15:19,896 INFO L137 encePairwiseOnDemand]: 35/40 looper letters, 47 selfloop transitions, 0 changer transitions 71/118 dead transitions. [2022-12-06 05:15:19,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 118 transitions, 1119 flow [2022-12-06 05:15:19,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:15:19,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:15:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 05:15:19,897 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43125 [2022-12-06 05:15:19,897 INFO L175 Difference]: Start difference. First operand has 85 places, 103 transitions, 932 flow. Second operand 4 states and 69 transitions. [2022-12-06 05:15:19,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 118 transitions, 1119 flow [2022-12-06 05:15:19,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 118 transitions, 1077 flow, removed 13 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:19,926 INFO L231 Difference]: Finished difference. Result has 85 places, 47 transitions, 280 flow [2022-12-06 05:15:19,926 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=85, PETRI_TRANSITIONS=47} [2022-12-06 05:15:19,926 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-06 05:15:19,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:19,926 INFO L89 Accepts]: Start accepts. Operand has 85 places, 47 transitions, 280 flow [2022-12-06 05:15:19,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:19,927 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:19,927 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 47 transitions, 280 flow [2022-12-06 05:15:19,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 47 transitions, 280 flow [2022-12-06 05:15:19,939 INFO L130 PetriNetUnfolder]: 34/122 cut-off events. [2022-12-06 05:15:19,939 INFO L131 PetriNetUnfolder]: For 151/157 co-relation queries the response was YES. [2022-12-06 05:15:19,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 122 events. 34/122 cut-off events. For 151/157 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 453 event pairs, 2 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 310. Up to 21 conditions per place. [2022-12-06 05:15:19,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 47 transitions, 280 flow [2022-12-06 05:15:19,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 410 [2022-12-06 05:15:19,942 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:19,944 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:15:19,944 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 280 flow [2022-12-06 05:15:19,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:19,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:19,944 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:19,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 05:15:19,944 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash 185519706, now seen corresponding path program 1 times [2022-12-06 05:15:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:19,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941564161] [2022-12-06 05:15:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:20,044 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:15:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:20,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941564161] [2022-12-06 05:15:20,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941564161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:20,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:20,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:20,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894462932] [2022-12-06 05:15:20,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:20,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:15:20,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:20,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:15:20,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:15:20,047 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:15:20,047 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:20,047 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:20,047 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:15:20,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:20,328 INFO L130 PetriNetUnfolder]: 1288/1848 cut-off events. [2022-12-06 05:15:20,328 INFO L131 PetriNetUnfolder]: For 4203/4203 co-relation queries the response was YES. [2022-12-06 05:15:20,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6581 conditions, 1848 events. 1288/1848 cut-off events. For 4203/4203 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7338 event pairs, 469 based on Foata normal form. 0/1653 useless extension candidates. Maximal degree in co-relation 6558. Up to 1278 conditions per place. [2022-12-06 05:15:20,340 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 62 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2022-12-06 05:15:20,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 561 flow [2022-12-06 05:15:20,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:15:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:15:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 05:15:20,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32727272727272727 [2022-12-06 05:15:20,341 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 280 flow. Second operand 5 states and 54 transitions. [2022-12-06 05:15:20,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 561 flow [2022-12-06 05:15:20,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 465 flow, removed 48 selfloop flow, removed 12 redundant places. [2022-12-06 05:15:20,352 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2022-12-06 05:15:20,353 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-06 05:15:20,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:20,354 INFO L89 Accepts]: Start accepts. Operand has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,354 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:20,354 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:20,354 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,366 INFO L130 PetriNetUnfolder]: 32/114 cut-off events. [2022-12-06 05:15:20,366 INFO L131 PetriNetUnfolder]: For 68/75 co-relation queries the response was YES. [2022-12-06 05:15:20,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 114 events. 32/114 cut-off events. For 68/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 381 event pairs, 1 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 225. Up to 19 conditions per place. [2022-12-06 05:15:20,368 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,368 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 05:15:20,371 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:20,372 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 05:15:20,372 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 247 flow [2022-12-06 05:15:20,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:20,372 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:20,372 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:20,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 05:15:20,372 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:20,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 960546141, now seen corresponding path program 1 times [2022-12-06 05:15:20,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:20,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116851015] [2022-12-06 05:15:20,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116851015] [2022-12-06 05:15:20,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116851015] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75735386] [2022-12-06 05:15:20,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:20,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:20,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:15:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:21,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 05:15:21,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:21,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:21,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:15:21,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-06 05:15:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75735386] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:23,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:23,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-12-06 05:15:23,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637951320] [2022-12-06 05:15:23,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:23,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 05:15:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 05:15:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-12-06 05:15:23,316 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 05:15:23,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 247 flow. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 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:15:23,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:23,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 05:15:23,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:24,983 INFO L130 PetriNetUnfolder]: 2960/4388 cut-off events. [2022-12-06 05:15:24,984 INFO L131 PetriNetUnfolder]: For 4395/4395 co-relation queries the response was YES. [2022-12-06 05:15:24,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13635 conditions, 4388 events. 2960/4388 cut-off events. For 4395/4395 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21830 event pairs, 467 based on Foata normal form. 75/4224 useless extension candidates. Maximal degree in co-relation 6096. Up to 956 conditions per place. [2022-12-06 05:15:25,009 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 204 selfloop transitions, 34 changer transitions 23/262 dead transitions. [2022-12-06 05:15:25,009 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 262 transitions, 1728 flow [2022-12-06 05:15:25,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 05:15:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 05:15:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 235 transitions. [2022-12-06 05:15:25,011 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3748006379585327 [2022-12-06 05:15:25,011 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 247 flow. Second operand 19 states and 235 transitions. [2022-12-06 05:15:25,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 262 transitions, 1728 flow [2022-12-06 05:15:25,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 262 transitions, 1685 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:25,018 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 558 flow [2022-12-06 05:15:25,018 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=558, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2022-12-06 05:15:25,018 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2022-12-06 05:15:25,018 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:25,018 INFO L89 Accepts]: Start accepts. Operand has 81 places, 74 transitions, 558 flow [2022-12-06 05:15:25,019 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:25,019 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:25,019 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 74 transitions, 558 flow [2022-12-06 05:15:25,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 558 flow [2022-12-06 05:15:25,046 INFO L130 PetriNetUnfolder]: 71/276 cut-off events. [2022-12-06 05:15:25,046 INFO L131 PetriNetUnfolder]: For 412/445 co-relation queries the response was YES. [2022-12-06 05:15:25,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 276 events. 71/276 cut-off events. For 412/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1508 event pairs, 2 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 798. Up to 56 conditions per place. [2022-12-06 05:15:25,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 558 flow [2022-12-06 05:15:25,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-06 05:15:25,053 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:25,320 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1085] L69-6-->thread2EXIT: Formula: (and (let ((.cse0 (= |v_thread2Thread1of1ForFork1_#res.base_17| 0)) (.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_29 256) 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.offset_17| 0))) (or (and .cse0 .cse1 (= (+ v_~n3~0_90 v_~res2~0_74) v_~n1~0_74) .cse2) (and .cse0 (= v_~res2~0_75 v_~res2~0_74) (not .cse2) .cse1))) (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n1~0_74)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_90)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_29, ~n3~0=v_~n3~0_90, ~n1~0=v_~n1~0_74, ~res2~0=v_~res2~0_75} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_17|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_29, ~n3~0=v_~n3~0_90, ~n1~0=v_~n1~0_74, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_17|, ~res2~0=v_~res2~0_74} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:15:25,621 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [941] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_15 0) (= v_~count1~0_33 v_~count3~0_27) (= v_thread2Thread1of1ForFork1_~i~1_33 0)) InVars {~count3~0=v_~count3~0_27, ~count1~0=v_~count1~0_33} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, ~count3~0=v_~count3~0_27, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_15, ~count1~0=v_~count1~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_~stop~1] [2022-12-06 05:15:25,847 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [941] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_15 0) (= v_~count1~0_33 v_~count3~0_27) (= v_thread2Thread1of1ForFork1_~i~1_33 0)) InVars {~count3~0=v_~count3~0_27, ~count1~0=v_~count1~0_33} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, ~count3~0=v_~count3~0_27, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_15, ~count1~0=v_~count1~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_~stop~1] [2022-12-06 05:15:26,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [941] $Ultimate##0-->L69-6: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_15 0) (= v_~count1~0_33 v_~count3~0_27) (= v_thread2Thread1of1ForFork1_~i~1_33 0)) InVars {~count3~0=v_~count3~0_27, ~count1~0=v_~count1~0_33} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, ~count3~0=v_~count3~0_27, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_15, ~count1~0=v_~count1~0_33} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_~stop~1] [2022-12-06 05:15:26,802 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:15:26,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1785 [2022-12-06 05:15:26,803 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 578 flow [2022-12-06 05:15:26,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 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:15:26,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:26,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:26,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:27,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-06 05:15:27,009 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash 410330619, now seen corresponding path program 1 times [2022-12-06 05:15:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:27,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850352155] [2022-12-06 05:15:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:27,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:27,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:27,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850352155] [2022-12-06 05:15:27,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850352155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:27,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:27,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 05:15:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7187298] [2022-12-06 05:15:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:27,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:15:27,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:27,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:15:27,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:15:27,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:15:27,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 578 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:27,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:27,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:15:27,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:28,267 INFO L130 PetriNetUnfolder]: 2816/4194 cut-off events. [2022-12-06 05:15:28,267 INFO L131 PetriNetUnfolder]: For 10052/10058 co-relation queries the response was YES. [2022-12-06 05:15:28,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15740 conditions, 4194 events. 2816/4194 cut-off events. For 10052/10058 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21031 event pairs, 981 based on Foata normal form. 1/3972 useless extension candidates. Maximal degree in co-relation 15700. Up to 1812 conditions per place. [2022-12-06 05:15:28,289 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 105 selfloop transitions, 18 changer transitions 29/153 dead transitions. [2022-12-06 05:15:28,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 153 transitions, 1265 flow [2022-12-06 05:15:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:15:28,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:15:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2022-12-06 05:15:28,290 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34472934472934474 [2022-12-06 05:15:28,290 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 578 flow. Second operand 9 states and 121 transitions. [2022-12-06 05:15:28,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 153 transitions, 1265 flow [2022-12-06 05:15:28,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 1160 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-12-06 05:15:28,341 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 492 flow [2022-12-06 05:15:28,341 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=492, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2022-12-06 05:15:28,341 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-06 05:15:28,342 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:28,342 INFO L89 Accepts]: Start accepts. Operand has 80 places, 68 transitions, 492 flow [2022-12-06 05:15:28,342 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:28,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:28,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 68 transitions, 492 flow [2022-12-06 05:15:28,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 68 transitions, 492 flow [2022-12-06 05:15:28,367 INFO L130 PetriNetUnfolder]: 67/262 cut-off events. [2022-12-06 05:15:28,367 INFO L131 PetriNetUnfolder]: For 324/349 co-relation queries the response was YES. [2022-12-06 05:15:28,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736 conditions, 262 events. 67/262 cut-off events. For 324/349 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1424 event pairs, 2 based on Foata normal form. 4/244 useless extension candidates. Maximal degree in co-relation 706. Up to 48 conditions per place. [2022-12-06 05:15:28,371 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 68 transitions, 492 flow [2022-12-06 05:15:28,371 INFO L188 LiptonReduction]: Number of co-enabled transitions 750 [2022-12-06 05:15:28,372 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:28,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 05:15:28,374 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 492 flow [2022-12-06 05:15:28,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:28,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:28,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:28,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 05:15:28,375 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -238833410, now seen corresponding path program 1 times [2022-12-06 05:15:28,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:28,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350073189] [2022-12-06 05:15:28,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:29,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:29,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:29,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350073189] [2022-12-06 05:15:29,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350073189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:29,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:29,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:15:29,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837322337] [2022-12-06 05:15:29,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:29,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:29,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:29,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:29,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:29,008 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-06 05:15:29,008 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 492 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:15:29,008 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:29,008 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-06 05:15:29,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:30,025 INFO L130 PetriNetUnfolder]: 5440/8069 cut-off events. [2022-12-06 05:15:30,025 INFO L131 PetriNetUnfolder]: For 14376/14382 co-relation queries the response was YES. [2022-12-06 05:15:30,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28176 conditions, 8069 events. 5440/8069 cut-off events. For 14376/14382 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 44667 event pairs, 2452 based on Foata normal form. 7/7632 useless extension candidates. Maximal degree in co-relation 28120. Up to 3908 conditions per place. [2022-12-06 05:15:30,056 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 168 selfloop transitions, 20 changer transitions 12/201 dead transitions. [2022-12-06 05:15:30,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 201 transitions, 1686 flow [2022-12-06 05:15:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:15:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:15:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2022-12-06 05:15:30,058 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 05:15:30,058 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 492 flow. Second operand 8 states and 144 transitions. [2022-12-06 05:15:30,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 201 transitions, 1686 flow [2022-12-06 05:15:30,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 201 transitions, 1588 flow, removed 18 selfloop flow, removed 9 redundant places. [2022-12-06 05:15:30,138 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 723 flow [2022-12-06 05:15:30,138 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=723, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2022-12-06 05:15:30,139 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 41 predicate places. [2022-12-06 05:15:30,139 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:30,139 INFO L89 Accepts]: Start accepts. Operand has 79 places, 86 transitions, 723 flow [2022-12-06 05:15:30,140 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:30,140 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:30,140 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 86 transitions, 723 flow [2022-12-06 05:15:30,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 86 transitions, 723 flow [2022-12-06 05:15:30,186 INFO L130 PetriNetUnfolder]: 132/521 cut-off events. [2022-12-06 05:15:30,186 INFO L131 PetriNetUnfolder]: For 672/744 co-relation queries the response was YES. [2022-12-06 05:15:30,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1425 conditions, 521 events. 132/521 cut-off events. For 672/744 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3546 event pairs, 4 based on Foata normal form. 17/503 useless extension candidates. Maximal degree in co-relation 1382. Up to 93 conditions per place. [2022-12-06 05:15:30,193 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 86 transitions, 723 flow [2022-12-06 05:15:30,193 INFO L188 LiptonReduction]: Number of co-enabled transitions 966 [2022-12-06 05:15:31,329 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:31,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1191 [2022-12-06 05:15:31,330 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 725 flow [2022-12-06 05:15:31,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:15:31,330 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:31,330 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:31,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 05:15:31,331 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:31,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:31,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1715538283, now seen corresponding path program 1 times [2022-12-06 05:15:31,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:31,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898101804] [2022-12-06 05:15:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:31,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:32,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898101804] [2022-12-06 05:15:32,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898101804] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:32,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:32,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553115222] [2022-12-06 05:15:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:32,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:32,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:32,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:32,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:32,022 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 41 [2022-12-06 05:15:32,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 725 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:32,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:32,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 41 [2022-12-06 05:15:32,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:32,885 INFO L130 PetriNetUnfolder]: 5490/8238 cut-off events. [2022-12-06 05:15:32,885 INFO L131 PetriNetUnfolder]: For 14381/14399 co-relation queries the response was YES. [2022-12-06 05:15:32,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28071 conditions, 8238 events. 5490/8238 cut-off events. For 14381/14399 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 46570 event pairs, 2609 based on Foata normal form. 124/7866 useless extension candidates. Maximal degree in co-relation 28014. Up to 6474 conditions per place. [2022-12-06 05:15:32,921 INFO L137 encePairwiseOnDemand]: 28/41 looper letters, 112 selfloop transitions, 20 changer transitions 13/146 dead transitions. [2022-12-06 05:15:32,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 146 transitions, 1278 flow [2022-12-06 05:15:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions. [2022-12-06 05:15:32,922 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37630662020905925 [2022-12-06 05:15:32,923 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 725 flow. Second operand 7 states and 108 transitions. [2022-12-06 05:15:32,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 146 transitions, 1278 flow [2022-12-06 05:15:32,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 146 transitions, 1265 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:32,955 INFO L231 Difference]: Finished difference. Result has 85 places, 92 transitions, 845 flow [2022-12-06 05:15:32,956 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=845, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2022-12-06 05:15:32,956 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-06 05:15:32,956 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:32,956 INFO L89 Accepts]: Start accepts. Operand has 85 places, 92 transitions, 845 flow [2022-12-06 05:15:32,957 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:32,957 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:32,957 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 92 transitions, 845 flow [2022-12-06 05:15:32,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 92 transitions, 845 flow [2022-12-06 05:15:32,993 INFO L130 PetriNetUnfolder]: 133/510 cut-off events. [2022-12-06 05:15:32,993 INFO L131 PetriNetUnfolder]: For 855/917 co-relation queries the response was YES. [2022-12-06 05:15:32,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 510 events. 133/510 cut-off events. For 855/917 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3460 event pairs, 4 based on Foata normal form. 21/499 useless extension candidates. Maximal degree in co-relation 1451. Up to 86 conditions per place. [2022-12-06 05:15:32,999 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 92 transitions, 845 flow [2022-12-06 05:15:32,999 INFO L188 LiptonReduction]: Number of co-enabled transitions 1034 [2022-12-06 05:15:33,004 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1115] L89-6-->L69-6: Formula: (and (let ((.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_83 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_43| 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_43| 0))) (or (and .cse0 (= (+ v_~n3~0_134 v_~res3~0_164) v_~n2~0_132) .cse1 .cse2) (and (not .cse0) .cse1 .cse2 (= v_~res3~0_166 v_~res3~0_164)))) (= v_thread2Thread1of1ForFork1_~i~1_139 0) (= v_~count1~0_97 v_~count3~0_93) (let ((.cse6 (< v_thread3Thread1of1ForFork2_~i~2_91 v_~n2~0_132)) (.cse5 (< v_thread3Thread1of1ForFork2_~i~2_91 v_~n3~0_134))) (or (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_91 4))) (let ((.cse4 (select (select |v_#memory_int_482| v_~get2~0.base_159) (+ v_~get2~0.offset_159 .cse7))) (.cse3 (select (select |v_#memory_int_482| v_~get3~0.base_172) (+ .cse7 v_~get3~0.offset_172)))) (and (not (= .cse3 .cse4)) .cse5 (= v_~res3~0_166 (ite (< .cse4 .cse3) (- 1) 1)) (= v_thread3Thread1of1ForFork2_~stop~2_83 1) .cse6))) (and (or (not .cse6) (not .cse5)) (= |v_thread3Thread1of1ForFork2_#t~mem12_91| |v_thread3Thread1of1ForFork2_#t~mem12_90|) (= |v_thread3Thread1of1ForFork2_#t~mem15_75| |v_thread3Thread1of1ForFork2_#t~mem15_74|) (= v_thread3Thread1of1ForFork2_~stop~2_84 v_thread3Thread1of1ForFork2_~stop~2_83) (= v_~res3~0_166 v_~res3~0_165) (= |v_thread3Thread1of1ForFork2_#t~mem14_75| |v_thread3Thread1of1ForFork2_#t~mem14_74|) (= |v_thread3Thread1of1ForFork2_#t~mem13_95| |v_thread3Thread1of1ForFork2_#t~mem13_94|)))) (= v_thread2Thread1of1ForFork1_~stop~1_67 0)) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_95|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_91|, ~n2~0=v_~n2~0_132, ~get3~0.base=v_~get3~0.base_172, ~count3~0=v_~count3~0_93, ~n3~0=v_~n3~0_134, ~count1~0=v_~count1~0_97, ~get2~0.base=v_~get2~0.base_159, ~get3~0.offset=v_~get3~0.offset_172, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_75|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_91, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_75|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_84, ~get2~0.offset=v_~get2~0.offset_159, #memory_int=|v_#memory_int_482|, ~res3~0=v_~res3~0_165} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_94|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_90|, ~n2~0=v_~n2~0_132, ~get3~0.base=v_~get3~0.base_172, ~count3~0=v_~count3~0_93, ~n3~0=v_~n3~0_134, ~count1~0=v_~count1~0_97, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_43|, ~get2~0.base=v_~get2~0.base_159, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_43|, ~get3~0.offset=v_~get3~0.offset_172, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_74|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_91, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_74|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_139, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_83, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_67, ~get2~0.offset=v_~get2~0.offset_159, #memory_int=|v_#memory_int_482|, ~res3~0=v_~res3~0_164} AuxVars[v_~res3~0_166] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread2Thread1of1ForFork1_~i~1, thread3Thread1of1ForFork2_~stop~2, thread2Thread1of1ForFork1_~stop~1, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1084] L71-1-->thread2EXIT: Formula: (and (= v_thread2Thread1of1ForFork1_~stop~1_27 1) (= v_~res2~0_70 (ite (< |v_thread2Thread1of1ForFork1_#t~mem9_36| (select (select |v_#memory_int_314| v_~get3~0.base_115) (+ (* v_thread2Thread1of1ForFork1_~i~1_79 4) v_~get3~0.offset_115))) (- 1) 1)) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_#t~mem9=|v_thread2Thread1of1ForFork1_#t~mem9_36|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_79, ~get3~0.base=v_~get3~0.base_115, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_27, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, #memory_int=|v_#memory_int_314|, ~get3~0.offset=v_~get3~0.offset_115, ~res2~0=v_~res2~0_70, thread2Thread1of1ForFork1_#t~mem10=|v_thread2Thread1of1ForFork1_#t~mem10_29|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~stop~1, thread2Thread1of1ForFork1_#t~mem9, thread2Thread1of1ForFork1_#res.base, ~res2~0, thread2Thread1of1ForFork1_#t~mem10] [2022-12-06 05:15:33,259 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:33,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 304 [2022-12-06 05:15:33,260 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 92 transitions, 848 flow [2022-12-06 05:15:33,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:33,260 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:33,260 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:33,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-06 05:15:33,261 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:33,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2081251023, now seen corresponding path program 1 times [2022-12-06 05:15:33,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:33,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131830456] [2022-12-06 05:15:33,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:33,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:33,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131830456] [2022-12-06 05:15:33,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131830456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:33,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:33,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:33,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805788960] [2022-12-06 05:15:33,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:33,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:33,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:33,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:33,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:15:33,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 92 transitions, 848 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:33,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:33,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:15:33,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:34,598 INFO L130 PetriNetUnfolder]: 8082/11993 cut-off events. [2022-12-06 05:15:34,598 INFO L131 PetriNetUnfolder]: For 24450/24472 co-relation queries the response was YES. [2022-12-06 05:15:34,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42784 conditions, 11993 events. 8082/11993 cut-off events. For 24450/24472 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 70706 event pairs, 3528 based on Foata normal form. 15/11328 useless extension candidates. Maximal degree in co-relation 42724. Up to 7744 conditions per place. [2022-12-06 05:15:34,648 INFO L137 encePairwiseOnDemand]: 32/42 looper letters, 89 selfloop transitions, 4 changer transitions 123/217 dead transitions. [2022-12-06 05:15:34,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 217 transitions, 2177 flow [2022-12-06 05:15:34,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-06 05:15:34,650 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2022-12-06 05:15:34,650 INFO L175 Difference]: Start difference. First operand has 84 places, 92 transitions, 848 flow. Second operand 7 states and 120 transitions. [2022-12-06 05:15:34,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 217 transitions, 2177 flow [2022-12-06 05:15:34,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 217 transitions, 2155 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:34,816 INFO L231 Difference]: Finished difference. Result has 92 places, 94 transitions, 859 flow [2022-12-06 05:15:34,816 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=859, PETRI_PLACES=92, PETRI_TRANSITIONS=94} [2022-12-06 05:15:34,817 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 05:15:34,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:34,817 INFO L89 Accepts]: Start accepts. Operand has 92 places, 94 transitions, 859 flow [2022-12-06 05:15:34,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:34,818 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:34,818 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 94 transitions, 859 flow [2022-12-06 05:15:34,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 94 transitions, 859 flow [2022-12-06 05:15:34,855 INFO L130 PetriNetUnfolder]: 134/512 cut-off events. [2022-12-06 05:15:34,855 INFO L131 PetriNetUnfolder]: For 898/960 co-relation queries the response was YES. [2022-12-06 05:15:34,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 512 events. 134/512 cut-off events. For 898/960 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3465 event pairs, 4 based on Foata normal form. 21/500 useless extension candidates. Maximal degree in co-relation 1479. Up to 85 conditions per place. [2022-12-06 05:15:34,860 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 94 transitions, 859 flow [2022-12-06 05:15:34,860 INFO L188 LiptonReduction]: Number of co-enabled transitions 1020 [2022-12-06 05:15:34,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1102] L139-6-->L139-14: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_217| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_263|) (= |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_212| 1) (not (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189| 0)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_263| 0)) (= (store |v_#memory_int_441| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189| (store (select |v_#memory_int_441| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189|) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_189| |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_158|)) |v_#memory_int_440|) (= v_~get1~0.base_83 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_190|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_105| v_~n2~0_106) (< |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189| |v_#StackHeapBarrier_94|) (= |v_ULTIMATE.start_create_fresh_int_array_#in~size#1_105| |v_ULTIMATE.start_create_fresh_int_array_~size#1_224|) (= (select |v_#valid_215| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189|) 0) (= (store |v_#length_206| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189| (* (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_224| 1073741824) 4)) |v_#length_205|) (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_158| 2147483648)) (< 0 |v_ULTIMATE.start_create_fresh_int_array_~size#1_224|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_158| 2147483647) (= v_~get1~0.offset_83 |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_190|) (= |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_189| 0) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_217| (ite (<= (mod |v_ULTIMATE.start_create_fresh_int_array_~size#1_224| 4294967296) 1073741823) 1 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_214| |v_ULTIMATE.start_create_fresh_int_array_~size#1_225|)) (= (store |v_#valid_215| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189| 1) |v_#valid_214|)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_190|, #StackHeapBarrier=|v_#StackHeapBarrier_94|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_190|, ~n2~0=v_~n2~0_106, #valid=|v_#valid_215|, #memory_int=|v_#memory_int_441|, #length=|v_#length_206|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_214|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_225|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_189|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_189|, ~n2~0=v_~n2~0_106, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base_159|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_212|, ULTIMATE.start_create_fresh_int_array_#res#1.base=|v_ULTIMATE.start_create_fresh_int_array_#res#1.base_132|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_224|, ~get1~0.base=v_~get1~0.base_83, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_157|, ULTIMATE.start_create_fresh_int_array_#res#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#res#1.offset_132|, #StackHeapBarrier=|v_#StackHeapBarrier_94|, ULTIMATE.start_create_fresh_int_array_#in~size#1=|v_ULTIMATE.start_create_fresh_int_array_#in~size#1_105|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_263|, #valid=|v_#valid_214|, #memory_int=|v_#memory_int_440|, ULTIMATE.start_main_#t~ret22#1.base=|v_ULTIMATE.start_main_#t~ret22#1.base_59|, #length=|v_#length_205|, ULTIMATE.start_main_#t~ret22#1.offset=|v_ULTIMATE.start_main_#t~ret22#1.offset_59|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_127|, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset=|v_ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset_159|, ~get1~0.offset=v_~get1~0.offset_83, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_217|} AuxVars[|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_158|] AssignedVars[ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.base, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#res#1.base, ULTIMATE.start_create_fresh_int_array_~size#1, ~get1~0.base, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, #valid, #memory_int, ULTIMATE.start_main_#t~ret22#1.base, #length, ULTIMATE.start_main_#t~ret22#1.offset, ULTIMATE.start_create_fresh_int_array_#t~post35#1, ULTIMATE.start_create_fresh_int_array_#t~malloc34#1.offset, ~get1~0.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [1047] L139-22-->L139-22: Formula: (and (<= 0 (+ |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_102| 2147483648)) (= (store |v_#memory_int_271| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_131| (store (select |v_#memory_int_271| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_131|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145| 4) |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_131|) |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_102|)) |v_#memory_int_270|) (< |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145| |v_ULTIMATE.start_create_fresh_int_array_~size#1_170|) (= (+ |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~3#1_144|) (<= |v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_102| 2147483647)) InVars {ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_131|, ULTIMATE.start_create_fresh_int_array_#t~nondet36#1=|v_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1_102|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_131|, #memory_int=|v_#memory_int_271|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_145|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_170|} OutVars{ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset_131|, ULTIMATE.start_create_fresh_int_array_~arr~0#1.base=|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_131|, #memory_int=|v_#memory_int_270|, ULTIMATE.start_create_fresh_int_array_~i~3#1=|v_ULTIMATE.start_create_fresh_int_array_~i~3#1_144|, ULTIMATE.start_create_fresh_int_array_#t~post35#1=|v_ULTIMATE.start_create_fresh_int_array_#t~post35#1_75|, ULTIMATE.start_create_fresh_int_array_~size#1=|v_ULTIMATE.start_create_fresh_int_array_~size#1_170|} AuxVars[] AssignedVars[ULTIMATE.start_create_fresh_int_array_#t~nondet36#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~i~3#1, ULTIMATE.start_create_fresh_int_array_#t~post35#1] [2022-12-06 05:15:43,195 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:15:43,197 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8380 [2022-12-06 05:15:43,197 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 93 transitions, 861 flow [2022-12-06 05:15:43,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:43,197 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:43,197 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:43,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-06 05:15:43,197 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:43,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1918000090, now seen corresponding path program 1 times [2022-12-06 05:15:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:43,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269948970] [2022-12-06 05:15:43,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:43,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:43,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269948970] [2022-12-06 05:15:43,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269948970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:43,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:43,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880711809] [2022-12-06 05:15:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:43,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:43,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:43,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:15:43,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 93 transitions, 861 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:43,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:43,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:15:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:44,830 INFO L130 PetriNetUnfolder]: 6662/10130 cut-off events. [2022-12-06 05:15:44,830 INFO L131 PetriNetUnfolder]: For 25150/25172 co-relation queries the response was YES. [2022-12-06 05:15:44,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36782 conditions, 10130 events. 6662/10130 cut-off events. For 25150/25172 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 60467 event pairs, 3525 based on Foata normal form. 86/9613 useless extension candidates. Maximal degree in co-relation 36706. Up to 7742 conditions per place. [2022-12-06 05:15:44,875 INFO L137 encePairwiseOnDemand]: 33/43 looper letters, 155 selfloop transitions, 18 changer transitions 13/187 dead transitions. [2022-12-06 05:15:44,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 187 transitions, 1841 flow [2022-12-06 05:15:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 05:15:44,876 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2022-12-06 05:15:44,876 INFO L175 Difference]: Start difference. First operand has 87 places, 93 transitions, 861 flow. Second operand 7 states and 126 transitions. [2022-12-06 05:15:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 187 transitions, 1841 flow [2022-12-06 05:15:44,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 187 transitions, 1779 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-12-06 05:15:44,937 INFO L231 Difference]: Finished difference. Result has 92 places, 109 transitions, 1173 flow [2022-12-06 05:15:44,937 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1173, PETRI_PLACES=92, PETRI_TRANSITIONS=109} [2022-12-06 05:15:44,937 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-06 05:15:44,937 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:44,937 INFO L89 Accepts]: Start accepts. Operand has 92 places, 109 transitions, 1173 flow [2022-12-06 05:15:44,938 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:44,938 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:44,938 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 109 transitions, 1173 flow [2022-12-06 05:15:44,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 109 transitions, 1173 flow [2022-12-06 05:15:45,003 INFO L130 PetriNetUnfolder]: 156/639 cut-off events. [2022-12-06 05:15:45,004 INFO L131 PetriNetUnfolder]: For 1801/1898 co-relation queries the response was YES. [2022-12-06 05:15:45,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 639 events. 156/639 cut-off events. For 1801/1898 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4758 event pairs, 4 based on Foata normal form. 36/634 useless extension candidates. Maximal degree in co-relation 1943. Up to 100 conditions per place. [2022-12-06 05:15:45,013 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 109 transitions, 1173 flow [2022-12-06 05:15:45,013 INFO L188 LiptonReduction]: Number of co-enabled transitions 1238 [2022-12-06 05:15:45,016 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:45,017 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 80 [2022-12-06 05:15:45,017 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 1173 flow [2022-12-06 05:15:45,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:45,017 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:45,017 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:45,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-06 05:15:45,018 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash 94628112, now seen corresponding path program 2 times [2022-12-06 05:15:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:45,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810564391] [2022-12-06 05:15:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:45,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:45,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:45,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810564391] [2022-12-06 05:15:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810564391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:45,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:45,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:15:45,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852973816] [2022-12-06 05:15:45,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:45,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:15:45,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:45,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:15:45,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:15:45,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:15:45,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 1173 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:45,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:45,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:15:45,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:46,428 INFO L130 PetriNetUnfolder]: 6584/9970 cut-off events. [2022-12-06 05:15:46,428 INFO L131 PetriNetUnfolder]: For 32652/32674 co-relation queries the response was YES. [2022-12-06 05:15:46,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37791 conditions, 9970 events. 6584/9970 cut-off events. For 32652/32674 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 58902 event pairs, 3437 based on Foata normal form. 24/9391 useless extension candidates. Maximal degree in co-relation 37721. Up to 7742 conditions per place. [2022-12-06 05:15:46,479 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 153 selfloop transitions, 18 changer transitions 12/184 dead transitions. [2022-12-06 05:15:46,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 184 transitions, 1872 flow [2022-12-06 05:15:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-06 05:15:46,480 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41836734693877553 [2022-12-06 05:15:46,480 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 1173 flow. Second operand 7 states and 123 transitions. [2022-12-06 05:15:46,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 184 transitions, 1872 flow [2022-12-06 05:15:46,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 184 transitions, 1844 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-06 05:15:46,618 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,619 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1189, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2022-12-06 05:15:46,619 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 58 predicate places. [2022-12-06 05:15:46,619 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:46,619 INFO L89 Accepts]: Start accepts. Operand has 96 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,620 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:46,620 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:46,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,665 INFO L130 PetriNetUnfolder]: 161/638 cut-off events. [2022-12-06 05:15:46,665 INFO L131 PetriNetUnfolder]: For 1841/1938 co-relation queries the response was YES. [2022-12-06 05:15:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2001 conditions, 638 events. 161/638 cut-off events. For 1841/1938 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4696 event pairs, 4 based on Foata normal form. 36/632 useless extension candidates. Maximal degree in co-relation 1947. Up to 105 conditions per place. [2022-12-06 05:15:46,671 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,671 INFO L188 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-06 05:15:46,673 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:46,674 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 55 [2022-12-06 05:15:46,674 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 109 transitions, 1189 flow [2022-12-06 05:15:46,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:15:46,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:46,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:46,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-06 05:15:46,674 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 577071423, now seen corresponding path program 1 times [2022-12-06 05:15:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:46,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857442751] [2022-12-06 05:15:46,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:46,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:46,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857442751] [2022-12-06 05:15:46,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857442751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:46,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:46,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:46,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126764414] [2022-12-06 05:15:46,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:46,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:15:46,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:46,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:15:46,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:15:46,825 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:15:46,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 109 transitions, 1189 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:15:46,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:46,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:15:46,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:47,955 INFO L130 PetriNetUnfolder]: 7901/11969 cut-off events. [2022-12-06 05:15:47,955 INFO L131 PetriNetUnfolder]: For 40337/40359 co-relation queries the response was YES. [2022-12-06 05:15:47,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45409 conditions, 11969 events. 7901/11969 cut-off events. For 40337/40359 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 73325 event pairs, 4090 based on Foata normal form. 12/11237 useless extension candidates. Maximal degree in co-relation 45339. Up to 9535 conditions per place. [2022-12-06 05:15:48,007 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 107 selfloop transitions, 3 changer transitions 96/207 dead transitions. [2022-12-06 05:15:48,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 207 transitions, 2518 flow [2022-12-06 05:15:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:15:48,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:15:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 05:15:48,013 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-06 05:15:48,013 INFO L175 Difference]: Start difference. First operand has 94 places, 109 transitions, 1189 flow. Second operand 6 states and 109 transitions. [2022-12-06 05:15:48,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 207 transitions, 2518 flow [2022-12-06 05:15:48,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 207 transitions, 2482 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:48,126 INFO L231 Difference]: Finished difference. Result has 98 places, 111 transitions, 1185 flow [2022-12-06 05:15:48,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1185, PETRI_PLACES=98, PETRI_TRANSITIONS=111} [2022-12-06 05:15:48,127 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 60 predicate places. [2022-12-06 05:15:48,127 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:48,127 INFO L89 Accepts]: Start accepts. Operand has 98 places, 111 transitions, 1185 flow [2022-12-06 05:15:48,128 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:48,128 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:48,128 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 111 transitions, 1185 flow [2022-12-06 05:15:48,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 111 transitions, 1185 flow [2022-12-06 05:15:48,174 INFO L130 PetriNetUnfolder]: 164/638 cut-off events. [2022-12-06 05:15:48,174 INFO L131 PetriNetUnfolder]: For 1844/1941 co-relation queries the response was YES. [2022-12-06 05:15:48,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 638 events. 164/638 cut-off events. For 1844/1941 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4652 event pairs, 4 based on Foata normal form. 36/632 useless extension candidates. Maximal degree in co-relation 2000. Up to 108 conditions per place. [2022-12-06 05:15:48,179 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 111 transitions, 1185 flow [2022-12-06 05:15:48,179 INFO L188 LiptonReduction]: Number of co-enabled transitions 1246 [2022-12-06 05:15:52,393 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:15:52,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4267 [2022-12-06 05:15:52,394 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 110 transitions, 1183 flow [2022-12-06 05:15:52,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:15:52,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:52,394 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:52,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-06 05:15:52,395 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:52,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:52,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2001756438, now seen corresponding path program 1 times [2022-12-06 05:15:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:52,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909306824] [2022-12-06 05:15:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909306824] [2022-12-06 05:15:52,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909306824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:52,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544939807] [2022-12-06 05:15:52,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:52,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:52,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:15:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:52,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 05:15:52,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:52,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:52,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544939807] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:52,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:52,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:15:52,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507433997] [2022-12-06 05:15:52,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:52,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:15:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:15:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:15:52,739 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:15:52,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 110 transitions, 1183 flow. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:52,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:52,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:15:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:54,384 INFO L130 PetriNetUnfolder]: 10119/14949 cut-off events. [2022-12-06 05:15:54,385 INFO L131 PetriNetUnfolder]: For 46742/46764 co-relation queries the response was YES. [2022-12-06 05:15:54,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56912 conditions, 14949 events. 10119/14949 cut-off events. For 46742/46764 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 91815 event pairs, 3155 based on Foata normal form. 184/14243 useless extension candidates. Maximal degree in co-relation 56818. Up to 6584 conditions per place. [2022-12-06 05:15:54,470 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 335 selfloop transitions, 12 changer transitions 0/348 dead transitions. [2022-12-06 05:15:54,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 348 transitions, 3974 flow [2022-12-06 05:15:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:15:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:15:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 161 transitions. [2022-12-06 05:15:54,472 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5348837209302325 [2022-12-06 05:15:54,472 INFO L175 Difference]: Start difference. First operand has 94 places, 110 transitions, 1183 flow. Second operand 7 states and 161 transitions. [2022-12-06 05:15:54,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 348 transitions, 3974 flow [2022-12-06 05:15:54,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 348 transitions, 3936 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-06 05:15:54,621 INFO L231 Difference]: Finished difference. Result has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,621 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1273, PETRI_PLACES=98, PETRI_TRANSITIONS=119} [2022-12-06 05:15:54,621 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 60 predicate places. [2022-12-06 05:15:54,621 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:54,621 INFO L89 Accepts]: Start accepts. Operand has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,622 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:54,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:54,623 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,692 INFO L130 PetriNetUnfolder]: 232/911 cut-off events. [2022-12-06 05:15:54,692 INFO L131 PetriNetUnfolder]: For 2304/2422 co-relation queries the response was YES. [2022-12-06 05:15:54,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 911 events. 232/911 cut-off events. For 2304/2422 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7354 event pairs, 6 based on Foata normal form. 41/889 useless extension candidates. Maximal degree in co-relation 2766. Up to 155 conditions per place. [2022-12-06 05:15:54,703 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,703 INFO L188 LiptonReduction]: Number of co-enabled transitions 1694 [2022-12-06 05:15:54,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:54,715 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 05:15:54,716 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 119 transitions, 1273 flow [2022-12-06 05:15:54,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:15:54,716 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:54,716 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:54,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:54,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-06 05:15:54,922 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:54,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1276571730, now seen corresponding path program 1 times [2022-12-06 05:15:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:54,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095677456] [2022-12-06 05:15:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:54,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:55,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:55,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095677456] [2022-12-06 05:15:55,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095677456] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:15:55,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462671810] [2022-12-06 05:15:55,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:55,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:55,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:15:55,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:15:55,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:15:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:55,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:15:55,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:15:55,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:55,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:15:55,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:15:55,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462671810] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:15:55,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:15:55,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-12-06 05:15:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352081738] [2022-12-06 05:15:55,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:15:55,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:15:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:15:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:15:55,382 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:15:55,382 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 119 transitions, 1273 flow. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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:15:55,382 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:55,382 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:15:55,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:15:57,915 INFO L130 PetriNetUnfolder]: 12256/17960 cut-off events. [2022-12-06 05:15:57,915 INFO L131 PetriNetUnfolder]: For 57090/57112 co-relation queries the response was YES. [2022-12-06 05:15:57,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73349 conditions, 17960 events. 12256/17960 cut-off events. For 57090/57112 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 111048 event pairs, 3386 based on Foata normal form. 184/17083 useless extension candidates. Maximal degree in co-relation 70539. Up to 3741 conditions per place. [2022-12-06 05:15:58,024 INFO L137 encePairwiseOnDemand]: 34/43 looper letters, 474 selfloop transitions, 27 changer transitions 0/502 dead transitions. [2022-12-06 05:15:58,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 502 transitions, 5391 flow [2022-12-06 05:15:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:15:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:15:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 279 transitions. [2022-12-06 05:15:58,026 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4991055456171735 [2022-12-06 05:15:58,026 INFO L175 Difference]: Start difference. First operand has 98 places, 119 transitions, 1273 flow. Second operand 13 states and 279 transitions. [2022-12-06 05:15:58,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 502 transitions, 5391 flow [2022-12-06 05:15:58,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 502 transitions, 5387 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 05:15:58,303 INFO L231 Difference]: Finished difference. Result has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,303 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1475, PETRI_PLACES=113, PETRI_TRANSITIONS=134} [2022-12-06 05:15:58,304 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 75 predicate places. [2022-12-06 05:15:58,304 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:15:58,304 INFO L89 Accepts]: Start accepts. Operand has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:15:58,305 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:15:58,305 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,385 INFO L130 PetriNetUnfolder]: 260/1029 cut-off events. [2022-12-06 05:15:58,386 INFO L131 PetriNetUnfolder]: For 2683/2807 co-relation queries the response was YES. [2022-12-06 05:15:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 1029 events. 260/1029 cut-off events. For 2683/2807 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8497 event pairs, 8 based on Foata normal form. 42/1006 useless extension candidates. Maximal degree in co-relation 3331. Up to 170 conditions per place. [2022-12-06 05:15:58,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 2216 [2022-12-06 05:15:58,416 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:15:58,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 113 [2022-12-06 05:15:58,417 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 134 transitions, 1475 flow [2022-12-06 05:15:58,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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:15:58,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:15:58,418 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:15:58,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:15:58,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:15:58,625 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:15:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:15:58,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2124663530, now seen corresponding path program 1 times [2022-12-06 05:15:58,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:15:58,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311770855] [2022-12-06 05:15:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:15:58,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:15:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:15:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:15:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:15:58,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311770855] [2022-12-06 05:15:58,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311770855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:15:58,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:15:58,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:15:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630352336] [2022-12-06 05:15:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:15:58,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:15:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:15:58,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:15:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:15:58,760 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:15:58,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 134 transitions, 1475 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:15:58,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:15:58,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:15:58,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:00,933 INFO L130 PetriNetUnfolder]: 12256/18188 cut-off events. [2022-12-06 05:16:00,933 INFO L131 PetriNetUnfolder]: For 71158/71180 co-relation queries the response was YES. [2022-12-06 05:16:00,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78025 conditions, 18188 events. 12256/18188 cut-off events. For 71158/71180 co-relation queries the response was YES. Maximal size of possible extension queue 785. Compared 113009 event pairs, 6612 based on Foata normal form. 12/17124 useless extension candidates. Maximal degree in co-relation 74997. Up to 10523 conditions per place. [2022-12-06 05:16:01,026 INFO L137 encePairwiseOnDemand]: 38/43 looper letters, 168 selfloop transitions, 1 changer transitions 96/266 dead transitions. [2022-12-06 05:16:01,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 266 transitions, 3107 flow [2022-12-06 05:16:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:16:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:16:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-12-06 05:16:01,027 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5503875968992248 [2022-12-06 05:16:01,027 INFO L175 Difference]: Start difference. First operand has 113 places, 134 transitions, 1475 flow. Second operand 6 states and 142 transitions. [2022-12-06 05:16:01,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 266 transitions, 3107 flow [2022-12-06 05:16:01,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 266 transitions, 3078 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:01,264 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,264 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1179, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2022-12-06 05:16:01,265 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 80 predicate places. [2022-12-06 05:16:01,265 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:01,265 INFO L89 Accepts]: Start accepts. Operand has 118 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,266 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:01,266 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:01,266 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,332 INFO L130 PetriNetUnfolder]: 219/895 cut-off events. [2022-12-06 05:16:01,332 INFO L131 PetriNetUnfolder]: For 2059/2147 co-relation queries the response was YES. [2022-12-06 05:16:01,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 895 events. 219/895 cut-off events. For 2059/2147 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7142 event pairs, 7 based on Foata normal form. 27/868 useless extension candidates. Maximal degree in co-relation 2973. Up to 137 conditions per place. [2022-12-06 05:16:01,344 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 1910 [2022-12-06 05:16:01,348 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:01,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 05:16:01,349 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 115 transitions, 1179 flow [2022-12-06 05:16:01,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:16:01,349 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:01,349 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:01,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-06 05:16:01,349 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:01,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash -948605879, now seen corresponding path program 2 times [2022-12-06 05:16:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:01,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536407283] [2022-12-06 05:16:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:16:02,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:02,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536407283] [2022-12-06 05:16:02,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536407283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:02,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:02,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906376208] [2022-12-06 05:16:02,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:02,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:16:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:16:02,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:16:02,002 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:16:02,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 115 transitions, 1179 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:02,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:02,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:16:02,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:03,873 INFO L130 PetriNetUnfolder]: 10903/16043 cut-off events. [2022-12-06 05:16:03,874 INFO L131 PetriNetUnfolder]: For 57539/57557 co-relation queries the response was YES. [2022-12-06 05:16:03,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68002 conditions, 16043 events. 10903/16043 cut-off events. For 57539/57557 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 96104 event pairs, 5565 based on Foata normal form. 7/15110 useless extension candidates. Maximal degree in co-relation 67911. Up to 12889 conditions per place. [2022-12-06 05:16:03,971 INFO L137 encePairwiseOnDemand]: 30/42 looper letters, 180 selfloop transitions, 18 changer transitions 14/213 dead transitions. [2022-12-06 05:16:03,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 213 transitions, 2284 flow [2022-12-06 05:16:03,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-06 05:16:03,972 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 05:16:03,972 INFO L175 Difference]: Start difference. First operand has 114 places, 115 transitions, 1179 flow. Second operand 7 states and 119 transitions. [2022-12-06 05:16:03,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 213 transitions, 2284 flow [2022-12-06 05:16:04,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 213 transitions, 2249 flow, removed 12 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:04,253 INFO L231 Difference]: Finished difference. Result has 119 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1448, PETRI_PLACES=119, PETRI_TRANSITIONS=131} [2022-12-06 05:16:04,253 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-06 05:16:04,254 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:04,254 INFO L89 Accepts]: Start accepts. Operand has 119 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,255 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:04,255 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:04,257 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,347 INFO L130 PetriNetUnfolder]: 219/889 cut-off events. [2022-12-06 05:16:04,347 INFO L131 PetriNetUnfolder]: For 2224/2330 co-relation queries the response was YES. [2022-12-06 05:16:04,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3051 conditions, 889 events. 219/889 cut-off events. For 2224/2330 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7082 event pairs, 7 based on Foata normal form. 35/871 useless extension candidates. Maximal degree in co-relation 2979. Up to 135 conditions per place. [2022-12-06 05:16:04,358 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,358 INFO L188 LiptonReduction]: Number of co-enabled transitions 2038 [2022-12-06 05:16:04,362 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:04,364 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 110 [2022-12-06 05:16:04,364 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 131 transitions, 1448 flow [2022-12-06 05:16:04,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:04,365 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:04,365 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:04,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-06 05:16:04,365 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -468115500, now seen corresponding path program 1 times [2022-12-06 05:16:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:04,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084418426] [2022-12-06 05:16:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:04,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:04,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:16:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:04,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084418426] [2022-12-06 05:16:04,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084418426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:04,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:04,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232281757] [2022-12-06 05:16:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:04,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:16:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:04,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:16:04,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:16:04,925 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-06 05:16:04,925 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 131 transitions, 1448 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:16:04,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:04,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-06 05:16:04,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:06,816 INFO L130 PetriNetUnfolder]: 10893/16159 cut-off events. [2022-12-06 05:16:06,816 INFO L131 PetriNetUnfolder]: For 60475/60493 co-relation queries the response was YES. [2022-12-06 05:16:06,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68279 conditions, 16159 events. 10893/16159 cut-off events. For 60475/60493 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 98242 event pairs, 5980 based on Foata normal form. 222/15392 useless extension candidates. Maximal degree in co-relation 68187. Up to 12889 conditions per place. [2022-12-06 05:16:06,953 INFO L137 encePairwiseOnDemand]: 31/42 looper letters, 179 selfloop transitions, 15 changer transitions 15/210 dead transitions. [2022-12-06 05:16:06,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 210 transitions, 2330 flow [2022-12-06 05:16:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2022-12-06 05:16:06,955 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4013605442176871 [2022-12-06 05:16:06,955 INFO L175 Difference]: Start difference. First operand has 118 places, 131 transitions, 1448 flow. Second operand 7 states and 118 transitions. [2022-12-06 05:16:06,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 210 transitions, 2330 flow [2022-12-06 05:16:07,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 210 transitions, 2286 flow, removed 21 selfloop flow, removed 2 redundant places. [2022-12-06 05:16:07,229 INFO L231 Difference]: Finished difference. Result has 126 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,229 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1553, PETRI_PLACES=126, PETRI_TRANSITIONS=137} [2022-12-06 05:16:07,229 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 88 predicate places. [2022-12-06 05:16:07,230 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:07,230 INFO L89 Accepts]: Start accepts. Operand has 126 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:07,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:07,231 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,320 INFO L130 PetriNetUnfolder]: 214/876 cut-off events. [2022-12-06 05:16:07,320 INFO L131 PetriNetUnfolder]: For 2551/2655 co-relation queries the response was YES. [2022-12-06 05:16:07,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 876 events. 214/876 cut-off events. For 2551/2655 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6988 event pairs, 7 based on Foata normal form. 35/860 useless extension candidates. Maximal degree in co-relation 3003. Up to 135 conditions per place. [2022-12-06 05:16:07,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 2116 [2022-12-06 05:16:07,337 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:07,337 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 107 [2022-12-06 05:16:07,337 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 137 transitions, 1553 flow [2022-12-06 05:16:07,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:16:07,338 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:07,338 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:07,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-06 05:16:07,338 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:07,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash 707303731, now seen corresponding path program 1 times [2022-12-06 05:16:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:07,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5889993] [2022-12-06 05:16:07,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:16:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:07,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5889993] [2022-12-06 05:16:07,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5889993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:07,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:07,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:16:07,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348961242] [2022-12-06 05:16:07,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:07,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:16:07,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:07,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:16:07,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:16:07,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:16:07,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 137 transitions, 1553 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:07,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:07,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:16:07,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:10,521 INFO L130 PetriNetUnfolder]: 18585/26814 cut-off events. [2022-12-06 05:16:10,521 INFO L131 PetriNetUnfolder]: For 112812/112812 co-relation queries the response was YES. [2022-12-06 05:16:10,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113796 conditions, 26814 events. 18585/26814 cut-off events. For 112812/112812 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 163208 event pairs, 8671 based on Foata normal form. 480/25860 useless extension candidates. Maximal degree in co-relation 113677. Up to 10071 conditions per place. [2022-12-06 05:16:10,714 INFO L137 encePairwiseOnDemand]: 34/42 looper letters, 216 selfloop transitions, 13 changer transitions 0/229 dead transitions. [2022-12-06 05:16:10,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 229 transitions, 2741 flow [2022-12-06 05:16:10,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:16:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:16:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 05:16:10,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-06 05:16:10,715 INFO L175 Difference]: Start difference. First operand has 125 places, 137 transitions, 1553 flow. Second operand 5 states and 90 transitions. [2022-12-06 05:16:10,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 229 transitions, 2741 flow [2022-12-06 05:16:11,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 229 transitions, 2724 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-06 05:16:11,182 INFO L231 Difference]: Finished difference. Result has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,183 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1580, PETRI_PLACES=127, PETRI_TRANSITIONS=138} [2022-12-06 05:16:11,183 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 89 predicate places. [2022-12-06 05:16:11,183 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:11,183 INFO L89 Accepts]: Start accepts. Operand has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,184 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:11,184 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:11,184 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,267 INFO L130 PetriNetUnfolder]: 230/1057 cut-off events. [2022-12-06 05:16:11,267 INFO L131 PetriNetUnfolder]: For 2815/2942 co-relation queries the response was YES. [2022-12-06 05:16:11,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3464 conditions, 1057 events. 230/1057 cut-off events. For 2815/2942 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9179 event pairs, 7 based on Foata normal form. 35/1054 useless extension candidates. Maximal degree in co-relation 3313. Up to 165 conditions per place. [2022-12-06 05:16:11,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 2178 [2022-12-06 05:16:11,287 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:11,287 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 104 [2022-12-06 05:16:11,287 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 138 transitions, 1580 flow [2022-12-06 05:16:11,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:11,288 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:11,288 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:11,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-06 05:16:11,288 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -746119233, now seen corresponding path program 1 times [2022-12-06 05:16:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:11,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439322084] [2022-12-06 05:16:11,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:11,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:11,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:11,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439322084] [2022-12-06 05:16:11,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439322084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:11,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:11,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:16:11,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989948551] [2022-12-06 05:16:11,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:11,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:16:11,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:16:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:16:11,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 05:16:11,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 138 transitions, 1580 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:11,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:11,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 05:16:11,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:13,629 INFO L130 PetriNetUnfolder]: 14271/20654 cut-off events. [2022-12-06 05:16:13,629 INFO L131 PetriNetUnfolder]: For 88003/88003 co-relation queries the response was YES. [2022-12-06 05:16:13,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91172 conditions, 20654 events. 14271/20654 cut-off events. For 88003/88003 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 121649 event pairs, 8632 based on Foata normal form. 474/21128 useless extension candidates. Maximal degree in co-relation 90468. Up to 18091 conditions per place. [2022-12-06 05:16:13,794 INFO L137 encePairwiseOnDemand]: 35/42 looper letters, 135 selfloop transitions, 13 changer transitions 33/181 dead transitions. [2022-12-06 05:16:13,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 181 transitions, 2188 flow [2022-12-06 05:16:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:16:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:16:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-06 05:16:13,796 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 05:16:13,796 INFO L175 Difference]: Start difference. First operand has 127 places, 138 transitions, 1580 flow. Second operand 4 states and 74 transitions. [2022-12-06 05:16:13,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 181 transitions, 2188 flow [2022-12-06 05:16:14,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 181 transitions, 2112 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:14,195 INFO L231 Difference]: Finished difference. Result has 124 places, 95 transitions, 923 flow [2022-12-06 05:16:14,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=923, PETRI_PLACES=124, PETRI_TRANSITIONS=95} [2022-12-06 05:16:14,196 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2022-12-06 05:16:14,196 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:14,196 INFO L89 Accepts]: Start accepts. Operand has 124 places, 95 transitions, 923 flow [2022-12-06 05:16:14,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:14,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:14,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 95 transitions, 923 flow [2022-12-06 05:16:14,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 95 transitions, 923 flow [2022-12-06 05:16:14,360 INFO L130 PetriNetUnfolder]: 171/816 cut-off events. [2022-12-06 05:16:14,360 INFO L131 PetriNetUnfolder]: For 1614/1666 co-relation queries the response was YES. [2022-12-06 05:16:14,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2572 conditions, 816 events. 171/816 cut-off events. For 1614/1666 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6592 event pairs, 7 based on Foata normal form. 9/800 useless extension candidates. Maximal degree in co-relation 2516. Up to 121 conditions per place. [2022-12-06 05:16:14,369 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 95 transitions, 923 flow [2022-12-06 05:16:14,369 INFO L188 LiptonReduction]: Number of co-enabled transitions 1466 [2022-12-06 05:16:16,298 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [1085] L69-6-->thread2EXIT: Formula: (and (let ((.cse0 (= |v_thread2Thread1of1ForFork1_#res.base_17| 0)) (.cse2 (= (mod v_thread2Thread1of1ForFork1_~stop~1_29 256) 0)) (.cse1 (= |v_thread2Thread1of1ForFork1_#res.offset_17| 0))) (or (and .cse0 .cse1 (= (+ v_~n3~0_90 v_~res2~0_74) v_~n1~0_74) .cse2) (and .cse0 (= v_~res2~0_75 v_~res2~0_74) (not .cse2) .cse1))) (or (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n1~0_74)) (not (< v_thread2Thread1of1ForFork1_~i~1_81 v_~n3~0_90)))) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_29, ~n3~0=v_~n3~0_90, ~n1~0=v_~n1~0_74, ~res2~0=v_~res2~0_75} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_17|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_81, thread2Thread1of1ForFork1_~stop~1=v_thread2Thread1of1ForFork1_~stop~1_29, ~n3~0=v_~n3~0_90, ~n1~0=v_~n1~0_74, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_17|, ~res2~0=v_~res2~0_74} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, ~res2~0] [2022-12-06 05:16:16,598 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:16:16,598 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2402 [2022-12-06 05:16:16,598 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 94 transitions, 963 flow [2022-12-06 05:16:16,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:16,599 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:16,599 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:16,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-06 05:16:16,599 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash -947206016, now seen corresponding path program 1 times [2022-12-06 05:16:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:16,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265597343] [2022-12-06 05:16:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:16,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:16:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:17,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265597343] [2022-12-06 05:16:17,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265597343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:17,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:17,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 05:16:17,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771006192] [2022-12-06 05:16:17,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:17,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:16:17,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:17,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:16:17,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:16:17,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:17,223 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 94 transitions, 963 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:16:17,223 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:17,223 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:17,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:19,175 INFO L130 PetriNetUnfolder]: 11400/16620 cut-off events. [2022-12-06 05:16:19,176 INFO L131 PetriNetUnfolder]: For 71118/71118 co-relation queries the response was YES. [2022-12-06 05:16:19,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72627 conditions, 16620 events. 11400/16620 cut-off events. For 71118/71118 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 97648 event pairs, 3665 based on Foata normal form. 2/16510 useless extension candidates. Maximal degree in co-relation 71880. Up to 8397 conditions per place. [2022-12-06 05:16:19,300 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 113 selfloop transitions, 15 changer transitions 69/198 dead transitions. [2022-12-06 05:16:19,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 198 transitions, 2071 flow [2022-12-06 05:16:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:16:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:16:19,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2022-12-06 05:16:19,301 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3178294573643411 [2022-12-06 05:16:19,301 INFO L175 Difference]: Start difference. First operand has 113 places, 94 transitions, 963 flow. Second operand 9 states and 123 transitions. [2022-12-06 05:16:19,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 198 transitions, 2071 flow [2022-12-06 05:16:19,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 198 transitions, 1953 flow, removed 50 selfloop flow, removed 12 redundant places. [2022-12-06 05:16:19,571 INFO L231 Difference]: Finished difference. Result has 111 places, 88 transitions, 813 flow [2022-12-06 05:16:19,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=813, PETRI_PLACES=111, PETRI_TRANSITIONS=88} [2022-12-06 05:16:19,572 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 73 predicate places. [2022-12-06 05:16:19,572 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:19,572 INFO L89 Accepts]: Start accepts. Operand has 111 places, 88 transitions, 813 flow [2022-12-06 05:16:19,573 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:19,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:19,573 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 88 transitions, 813 flow [2022-12-06 05:16:19,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 88 transitions, 813 flow [2022-12-06 05:16:19,748 INFO L130 PetriNetUnfolder]: 158/719 cut-off events. [2022-12-06 05:16:19,748 INFO L131 PetriNetUnfolder]: For 1257/1317 co-relation queries the response was YES. [2022-12-06 05:16:19,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2331 conditions, 719 events. 158/719 cut-off events. For 1257/1317 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5543 event pairs, 5 based on Foata normal form. 9/702 useless extension candidates. Maximal degree in co-relation 2265. Up to 104 conditions per place. [2022-12-06 05:16:19,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 88 transitions, 813 flow [2022-12-06 05:16:19,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 1350 [2022-12-06 05:16:20,101 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:20,102 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 530 [2022-12-06 05:16:20,102 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 809 flow [2022-12-06 05:16:20,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:16:20,102 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:20,102 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:20,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-06 05:16:20,103 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 255496235, now seen corresponding path program 1 times [2022-12-06 05:16:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:20,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089450897] [2022-12-06 05:16:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 05:16:20,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:20,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089450897] [2022-12-06 05:16:20,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089450897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:16:20,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:16:20,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 05:16:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040156854] [2022-12-06 05:16:20,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:16:20,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 05:16:20,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:20,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 05:16:20,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 05:16:20,268 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:20,268 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 809 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:16:20,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:20,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:20,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:22,551 INFO L130 PetriNetUnfolder]: 14716/21458 cut-off events. [2022-12-06 05:16:22,551 INFO L131 PetriNetUnfolder]: For 82528/82528 co-relation queries the response was YES. [2022-12-06 05:16:22,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94555 conditions, 21458 events. 14716/21458 cut-off events. For 82528/82528 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 130899 event pairs, 7796 based on Foata normal form. 7/21385 useless extension candidates. Maximal degree in co-relation 94469. Up to 10667 conditions per place. [2022-12-06 05:16:22,825 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 121 selfloop transitions, 3 changer transitions 109/234 dead transitions. [2022-12-06 05:16:22,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 234 transitions, 2478 flow [2022-12-06 05:16:22,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:16:22,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:16:22,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2022-12-06 05:16:22,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4950166112956811 [2022-12-06 05:16:22,826 INFO L175 Difference]: Start difference. First operand has 101 places, 87 transitions, 809 flow. Second operand 7 states and 149 transitions. [2022-12-06 05:16:22,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 234 transitions, 2478 flow [2022-12-06 05:16:23,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 234 transitions, 2332 flow, removed 51 selfloop flow, removed 8 redundant places. [2022-12-06 05:16:23,269 INFO L231 Difference]: Finished difference. Result has 103 places, 88 transitions, 791 flow [2022-12-06 05:16:23,270 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=791, PETRI_PLACES=103, PETRI_TRANSITIONS=88} [2022-12-06 05:16:23,270 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 65 predicate places. [2022-12-06 05:16:23,270 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:23,270 INFO L89 Accepts]: Start accepts. Operand has 103 places, 88 transitions, 791 flow [2022-12-06 05:16:23,271 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:23,271 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:23,271 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 88 transitions, 791 flow [2022-12-06 05:16:23,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 88 transitions, 791 flow [2022-12-06 05:16:23,325 INFO L130 PetriNetUnfolder]: 157/725 cut-off events. [2022-12-06 05:16:23,325 INFO L131 PetriNetUnfolder]: For 1110/1176 co-relation queries the response was YES. [2022-12-06 05:16:23,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 725 events. 157/725 cut-off events. For 1110/1176 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5606 event pairs, 4 based on Foata normal form. 4/702 useless extension candidates. Maximal degree in co-relation 2139. Up to 98 conditions per place. [2022-12-06 05:16:23,333 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 88 transitions, 791 flow [2022-12-06 05:16:23,333 INFO L188 LiptonReduction]: Number of co-enabled transitions 1328 [2022-12-06 05:16:23,702 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:16:23,703 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 433 [2022-12-06 05:16:23,703 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 787 flow [2022-12-06 05:16:23,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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:16:23,703 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:23,703 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:23,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-06 05:16:23,704 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 857062906, now seen corresponding path program 1 times [2022-12-06 05:16:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909333499] [2022-12-06 05:16:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:23,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:23,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909333499] [2022-12-06 05:16:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909333499] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:23,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938046081] [2022-12-06 05:16:23,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:23,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:23,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:23,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:16:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:16:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:24,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:16:24,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:16:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:24,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:16:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:24,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938046081] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:16:24,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:16:24,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-12-06 05:16:24,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489306447] [2022-12-06 05:16:24,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:16:24,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:16:24,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:16:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:16:24,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:16:24,188 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 43 [2022-12-06 05:16:24,188 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 787 flow. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:24,188 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:16:24,188 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 43 [2022-12-06 05:16:24,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:16:26,038 INFO L130 PetriNetUnfolder]: 11969/17284 cut-off events. [2022-12-06 05:16:26,038 INFO L131 PetriNetUnfolder]: For 52547/52547 co-relation queries the response was YES. [2022-12-06 05:16:26,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70485 conditions, 17284 events. 11969/17284 cut-off events. For 52547/52547 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 101683 event pairs, 3807 based on Foata normal form. 182/17414 useless extension candidates. Maximal degree in co-relation 70401. Up to 7216 conditions per place. [2022-12-06 05:16:26,148 INFO L137 encePairwiseOnDemand]: 35/43 looper letters, 250 selfloop transitions, 21 changer transitions 0/272 dead transitions. [2022-12-06 05:16:26,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 272 transitions, 2743 flow [2022-12-06 05:16:26,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:16:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:16:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2022-12-06 05:16:26,149 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2022-12-06 05:16:26,149 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 787 flow. Second operand 10 states and 178 transitions. [2022-12-06 05:16:26,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 272 transitions, 2743 flow [2022-12-06 05:16:26,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 272 transitions, 2711 flow, removed 15 selfloop flow, removed 6 redundant places. [2022-12-06 05:16:26,378 INFO L231 Difference]: Finished difference. Result has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,378 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=834, PETRI_PLACES=104, PETRI_TRANSITIONS=89} [2022-12-06 05:16:26,378 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-06 05:16:26,378 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:16:26,379 INFO L89 Accepts]: Start accepts. Operand has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,379 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:16:26,379 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:16:26,379 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,433 INFO L130 PetriNetUnfolder]: 157/740 cut-off events. [2022-12-06 05:16:26,434 INFO L131 PetriNetUnfolder]: For 1168/1234 co-relation queries the response was YES. [2022-12-06 05:16:26,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 740 events. 157/740 cut-off events. For 1168/1234 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5730 event pairs, 4 based on Foata normal form. 4/717 useless extension candidates. Maximal degree in co-relation 2143. Up to 98 conditions per place. [2022-12-06 05:16:26,442 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,442 INFO L188 LiptonReduction]: Number of co-enabled transitions 1456 [2022-12-06 05:16:26,449 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:16:26,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-06 05:16:26,450 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 89 transitions, 834 flow [2022-12-06 05:16:26,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:16:26,450 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:16:26,451 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:16:26,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:16:26,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:26,656 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:16:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:16:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash -940306578, now seen corresponding path program 1 times [2022-12-06 05:16:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:16:26,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905370059] [2022-12-06 05:16:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:26,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:16:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:16:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905370059] [2022-12-06 05:16:28,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905370059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:16:28,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294996483] [2022-12-06 05:16:28,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:16:28,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:16:28,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:16:28,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:16:28,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:16:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:16:28,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-06 05:16:28,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:16:28,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:16:28,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:16:28,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:16:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:16:28,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:16:28,637 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:16:28,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2022-12-06 05:16:28,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:16:28,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:16:31,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:31,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 152 [2022-12-06 05:16:31,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:31,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 17315 treesize of output 16357 [2022-12-06 05:16:31,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:31,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16323 treesize of output 16060 [2022-12-06 05:16:31,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:31,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16035 treesize of output 15020 [2022-12-06 05:16:32,232 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:32,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15011 treesize of output 14460 [2022-12-06 05:16:32,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:32,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14435 treesize of output 13692 [2022-12-06 05:16:32,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:32,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13667 treesize of output 13276 [2022-12-06 05:16:32,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:16:32,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13251 treesize of output 13068 [2022-12-06 05:22:42,305 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 05:22:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:42,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294996483] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:42,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:42,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2022-12-06 05:22:42,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640533425] [2022-12-06 05:22:42,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:42,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 05:22:42,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:42,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 05:22:42,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=884, Unknown=15, NotChecked=0, Total=1056 [2022-12-06 05:22:42,348 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 43 [2022-12-06 05:22:42,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 89 transitions, 834 flow. Second operand has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:42,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:42,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 43 [2022-12-06 05:22:42,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:46,603 INFO L130 PetriNetUnfolder]: 18750/26737 cut-off events. [2022-12-06 05:22:46,603 INFO L131 PetriNetUnfolder]: For 85848/85848 co-relation queries the response was YES. [2022-12-06 05:22:46,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110192 conditions, 26737 events. 18750/26737 cut-off events. For 85848/85848 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 161145 event pairs, 4128 based on Foata normal form. 146/26883 useless extension candidates. Maximal degree in co-relation 100004. Up to 8345 conditions per place. [2022-12-06 05:22:46,846 INFO L137 encePairwiseOnDemand]: 29/43 looper letters, 255 selfloop transitions, 25 changer transitions 0/280 dead transitions. [2022-12-06 05:22:46,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 280 transitions, 2465 flow [2022-12-06 05:22:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:22:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:22:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2022-12-06 05:22:46,848 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3643410852713178 [2022-12-06 05:22:46,848 INFO L175 Difference]: Start difference. First operand has 104 places, 89 transitions, 834 flow. Second operand 12 states and 188 transitions. [2022-12-06 05:22:46,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 280 transitions, 2465 flow [2022-12-06 05:22:47,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 280 transitions, 2411 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-06 05:22:47,260 INFO L231 Difference]: Finished difference. Result has 117 places, 100 transitions, 990 flow [2022-12-06 05:22:47,260 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=990, PETRI_PLACES=117, PETRI_TRANSITIONS=100} [2022-12-06 05:22:47,260 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 79 predicate places. [2022-12-06 05:22:47,260 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:47,260 INFO L89 Accepts]: Start accepts. Operand has 117 places, 100 transitions, 990 flow [2022-12-06 05:22:47,261 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:47,261 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:47,261 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 100 transitions, 990 flow [2022-12-06 05:22:47,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 100 transitions, 990 flow [2022-12-06 05:22:47,338 INFO L130 PetriNetUnfolder]: 214/996 cut-off events. [2022-12-06 05:22:47,338 INFO L131 PetriNetUnfolder]: For 2187/2262 co-relation queries the response was YES. [2022-12-06 05:22:47,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 996 events. 214/996 cut-off events. For 2187/2262 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8475 event pairs, 7 based on Foata normal form. 4/963 useless extension candidates. Maximal degree in co-relation 3031. Up to 141 conditions per place. [2022-12-06 05:22:47,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 100 transitions, 990 flow [2022-12-06 05:22:47,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 1728 [2022-12-06 05:22:47,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [971] L70-1-->L71: Formula: (not (= (select (select |v_#memory_int_160| v_~get3~0.base_39) (+ v_~get3~0.offset_39 (* v_thread2Thread1of1ForFork1_~i~1_37 4))) |v_thread2Thread1of1ForFork1_#t~mem7_24|)) InVars {thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_24|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~get3~0.base=v_~get3~0.base_39, #memory_int=|v_#memory_int_160|, ~get3~0.offset=v_~get3~0.offset_39} OutVars{thread2Thread1of1ForFork1_#t~mem8=|v_thread2Thread1of1ForFork1_#t~mem8_23|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_37, ~get3~0.base=v_~get3~0.base_39, #memory_int=|v_#memory_int_160|, ~get3~0.offset=v_~get3~0.offset_39} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7, thread2Thread1of1ForFork1_#t~mem8] and [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] [2022-12-06 05:22:47,534 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:22:47,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-06 05:22:47,535 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 99 transitions, 998 flow [2022-12-06 05:22:47,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 32 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:22:47,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:47,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:47,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:22:47,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:47,736 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:47,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:47,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1533999884, now seen corresponding path program 2 times [2022-12-06 05:22:47,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:47,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547594506] [2022-12-06 05:22:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:22:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:48,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:22:48,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547594506] [2022-12-06 05:22:48,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547594506] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:22:48,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770084538] [2022-12-06 05:22:48,342 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:22:48,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:22:48,343 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:22:48,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:22:48,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:22:48,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:22:48,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:22:48,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:22:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:48,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:22:49,236 INFO L321 Elim1Store]: treesize reduction 26, result has 87.8 percent of original size [2022-12-06 05:22:49,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 52 treesize of output 198 [2022-12-06 05:22:51,350 INFO L321 Elim1Store]: treesize reduction 88, result has 4.3 percent of original size [2022-12-06 05:22:51,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 13 [2022-12-06 05:22:51,375 INFO L321 Elim1Store]: treesize reduction 88, result has 4.3 percent of original size [2022-12-06 05:22:51,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 13 [2022-12-06 05:22:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:22:51,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770084538] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:22:51,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:22:51,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2022-12-06 05:22:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641656206] [2022-12-06 05:22:51,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:22:51,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 05:22:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:22:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 05:22:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-12-06 05:22:51,504 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 48 [2022-12-06 05:22:51,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 99 transitions, 998 flow. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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:22:51,505 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:22:51,505 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 48 [2022-12-06 05:22:51,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:22:55,619 INFO L130 PetriNetUnfolder]: 20622/29317 cut-off events. [2022-12-06 05:22:55,619 INFO L131 PetriNetUnfolder]: For 140849/140849 co-relation queries the response was YES. [2022-12-06 05:22:55,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132192 conditions, 29317 events. 20622/29317 cut-off events. For 140849/140849 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 176702 event pairs, 9508 based on Foata normal form. 40/29357 useless extension candidates. Maximal degree in co-relation 117488. Up to 15023 conditions per place. [2022-12-06 05:22:55,935 INFO L137 encePairwiseOnDemand]: 32/48 looper letters, 277 selfloop transitions, 63 changer transitions 17/357 dead transitions. [2022-12-06 05:22:55,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 357 transitions, 3370 flow [2022-12-06 05:22:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 05:22:55,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 05:22:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 262 transitions. [2022-12-06 05:22:55,936 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25992063492063494 [2022-12-06 05:22:55,936 INFO L175 Difference]: Start difference. First operand has 116 places, 99 transitions, 998 flow. Second operand 21 states and 262 transitions. [2022-12-06 05:22:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 357 transitions, 3370 flow [2022-12-06 05:22:57,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 357 transitions, 3167 flow, removed 71 selfloop flow, removed 6 redundant places. [2022-12-06 05:22:57,792 INFO L231 Difference]: Finished difference. Result has 141 places, 144 transitions, 1584 flow [2022-12-06 05:22:57,793 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1584, PETRI_PLACES=141, PETRI_TRANSITIONS=144} [2022-12-06 05:22:57,793 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 103 predicate places. [2022-12-06 05:22:57,793 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:22:57,793 INFO L89 Accepts]: Start accepts. Operand has 141 places, 144 transitions, 1584 flow [2022-12-06 05:22:57,794 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:22:57,794 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:22:57,794 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 144 transitions, 1584 flow [2022-12-06 05:22:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 144 transitions, 1584 flow [2022-12-06 05:22:57,961 INFO L130 PetriNetUnfolder]: 515/1865 cut-off events. [2022-12-06 05:22:57,962 INFO L131 PetriNetUnfolder]: For 6377/6556 co-relation queries the response was YES. [2022-12-06 05:22:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7054 conditions, 1865 events. 515/1865 cut-off events. For 6377/6556 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17516 event pairs, 27 based on Foata normal form. 5/1797 useless extension candidates. Maximal degree in co-relation 6554. Up to 295 conditions per place. [2022-12-06 05:22:57,990 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 144 transitions, 1584 flow [2022-12-06 05:22:57,990 INFO L188 LiptonReduction]: Number of co-enabled transitions 2208 [2022-12-06 05:22:58,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [1059] L121-4-->L122-3: Formula: (and (= (+ |v_#pthreadsForks_161| 1) |v_#pthreadsForks_160|) (= |v_#memory_int_302| (store |v_#memory_int_303| |v_ULTIMATE.start_main_~#t3~0#1.base_67| (store (select |v_#memory_int_303| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) |v_ULTIMATE.start_main_~#t3~0#1.offset_67| |v_ULTIMATE.start_main_#t~pre29#1_63|))) (= |v_ULTIMATE.start_main_#t~pre29#1_63| |v_#pthreadsForks_161|)) InVars {#pthreadsForks=|v_#pthreadsForks_161|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, #memory_int=|v_#memory_int_303|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, #pthreadsForks=|v_#pthreadsForks_160|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, #memory_int=|v_#memory_int_302|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_55|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:22:58,071 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:58,102 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:58,172 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [1059] L121-4-->L122-3: Formula: (and (= (+ |v_#pthreadsForks_161| 1) |v_#pthreadsForks_160|) (= |v_#memory_int_302| (store |v_#memory_int_303| |v_ULTIMATE.start_main_~#t3~0#1.base_67| (store (select |v_#memory_int_303| |v_ULTIMATE.start_main_~#t3~0#1.base_67|) |v_ULTIMATE.start_main_~#t3~0#1.offset_67| |v_ULTIMATE.start_main_#t~pre29#1_63|))) (= |v_ULTIMATE.start_main_#t~pre29#1_63| |v_#pthreadsForks_161|)) InVars {#pthreadsForks=|v_#pthreadsForks_161|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, #memory_int=|v_#memory_int_303|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|} OutVars{ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_63|, #pthreadsForks=|v_#pthreadsForks_160|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_67|, #memory_int=|v_#memory_int_302|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_67|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_55|, ULTIMATE.start_main_#t~nondet28#1=|v_ULTIMATE.start_main_#t~nondet28#1_53|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet28#1] [2022-12-06 05:22:58,204 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1035] L69-6-->L70-1: Formula: (and (= (select (select |v_#memory_int_258| v_~get1~0.base_29) (+ v_~get1~0.offset_29 (* v_thread2Thread1of1ForFork1_~i~1_67 4))) |v_thread2Thread1of1ForFork1_#t~mem7_59|) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n1~0_50) (< v_thread2Thread1of1ForFork1_~i~1_67 v_~n3~0_60)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} OutVars{thread2Thread1of1ForFork1_#t~mem7=|v_thread2Thread1of1ForFork1_#t~mem7_59|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_67, ~n3~0=v_~n3~0_60, ~n1~0=v_~n1~0_50, #memory_int=|v_#memory_int_258|, ~get1~0.offset=v_~get1~0.offset_29, ~get1~0.base=v_~get1~0.base_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem7] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:58,295 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [976] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_15 0) (= v_thread3Thread1of1ForFork2_~i~2_43 0) (= v_~count2~0_35 v_~count3~0_37)) InVars {~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_15, ~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:58,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [976] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_15 0) (= v_thread3Thread1of1ForFork2_~i~2_43 0) (= v_~count2~0_35 v_~count3~0_37)) InVars {~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_15, ~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:58,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1080] L89-6-->thread3EXIT: Formula: (and (let ((.cse1 (= |v_thread3Thread1of1ForFork2_#res.base_13| 0)) (.cse0 (= (mod v_thread3Thread1of1ForFork2_~stop~2_27 256) 0)) (.cse2 (= |v_thread3Thread1of1ForFork2_#res.offset_13| 0))) (or (and .cse0 .cse1 (= v_~n2~0_84 (+ v_~n3~0_84 v_~res3~0_62)) .cse2) (and (= v_~res3~0_63 v_~res3~0_62) .cse1 (not .cse0) .cse2))) (let ((.cse4 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n2~0_84)) (.cse3 (< v_thread3Thread1of1ForFork2_~i~2_65 v_~n3~0_84))) (or (and (= v_~res3~0_64 v_~res3~0_63) (or (not .cse3) (not .cse4)) (= |v_thread3Thread1of1ForFork2_#t~mem13_48| |v_thread3Thread1of1ForFork2_#t~mem13_47|) (= v_thread3Thread1of1ForFork2_~stop~2_28 v_thread3Thread1of1ForFork2_~stop~2_27) (= |v_thread3Thread1of1ForFork2_#t~mem12_44| |v_thread3Thread1of1ForFork2_#t~mem12_43|) (= |v_thread3Thread1of1ForFork2_#t~mem15_28| |v_thread3Thread1of1ForFork2_#t~mem15_27|) (= |v_thread3Thread1of1ForFork2_#t~mem14_28| |v_thread3Thread1of1ForFork2_#t~mem14_27|)) (let ((.cse7 (* v_thread3Thread1of1ForFork2_~i~2_65 4))) (let ((.cse5 (select (select |v_#memory_int_308| v_~get2~0.base_95) (+ v_~get2~0.offset_95 .cse7))) (.cse6 (select (select |v_#memory_int_308| v_~get3~0.base_111) (+ v_~get3~0.offset_111 .cse7)))) (and (= v_~res3~0_63 (ite (< .cse5 .cse6) (- 1) 1)) (not (= .cse5 .cse6)) (= v_thread3Thread1of1ForFork2_~stop~2_27 1) .cse4 .cse3)))))) InVars {thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_48|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_44|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, ~get2~0.base=v_~get2~0.base_95, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_28|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_28|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_28, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_64} OutVars{thread3Thread1of1ForFork2_#t~mem13=|v_thread3Thread1of1ForFork2_#t~mem13_47|, thread3Thread1of1ForFork2_#t~mem12=|v_thread3Thread1of1ForFork2_#t~mem12_43|, ~n2~0=v_~n2~0_84, ~get3~0.base=v_~get3~0.base_111, ~n3~0=v_~n3~0_84, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_13|, ~get2~0.base=v_~get2~0.base_95, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_13|, ~get3~0.offset=v_~get3~0.offset_111, thread3Thread1of1ForFork2_#t~mem15=|v_thread3Thread1of1ForFork2_#t~mem15_27|, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_65, thread3Thread1of1ForFork2_#t~mem14=|v_thread3Thread1of1ForFork2_#t~mem14_27|, thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_27, ~get2~0.offset=v_~get2~0.offset_95, #memory_int=|v_#memory_int_308|, ~res3~0=v_~res3~0_62} AuxVars[v_~res3~0_63] AssignedVars[thread3Thread1of1ForFork2_#t~mem13, thread3Thread1of1ForFork2_#t~mem12, thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base, thread3Thread1of1ForFork2_#t~mem15, thread3Thread1of1ForFork2_#t~mem14, ~res3~0] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:59,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [976] $Ultimate##0-->L89-6: Formula: (and (= v_thread3Thread1of1ForFork2_~stop~2_15 0) (= v_thread3Thread1of1ForFork2_~i~2_43 0) (= v_~count2~0_35 v_~count3~0_37)) InVars {~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35} OutVars{thread3Thread1of1ForFork2_~stop~2=v_thread3Thread1of1ForFork2_~stop~2_15, ~count3~0=v_~count3~0_37, ~count2~0=v_~count2~0_35, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_43} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_~stop~2, thread3Thread1of1ForFork2_~i~2] and [986] L50-1-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_55 (+ v_thread1Thread1of1ForFork0_~i~0_56 1)) (= (select (select |v_#memory_int_170| v_~get2~0.base_39) (+ v_~get2~0.offset_39 (* v_thread1Thread1of1ForFork0_~i~0_56 4))) |v_thread1Thread1of1ForFork0_#t~mem2_34|)) InVars {thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_34|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_56, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} OutVars{thread1Thread1of1ForFork0_#t~mem3=|v_thread1Thread1of1ForFork0_#t~mem3_33|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_19|, ~get2~0.offset=v_~get2~0.offset_39, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_55, #memory_int=|v_#memory_int_170|, ~get2~0.base=v_~get2~0.base_39} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_#t~mem3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_~i~0] [2022-12-06 05:22:59,548 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:22:59,549 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1756 [2022-12-06 05:22:59,549 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 140 transitions, 1694 flow [2022-12-06 05:22:59,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 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:22:59,549 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:22:59,549 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:22:59,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:22:59,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:22:59,756 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:22:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:22:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash 620672751, now seen corresponding path program 1 times [2022-12-06 05:22:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:22:59,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966583005] [2022-12-06 05:22:59,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:22:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:22:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:00,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:23:00,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966583005] [2022-12-06 05:23:00,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966583005] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:23:00,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541641335] [2022-12-06 05:23:00,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:23:00,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:23:00,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:23:00,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:23:00,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:23:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:23:00,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-06 05:23:00,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:23:00,637 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-06 05:23:00,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1001 treesize of output 981 [2022-12-06 05:23:00,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 05:23:00,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:23:00,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:23:01,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-06 05:23:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:23:01,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:23:02,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 152 [2022-12-06 05:23:02,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16195 treesize of output 15301 [2022-12-06 05:23:02,387 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15267 treesize of output 14764 [2022-12-06 05:23:02,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14755 treesize of output 14636 [2022-12-06 05:23:02,647 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14611 treesize of output 14348 [2022-12-06 05:23:02,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 14323 treesize of output 13708 [2022-12-06 05:23:02,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:02,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 13683 treesize of output 12556 [2022-12-06 05:23:03,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:23:03,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 12531 treesize of output 12236 Received shutdown request... [2022-12-06 05:27:45,106 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-06 05:27:45,107 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:27:45,112 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 05:27:45,113 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 05:27:45,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 05:27:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:27:45,313 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 34ms.. [2022-12-06 05:27:45,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:27:45,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:27:45,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:27:45,315 INFO L458 BasicCegarLoop]: Path program histogram: [6, 4, 3, 2, 2, 2, 2, 2, 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 05:27:45,317 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:27:45,318 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:27:45,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:27:45 BasicIcfg [2022-12-06 05:27:45,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:27:45,322 INFO L158 Benchmark]: Toolchain (without parser) took 794378.36ms. Allocated memory was 127.9MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 82.4MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-12-06 05:27:45,322 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:27:45,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.37ms. Allocated memory was 127.9MB in the beginning and 173.0MB in the end (delta: 45.1MB). Free memory was 82.0MB in the beginning and 148.4MB in the end (delta: -66.4MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. [2022-12-06 05:27:45,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.14ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:27:45,323 INFO L158 Benchmark]: Boogie Preprocessor took 43.95ms. Allocated memory is still 173.0MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:27:45,323 INFO L158 Benchmark]: RCFGBuilder took 647.02ms. Allocated memory is still 173.0MB. Free memory was 144.2MB in the beginning and 120.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 05:27:45,323 INFO L158 Benchmark]: TraceAbstraction took 793245.14ms. Allocated memory was 173.0MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 120.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2022-12-06 05:27:45,324 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.15ms. Allocated memory is still 127.9MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 369.37ms. Allocated memory was 127.9MB in the beginning and 173.0MB in the end (delta: 45.1MB). Free memory was 82.0MB in the beginning and 148.4MB in the end (delta: -66.4MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.14ms. Allocated memory is still 173.0MB. Free memory was 148.4MB in the beginning and 146.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.95ms. Allocated memory is still 173.0MB. Free memory was 146.3MB in the beginning and 144.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 647.02ms. Allocated memory is still 173.0MB. Free memory was 144.2MB in the beginning and 120.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 793245.14ms. Allocated memory was 173.0MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 120.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 256 PlacesBefore, 38 PlacesAfterwards, 275 TransitionsBefore, 39 TransitionsAfterwards, 7560 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 143 TrivialYvCompositions, 75 ConcurrentYvCompositions, 17 ChoiceCompositions, 235 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 5189, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 74, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5253, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4551, unknown conditional: 0, unknown unconditional: 4551] , Statistics on independence cache: Total cache size (in pairs): 7944, Positive cache size: 7902, Positive conditional cache size: 0, Positive unconditional cache size: 7902, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 34, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 42, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 40, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 50, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 50, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 50, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 26, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 27, independent conditional: 0, independent unconditional: 27, 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: 155, independent: 108, independent conditional: 25, independent unconditional: 83, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 27, unknown conditional: 26, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 62, Positive conditional cache size: 26, Positive unconditional cache size: 36, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 40 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 125, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 125, independent: 105, independent conditional: 15, independent unconditional: 90, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 125, independent: 105, independent conditional: 15, independent unconditional: 90, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 125, independent: 105, independent conditional: 15, independent unconditional: 90, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 12, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 125, independent: 87, independent conditional: 3, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 18, unknown conditional: 12, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 80, Positive conditional cache size: 38, Positive unconditional cache size: 42, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 47 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 39 TransitionsAfterwards, 358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 158, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 158, independent: 138, independent conditional: 58, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 158, independent: 138, independent conditional: 58, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 158, independent: 138, independent conditional: 58, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 158, independent: 117, independent conditional: 37, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 101, Positive conditional cache size: 59, Positive unconditional cache size: 42, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 167, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 167, independent: 147, independent conditional: 45, independent unconditional: 102, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 167, independent: 147, independent conditional: 45, independent unconditional: 102, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 167, independent: 147, independent conditional: 45, independent unconditional: 102, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 3, independent unconditional: 11, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 167, independent: 133, independent conditional: 42, independent unconditional: 91, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 14, unknown conditional: 3, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 123, Positive conditional cache size: 62, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 91, independent conditional: 91, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 91, independent conditional: 11, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 91, independent conditional: 11, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 91, independent conditional: 11, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 111, independent: 91, independent conditional: 11, independent unconditional: 80, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 123, Positive conditional cache size: 62, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 42, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 123, Positive conditional cache size: 62, Positive unconditional cache size: 61, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 82, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 143, Positive conditional cache size: 62, Positive unconditional cache size: 81, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 28, independent unconditional: 44, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 82, independent: 72, independent conditional: 28, independent unconditional: 44, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 82, independent: 72, independent conditional: 28, independent unconditional: 44, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 18, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, 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: 82, independent: 53, independent conditional: 10, independent unconditional: 43, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 19, unknown conditional: 18, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 162, Positive conditional cache size: 80, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 43 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 135, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 155, independent: 135, independent conditional: 51, independent unconditional: 84, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 162, Positive conditional cache size: 80, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 74, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 84, independent: 74, independent conditional: 20, independent unconditional: 54, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 162, Positive conditional cache size: 80, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 24, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 66, independent conditional: 24, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 66, independent conditional: 24, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 76, independent: 66, independent conditional: 24, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 162, Positive conditional cache size: 80, Positive unconditional cache size: 82, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.7s, 61 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 140, independent unconditional: 100, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, independent: 240, independent conditional: 124, independent unconditional: 116, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 124, independent unconditional: 116, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 264, independent: 233, independent conditional: 122, independent unconditional: 111, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 169, Positive conditional cache size: 82, Positive unconditional cache size: 87, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 65 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 57 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 120, independent unconditional: 120, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 264, independent: 240, independent conditional: 120, independent unconditional: 120, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 264, independent: 240, independent conditional: 120, independent unconditional: 120, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 264, independent: 240, independent conditional: 120, independent unconditional: 120, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 169, Positive conditional cache size: 82, Positive unconditional cache size: 87, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 70 PlacesBefore, 69 PlacesAfterwards, 91 TransitionsBefore, 90 TransitionsAfterwards, 1084 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, independent: 544, independent conditional: 544, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 584, independent: 544, independent conditional: 364, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 584, independent: 544, independent conditional: 364, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 584, independent: 544, independent conditional: 364, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 584, independent: 526, independent conditional: 346, independent unconditional: 180, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 204, Positive cache size: 195, Positive conditional cache size: 100, Positive unconditional cache size: 95, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 79 PlacesBefore, 79 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 322, independent conditional: 322, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 322, independent conditional: 217, independent unconditional: 105, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, independent: 322, independent conditional: 181, independent unconditional: 141, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, independent: 322, independent conditional: 181, independent unconditional: 141, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 361, independent: 319, independent conditional: 180, independent unconditional: 139, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 203, Positive conditional cache size: 103, Positive unconditional cache size: 100, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 89 PlacesBefore, 89 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 1198 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 244, independent: 220, independent conditional: 220, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 244, independent: 220, independent conditional: 132, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 244, independent: 220, independent conditional: 132, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 244, independent: 220, independent conditional: 132, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 244, independent: 220, independent conditional: 132, independent unconditional: 88, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 203, Positive conditional cache size: 103, Positive unconditional cache size: 100, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 94 PlacesBefore, 92 PlacesAfterwards, 106 TransitionsBefore, 104 TransitionsAfterwards, 1170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 556, independent: 508, independent conditional: 508, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 556, independent: 508, independent conditional: 288, independent unconditional: 220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 556, independent: 508, independent conditional: 288, independent unconditional: 220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 556, independent: 508, independent conditional: 288, independent unconditional: 220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 14, 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: 14, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 556, independent: 494, independent conditional: 274, independent unconditional: 220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 221, Positive conditional cache size: 117, Positive unconditional cache size: 104, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 88, independent unconditional: 66, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 178, independent: 154, independent conditional: 88, independent unconditional: 66, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 178, independent: 154, independent conditional: 88, independent unconditional: 66, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 178, independent: 154, independent conditional: 88, independent unconditional: 66, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 221, Positive conditional cache size: 117, Positive unconditional cache size: 104, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 138, independent: 128, independent conditional: 50, independent unconditional: 78, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, independent: 128, independent conditional: 50, independent unconditional: 78, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, independent: 128, independent conditional: 50, independent unconditional: 78, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 20, independent: 20, independent conditional: 0, independent unconditional: 20, 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: 138, independent: 108, independent conditional: 50, independent unconditional: 58, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 20, unknown conditional: 0, unknown unconditional: 20] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 241, Positive conditional cache size: 117, Positive unconditional cache size: 124, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 57, independent unconditional: 27, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 84, independent conditional: 47, independent unconditional: 37, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 84, independent conditional: 47, independent unconditional: 37, dependent: 12, dependent conditional: 1, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 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: 96, independent: 84, independent conditional: 47, independent unconditional: 37, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 241, Positive conditional cache size: 117, Positive unconditional cache size: 124, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 79 PlacesBefore, 77 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 386, independent: 352, independent conditional: 352, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 386, independent: 352, independent conditional: 256, independent unconditional: 96, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 386, independent: 352, independent conditional: 224, independent unconditional: 128, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 386, independent: 352, independent conditional: 224, independent unconditional: 128, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 0, independent unconditional: 18, 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: 386, independent: 334, independent conditional: 206, independent unconditional: 128, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 269, Positive conditional cache size: 135, Positive unconditional cache size: 134, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 77, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 17, dependent conditional: 2, dependent unconditional: 15, 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: 77, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 279, Positive cache size: 269, Positive conditional cache size: 135, Positive unconditional cache size: 134, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, 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, 78 PlacesBefore, 78 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 512, independent: 472, independent conditional: 472, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 512, independent: 472, independent conditional: 306, independent unconditional: 166, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 512, independent: 472, independent conditional: 238, independent unconditional: 234, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 512, independent: 472, independent conditional: 238, independent unconditional: 234, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 512, independent: 468, independent conditional: 238, independent unconditional: 230, dependent: 40, dependent conditional: 2, dependent unconditional: 38, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 283, Positive cache size: 273, Positive conditional cache size: 135, Positive unconditional cache size: 138, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 84 PlacesBefore, 84 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 349, independent: 304, independent conditional: 304, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 349, independent: 304, independent conditional: 193, independent unconditional: 111, dependent: 45, dependent conditional: 2, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 349, independent: 304, independent conditional: 121, independent unconditional: 183, dependent: 45, dependent conditional: 2, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 349, independent: 304, independent conditional: 121, independent unconditional: 183, dependent: 45, dependent conditional: 2, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 349, independent: 303, independent conditional: 120, independent unconditional: 183, dependent: 45, dependent conditional: 2, dependent unconditional: 43, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 88 PlacesBefore, 87 PlacesAfterwards, 94 TransitionsBefore, 93 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 404, independent: 360, independent conditional: 360, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 404, independent: 360, independent conditional: 216, independent unconditional: 144, dependent: 44, dependent conditional: 2, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 404, independent: 360, independent conditional: 152, independent unconditional: 208, dependent: 44, dependent conditional: 2, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 404, independent: 360, independent conditional: 152, independent unconditional: 208, dependent: 44, dependent conditional: 2, dependent unconditional: 42, 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: 404, independent: 360, independent conditional: 152, independent unconditional: 208, dependent: 44, dependent conditional: 2, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 126, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 84, independent unconditional: 42, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 126, independent conditional: 84, independent unconditional: 42, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 126, independent conditional: 84, independent unconditional: 42, dependent: 25, dependent conditional: 1, dependent unconditional: 24, 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: 151, independent: 126, independent conditional: 84, independent unconditional: 42, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, 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, 94 PlacesBefore, 94 PlacesAfterwards, 109 TransitionsBefore, 109 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, independent: 147, independent conditional: 147, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 172, independent: 147, independent conditional: 105, independent unconditional: 42, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, independent: 147, independent conditional: 86, independent unconditional: 61, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, independent: 147, independent conditional: 86, independent unconditional: 61, dependent: 25, dependent conditional: 1, dependent unconditional: 24, 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: 172, independent: 147, independent conditional: 86, independent unconditional: 61, dependent: 25, dependent conditional: 1, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 95 PlacesBefore, 94 PlacesAfterwards, 111 TransitionsBefore, 110 TransitionsAfterwards, 1246 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, independent: 294, independent conditional: 294, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 344, independent: 294, independent conditional: 210, independent unconditional: 84, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, independent: 294, independent conditional: 172, independent unconditional: 122, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, independent: 294, independent conditional: 172, independent unconditional: 122, dependent: 50, dependent conditional: 2, dependent unconditional: 48, 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: 344, independent: 294, independent conditional: 172, independent unconditional: 122, dependent: 50, dependent conditional: 2, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 10, Negative conditional cache size: 1, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 98 PlacesBefore, 98 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 325, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 325, independent: 297, independent conditional: 234, independent unconditional: 63, dependent: 28, dependent conditional: 5, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 327, independent: 297, independent conditional: 215, independent unconditional: 82, dependent: 30, dependent conditional: 7, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 327, independent: 297, independent conditional: 215, independent unconditional: 82, dependent: 30, dependent conditional: 7, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 327, independent: 297, independent conditional: 215, independent unconditional: 82, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 290, Positive cache size: 276, Positive conditional cache size: 136, Positive unconditional cache size: 140, Negative cache size: 14, Negative conditional cache size: 5, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 134 TransitionsBefore, 134 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 446, independent: 413, independent conditional: 413, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 446, independent: 413, independent conditional: 350, independent unconditional: 63, dependent: 33, dependent conditional: 10, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 455, independent: 413, independent conditional: 281, independent unconditional: 132, dependent: 42, dependent conditional: 19, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 455, independent: 413, independent conditional: 281, independent unconditional: 132, dependent: 42, dependent conditional: 19, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 455, independent: 411, independent conditional: 279, independent unconditional: 132, dependent: 35, dependent conditional: 12, dependent unconditional: 23, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 278, Positive conditional cache size: 138, Positive unconditional cache size: 140, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 69, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 114 PlacesBefore, 114 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 1910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 268, independent conditional: 268, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 268, independent conditional: 214, independent unconditional: 54, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 298, independent: 268, independent conditional: 192, independent unconditional: 76, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 298, independent: 268, independent conditional: 192, independent unconditional: 76, dependent: 30, dependent conditional: 10, dependent unconditional: 20, 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: 298, independent: 268, independent conditional: 192, independent unconditional: 76, dependent: 30, dependent conditional: 10, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 278, Positive conditional cache size: 138, Positive unconditional cache size: 140, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 118 PlacesBefore, 118 PlacesAfterwards, 131 TransitionsBefore, 131 TransitionsAfterwards, 2038 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 382, independent: 352, independent conditional: 352, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 382, independent: 352, independent conditional: 262, independent unconditional: 90, dependent: 30, dependent conditional: 6, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 386, independent: 352, independent conditional: 256, independent unconditional: 96, dependent: 34, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 386, independent: 352, independent conditional: 256, independent unconditional: 96, dependent: 34, dependent conditional: 10, dependent unconditional: 24, 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: 386, independent: 352, independent conditional: 256, independent unconditional: 96, dependent: 34, dependent conditional: 10, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 278, Positive conditional cache size: 138, Positive unconditional cache size: 140, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 125 PlacesBefore, 125 PlacesAfterwards, 137 TransitionsBefore, 137 TransitionsAfterwards, 2116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 461, independent: 430, independent conditional: 430, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 461, independent: 430, independent conditional: 313, independent unconditional: 117, dependent: 31, dependent conditional: 6, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 465, independent: 430, independent conditional: 281, independent unconditional: 149, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 465, independent: 430, independent conditional: 281, independent unconditional: 149, dependent: 35, dependent conditional: 10, dependent unconditional: 25, 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: 465, independent: 430, independent conditional: 281, independent unconditional: 149, dependent: 35, dependent conditional: 10, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 278, Positive conditional cache size: 138, Positive unconditional cache size: 140, Negative cache size: 21, Negative conditional cache size: 12, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 127 PlacesBefore, 127 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 360, independent: 327, independent conditional: 327, independent unconditional: 0, dependent: 33, dependent conditional: 33, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 360, independent: 327, independent conditional: 253, independent unconditional: 74, dependent: 33, dependent conditional: 7, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 364, independent: 327, independent conditional: 201, independent unconditional: 126, dependent: 37, dependent conditional: 11, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 364, independent: 327, independent conditional: 201, independent unconditional: 126, dependent: 37, dependent conditional: 11, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, 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: 2, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 364, independent: 326, independent conditional: 200, independent unconditional: 126, dependent: 36, dependent conditional: 10, dependent unconditional: 26, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 301, Positive cache size: 279, Positive conditional cache size: 139, Positive unconditional cache size: 140, Negative cache size: 22, Negative conditional cache size: 13, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 114 PlacesBefore, 113 PlacesAfterwards, 95 TransitionsBefore, 94 TransitionsAfterwards, 1466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 414, independent: 376, independent conditional: 376, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 414, independent: 376, independent conditional: 320, independent unconditional: 56, dependent: 38, dependent conditional: 16, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 422, independent: 376, independent conditional: 298, independent unconditional: 78, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 422, independent: 376, independent conditional: 298, independent unconditional: 78, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 28, independent conditional: 28, 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: 28, independent: 28, independent conditional: 0, independent unconditional: 28, 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: 422, independent: 348, independent conditional: 270, independent unconditional: 78, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 337, Positive cache size: 315, Positive conditional cache size: 167, Positive unconditional cache size: 148, Negative cache size: 22, Negative conditional cache size: 13, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 22, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 102 PlacesBefore, 101 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 1350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 365, independent conditional: 365, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 405, independent: 365, independent conditional: 263, independent unconditional: 102, dependent: 40, dependent conditional: 18, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 415, independent: 365, independent conditional: 239, independent unconditional: 126, dependent: 50, dependent conditional: 28, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 415, independent: 365, independent conditional: 239, independent unconditional: 126, dependent: 50, dependent conditional: 28, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 415, independent: 354, independent conditional: 228, independent unconditional: 126, dependent: 50, dependent conditional: 28, dependent unconditional: 22, unknown: 11, unknown conditional: 11, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 326, Positive conditional cache size: 178, Positive unconditional cache size: 148, Negative cache size: 22, Negative conditional cache size: 13, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 100 PlacesBefore, 99 PlacesAfterwards, 88 TransitionsBefore, 87 TransitionsAfterwards, 1328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 394, independent: 356, independent conditional: 356, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 394, independent: 356, independent conditional: 250, independent unconditional: 106, dependent: 38, dependent conditional: 16, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 356, independent conditional: 212, independent unconditional: 144, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 356, independent conditional: 212, independent unconditional: 144, dependent: 46, dependent conditional: 24, dependent unconditional: 22, 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: 402, independent: 356, independent conditional: 212, independent unconditional: 144, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 348, Positive cache size: 326, Positive conditional cache size: 178, Positive unconditional cache size: 148, Negative cache size: 22, Negative conditional cache size: 13, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 202, independent: 183, independent conditional: 183, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 202, independent: 183, independent conditional: 132, independent unconditional: 51, dependent: 19, dependent conditional: 8, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 211, independent: 183, independent conditional: 116, independent unconditional: 67, dependent: 28, dependent conditional: 17, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 211, independent: 183, independent conditional: 116, independent unconditional: 67, dependent: 28, dependent conditional: 17, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, 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: 211, independent: 181, independent conditional: 114, independent unconditional: 67, dependent: 25, dependent conditional: 14, dependent unconditional: 11, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 353, Positive cache size: 328, Positive conditional cache size: 180, Positive unconditional cache size: 148, Negative cache size: 25, Negative conditional cache size: 16, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 117 PlacesBefore, 116 PlacesAfterwards, 100 TransitionsBefore, 99 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 310, independent: 290, independent conditional: 290, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 310, independent: 290, independent conditional: 266, independent unconditional: 24, dependent: 20, dependent conditional: 8, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 318, independent: 290, independent conditional: 254, independent unconditional: 36, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 318, independent: 290, independent conditional: 254, independent unconditional: 36, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, 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: 19, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 318, independent: 271, independent conditional: 235, independent unconditional: 36, dependent: 28, dependent conditional: 16, dependent unconditional: 12, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 415, Positive cache size: 390, Positive conditional cache size: 214, Positive unconditional cache size: 176, Negative cache size: 25, Negative conditional cache size: 16, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.6s, 139 PlacesBefore, 135 PlacesAfterwards, 144 TransitionsBefore, 140 TransitionsAfterwards, 2208 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 294, independent: 278, independent conditional: 278, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 294, independent: 278, independent conditional: 266, independent unconditional: 12, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 304, independent: 278, independent conditional: 259, independent unconditional: 19, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 304, independent: 278, independent conditional: 259, independent unconditional: 19, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 304, independent: 275, independent conditional: 256, independent unconditional: 19, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 561, Positive cache size: 533, Positive conditional cache size: 267, Positive unconditional cache size: 266, Negative cache size: 28, Negative conditional cache size: 19, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 2 - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 34ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 34ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 34ms.. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 25 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 34ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 341 locations, 4 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: 793.1s, OverallIterations: 45, TraceHistogramMax: 2, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4256 SdHoareTripleChecker+Valid, 11.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4256 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16521 IncrementalHoareTripleChecker+Invalid, 16687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 3 mSDtfsCounter, 16521 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 229 SyntacticMatches, 15 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1694occurred in iteration=44, InterpolantAutomatonStates: 315, 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.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 393.8s InterpolantComputationTime, 1086 NumberOfCodeBlocks, 1086 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 1170 ConstructedInterpolants, 12 QuantifiedInterpolants, 14635 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1806 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 56 InterpolantComputations, 38 PerfectInterpolantSequences, 30/59 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