./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:48:28,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:48:28,189 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:48:28,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:48:28,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:48:28,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:48:28,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:48:28,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:48:28,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:48:28,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:48:28,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:48:28,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:48:28,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:48:28,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:48:28,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:48:28,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:48:28,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:48:28,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:48:28,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:48:28,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:48:28,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:48:28,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:48:28,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:48:28,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:48:28,237 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:48:28,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:48:28,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:48:28,238 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:48:28,238 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:48:28,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:48:28,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:48:28,239 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:48:28,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:48:28,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:48:28,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:48:28,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:48:28,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:48:28,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:48:28,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:48:28,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:48:28,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:48:28,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:48:28,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad6b8e6072d4c534442fdbffe3152158d5d2614d02df79d5ef08cd921f0d4751 [2024-11-19 01:48:28,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:48:28,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:48:28,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:48:28,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:48:28,520 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:48:28,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-19 01:48:29,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:48:30,148 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:48:30,149 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c [2024-11-19 01:48:30,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad58e1a45/39df27a7b06b42b094d6670c4c58810e/FLAG710162fed [2024-11-19 01:48:30,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad58e1a45/39df27a7b06b42b094d6670c4c58810e [2024-11-19 01:48:30,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:48:30,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:48:30,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:48:30,174 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:48:30,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:48:30,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30abf308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30, skipping insertion in model container [2024-11-19 01:48:30,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:48:30,404 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2024-11-19 01:48:30,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:48:30,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:48:30,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-4.wvr.c[2554,2567] [2024-11-19 01:48:30,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:48:30,484 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:48:30,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30 WrapperNode [2024-11-19 01:48:30,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:48:30,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:48:30,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:48:30,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:48:30,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,523 INFO L138 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-19 01:48:30,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:48:30,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:48:30,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:48:30,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:48:30,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 01:48:30,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:48:30,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:48:30,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:48:30,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:48:30,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (1/1) ... [2024-11-19 01:48:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:48:30,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:48:30,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:48:30,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:48:30,704 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 01:48:30,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 01:48:30,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 01:48:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 01:48:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 01:48:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 01:48:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 01:48:30,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 01:48:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:48:30,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:48:30,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:48:30,708 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:48:30,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:48:30,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:48:31,134 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:48:31,134 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:48:31,361 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:48:31,362 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:48:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:31 BoogieIcfgContainer [2024-11-19 01:48:31,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:48:31,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:48:31,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:48:31,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:48:31,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:48:30" (1/3) ... [2024-11-19 01:48:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21665755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:48:31, skipping insertion in model container [2024-11-19 01:48:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:48:30" (2/3) ... [2024-11-19 01:48:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21665755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:48:31, skipping insertion in model container [2024-11-19 01:48:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:31" (3/3) ... [2024-11-19 01:48:31,376 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-4.wvr.c [2024-11-19 01:48:31,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:48:31,393 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:48:31,393 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:48:31,474 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 01:48:31,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 59 transitions, 146 flow [2024-11-19 01:48:31,555 INFO L124 PetriNetUnfolderBase]: 3/55 cut-off events. [2024-11-19 01:48:31,556 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 01:48:31,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 55 events. 3/55 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2024-11-19 01:48:31,561 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 59 transitions, 146 flow [2024-11-19 01:48:31,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 54 transitions, 132 flow [2024-11-19 01:48:31,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:48:31,580 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5a07ed03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:48:31,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-19 01:48:31,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:48:31,597 INFO L124 PetriNetUnfolderBase]: 3/53 cut-off events. [2024-11-19 01:48:31,598 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 01:48:31,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:31,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:31,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash -338410394, now seen corresponding path program 1 times [2024-11-19 01:48:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399597774] [2024-11-19 01:48:31,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:31,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:32,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399597774] [2024-11-19 01:48:32,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399597774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:32,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:32,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:48:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557359805] [2024-11-19 01:48:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:32,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:48:32,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:32,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:48:32,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:48:32,116 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2024-11-19 01:48:32,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:32,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:32,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2024-11-19 01:48:32,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:33,870 INFO L124 PetriNetUnfolderBase]: 12679/17507 cut-off events. [2024-11-19 01:48:33,870 INFO L125 PetriNetUnfolderBase]: For 1243/1243 co-relation queries the response was YES. [2024-11-19 01:48:33,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35337 conditions, 17507 events. 12679/17507 cut-off events. For 1243/1243 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 101565 event pairs, 4419 based on Foata normal form. 1/17032 useless extension candidates. Maximal degree in co-relation 32049. Up to 10696 conditions per place. [2024-11-19 01:48:34,009 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 59 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2024-11-19 01:48:34,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 338 flow [2024-11-19 01:48:34,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:48:34,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:48:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2024-11-19 01:48:34,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7175141242937854 [2024-11-19 01:48:34,026 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 132 flow. Second operand 3 states and 127 transitions. [2024-11-19 01:48:34,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 338 flow [2024-11-19 01:48:34,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 310 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 01:48:34,060 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 148 flow [2024-11-19 01:48:34,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-11-19 01:48:34,066 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -5 predicate places. [2024-11-19 01:48:34,066 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 148 flow [2024-11-19 01:48:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:34,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:34,067 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:34,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:48:34,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:34,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash -728591479, now seen corresponding path program 1 times [2024-11-19 01:48:34,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:34,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686698919] [2024-11-19 01:48:34,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:34,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686698919] [2024-11-19 01:48:34,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686698919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:34,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:34,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:48:34,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585964952] [2024-11-19 01:48:34,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:34,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:48:34,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:34,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:48:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:48:34,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-11-19 01:48:34,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:34,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:34,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-11-19 01:48:34,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:36,488 INFO L124 PetriNetUnfolderBase]: 21965/30404 cut-off events. [2024-11-19 01:48:36,488 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2024-11-19 01:48:36,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61554 conditions, 30404 events. 21965/30404 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 181661 event pairs, 16979 based on Foata normal form. 0/29844 useless extension candidates. Maximal degree in co-relation 41623. Up to 26138 conditions per place. [2024-11-19 01:48:36,629 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 58 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-11-19 01:48:36,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 329 flow [2024-11-19 01:48:36,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:48:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:48:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-19 01:48:36,634 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6440677966101694 [2024-11-19 01:48:36,634 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 148 flow. Second operand 3 states and 114 transitions. [2024-11-19 01:48:36,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 329 flow [2024-11-19 01:48:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:48:36,639 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 196 flow [2024-11-19 01:48:36,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2024-11-19 01:48:36,640 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2024-11-19 01:48:36,640 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 196 flow [2024-11-19 01:48:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:36,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:36,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:36,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:48:36,642 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:36,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:36,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1852755381, now seen corresponding path program 1 times [2024-11-19 01:48:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194627802] [2024-11-19 01:48:36,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:37,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194627802] [2024-11-19 01:48:37,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194627802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:37,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:37,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:48:37,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567786948] [2024-11-19 01:48:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:48:37,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:48:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:48:37,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:37,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:37,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:37,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:37,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:38,974 INFO L124 PetriNetUnfolderBase]: 18572/28993 cut-off events. [2024-11-19 01:48:38,974 INFO L125 PetriNetUnfolderBase]: For 1566/1670 co-relation queries the response was YES. [2024-11-19 01:48:39,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59625 conditions, 28993 events. 18572/28993 cut-off events. For 1566/1670 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 225070 event pairs, 3513 based on Foata normal form. 358/27918 useless extension candidates. Maximal degree in co-relation 37875. Up to 9172 conditions per place. [2024-11-19 01:48:39,146 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 105 selfloop transitions, 41 changer transitions 1/172 dead transitions. [2024-11-19 01:48:39,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 172 transitions, 732 flow [2024-11-19 01:48:39,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:48:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:48:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-19 01:48:39,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-19 01:48:39,153 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 196 flow. Second operand 9 states and 348 transitions. [2024-11-19 01:48:39,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 172 transitions, 732 flow [2024-11-19 01:48:39,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 172 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:39,201 INFO L231 Difference]: Finished difference. Result has 71 places, 97 transitions, 366 flow [2024-11-19 01:48:39,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=71, PETRI_TRANSITIONS=97} [2024-11-19 01:48:39,202 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2024-11-19 01:48:39,203 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 97 transitions, 366 flow [2024-11-19 01:48:39,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:39,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:39,204 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:39,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:48:39,204 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:39,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:39,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1191460215, now seen corresponding path program 2 times [2024-11-19 01:48:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349814206] [2024-11-19 01:48:39,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:48:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:39,240 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:48:39,241 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:39,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:39,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:39,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349814206] [2024-11-19 01:48:39,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349814206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:48:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797284300] [2024-11-19 01:48:39,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:39,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:48:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:39,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:48:39,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:48:39,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:39,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 97 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:39,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:39,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:39,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:41,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:41,697 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,698 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,698 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,698 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:41,699 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:41,699 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:42,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,074 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,074 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,074 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,075 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,075 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,075 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,075 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,075 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,076 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,076 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,076 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,077 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,078 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,078 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,078 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,078 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,079 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,079 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,079 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,079 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,080 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:42,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 29#L76-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,307 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,307 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,307 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,308 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,308 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,308 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,309 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,309 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,310 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, 7#L44-1true, 46#L101true, 84#(<= (+ ~s~0 1) ~t~0), 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,310 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,310 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,310 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,310 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,311 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,311 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,311 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,311 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), 5#L100-4true, Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,312 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,312 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,312 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,312 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:42,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][131], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, 51#thread2EXITtrue, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, 7#L44-1true, 46#L101true, 98#true, 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,420 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,420 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,420 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,420 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][164], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 76#true, Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 51#thread2EXITtrue, 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, 7#L44-1true, 98#true, 46#L101true, Black: 74#(= (mod ~b~0 256) 0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:42,421 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,421 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,421 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,421 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:42,717 INFO L124 PetriNetUnfolderBase]: 31017/48718 cut-off events. [2024-11-19 01:48:42,717 INFO L125 PetriNetUnfolderBase]: For 23066/23594 co-relation queries the response was YES. [2024-11-19 01:48:42,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120023 conditions, 48718 events. 31017/48718 cut-off events. For 23066/23594 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 401575 event pairs, 7493 based on Foata normal form. 523/47334 useless extension candidates. Maximal degree in co-relation 77638. Up to 18165 conditions per place. [2024-11-19 01:48:43,011 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 104 selfloop transitions, 55 changer transitions 4/188 dead transitions. [2024-11-19 01:48:43,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 188 transitions, 998 flow [2024-11-19 01:48:43,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:48:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:48:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2024-11-19 01:48:43,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7220338983050848 [2024-11-19 01:48:43,014 INFO L175 Difference]: Start difference. First operand has 71 places, 97 transitions, 366 flow. Second operand 5 states and 213 transitions. [2024-11-19 01:48:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 188 transitions, 998 flow [2024-11-19 01:48:43,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 188 transitions, 991 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 01:48:43,188 INFO L231 Difference]: Finished difference. Result has 77 places, 134 transitions, 759 flow [2024-11-19 01:48:43,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=759, PETRI_PLACES=77, PETRI_TRANSITIONS=134} [2024-11-19 01:48:43,189 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2024-11-19 01:48:43,189 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 134 transitions, 759 flow [2024-11-19 01:48:43,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:43,190 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:43,190 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:43,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:48:43,190 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:43,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash 475877975, now seen corresponding path program 1 times [2024-11-19 01:48:43,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989455408] [2024-11-19 01:48:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:48:43,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:48:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:43,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:43,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989455408] [2024-11-19 01:48:43,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989455408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:43,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:43,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:48:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772179408] [2024-11-19 01:48:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:43,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:48:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:48:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:48:43,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:43,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 134 transitions, 759 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:43,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:43,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:43,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:45,800 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 5#L100-4true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,800 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,800 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,800 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,800 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,801 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,801 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,801 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,801 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:45,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,997 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,997 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,997 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,997 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,997 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,997 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 5#L100-4true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,998 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,998 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,998 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,999 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:45,999 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:45,999 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:46,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,157 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,157 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,157 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,157 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,158 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 108#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,158 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,158 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,159 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,159 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,160 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,160 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,160 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,160 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:46,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][143], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 46#L101true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,480 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,480 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,480 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,480 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][178], [Black: 92#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 76#true, 51#thread2EXITtrue, 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:46,481 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,481 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:46,617 INFO L124 PetriNetUnfolderBase]: 28896/45634 cut-off events. [2024-11-19 01:48:46,617 INFO L125 PetriNetUnfolderBase]: For 66729/68306 co-relation queries the response was YES. [2024-11-19 01:48:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139415 conditions, 45634 events. 28896/45634 cut-off events. For 66729/68306 co-relation queries the response was YES. Maximal size of possible extension queue 2401. Compared 374889 event pairs, 7274 based on Foata normal form. 952/44887 useless extension candidates. Maximal degree in co-relation 86598. Up to 17640 conditions per place. [2024-11-19 01:48:46,908 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 68 changer transitions 0/200 dead transitions. [2024-11-19 01:48:46,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 200 transitions, 1397 flow [2024-11-19 01:48:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:48:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:48:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2024-11-19 01:48:46,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2024-11-19 01:48:46,911 INFO L175 Difference]: Start difference. First operand has 77 places, 134 transitions, 759 flow. Second operand 5 states and 212 transitions. [2024-11-19 01:48:46,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 200 transitions, 1397 flow [2024-11-19 01:48:47,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 200 transitions, 1382 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-19 01:48:47,106 INFO L231 Difference]: Finished difference. Result has 82 places, 147 transitions, 1057 flow [2024-11-19 01:48:47,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1057, PETRI_PLACES=82, PETRI_TRANSITIONS=147} [2024-11-19 01:48:47,107 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2024-11-19 01:48:47,107 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 147 transitions, 1057 flow [2024-11-19 01:48:47,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:47,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:47,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:47,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:48:47,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:47,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:47,109 INFO L85 PathProgramCache]: Analyzing trace with hash 93800467, now seen corresponding path program 3 times [2024-11-19 01:48:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:47,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427797827] [2024-11-19 01:48:47,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:48:47,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:47,125 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:48:47,125 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:47,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:47,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427797827] [2024-11-19 01:48:47,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427797827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:47,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:48:47,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114542967] [2024-11-19 01:48:47,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:47,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:48:47,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:47,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:48:47,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:48:47,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:47,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 147 transitions, 1057 flow. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:47,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:47,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:47,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:50,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,043 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:50,043 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:50,043 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:50,043 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:50,277 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,278 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,278 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,279 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,279 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,279 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,279 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:50,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,777 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,777 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,777 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,778 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,778 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,778 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,778 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:50,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][186], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 100#(<= ~s~0 ~t~0), 108#true, Black: 74#(= (mod ~b~0 256) 0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:50,933 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:50,933 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:50,934 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:50,934 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:51,128 INFO L124 PetriNetUnfolderBase]: 32470/50995 cut-off events. [2024-11-19 01:48:51,128 INFO L125 PetriNetUnfolderBase]: For 103598/106226 co-relation queries the response was YES. [2024-11-19 01:48:51,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169020 conditions, 50995 events. 32470/50995 cut-off events. For 103598/106226 co-relation queries the response was YES. Maximal size of possible extension queue 2826. Compared 425275 event pairs, 6385 based on Foata normal form. 1598/50204 useless extension candidates. Maximal degree in co-relation 105849. Up to 17284 conditions per place. [2024-11-19 01:48:51,445 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 107 selfloop transitions, 106 changer transitions 4/242 dead transitions. [2024-11-19 01:48:51,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 242 transitions, 1922 flow [2024-11-19 01:48:51,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:48:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:48:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 257 transitions. [2024-11-19 01:48:51,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2024-11-19 01:48:51,446 INFO L175 Difference]: Start difference. First operand has 82 places, 147 transitions, 1057 flow. Second operand 6 states and 257 transitions. [2024-11-19 01:48:51,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 242 transitions, 1922 flow [2024-11-19 01:48:51,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 242 transitions, 1836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:51,619 INFO L231 Difference]: Finished difference. Result has 87 places, 175 transitions, 1487 flow [2024-11-19 01:48:51,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1487, PETRI_PLACES=87, PETRI_TRANSITIONS=175} [2024-11-19 01:48:51,620 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 23 predicate places. [2024-11-19 01:48:51,620 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 175 transitions, 1487 flow [2024-11-19 01:48:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:51,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:51,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:48:51,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:51,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 150968343, now seen corresponding path program 4 times [2024-11-19 01:48:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271728524] [2024-11-19 01:48:51,622 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:48:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:51,651 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:48:51,652 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:51,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:51,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271728524] [2024-11-19 01:48:51,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271728524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:51,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:51,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:48:51,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245372152] [2024-11-19 01:48:51,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:51,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:48:51,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:51,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:48:51,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:48:51,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:51,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 175 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:51,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:51,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:51,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:55,089 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,089 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-19 01:48:55,089 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:55,089 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:55,089 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-19 01:48:55,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,322 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,322 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,322 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,322 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 44#L56-1true, 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,371 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 117#true, Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,371 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,371 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,372 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,372 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,372 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,372 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-19 01:48:55,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,538 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,538 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,538 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,538 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), 84#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,539 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,539 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,539 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,539 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 44#L56-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,574 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,574 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,574 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,574 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 83#(<= ~s~0 ~t~0), 29#L76-1true, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,575 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,575 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,575 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,575 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 117#true, 5#L100-4true, Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:55,576 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,576 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,576 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:55,576 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-19 01:48:56,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][158], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), 84#(<= (+ ~s~0 1) ~t~0), Black: 74#(= (mod ~b~0 256) 0), Black: 100#(<= ~s~0 ~t~0), 119#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 46#L101true, 98#true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:56,136 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,136 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,136 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,136 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([429] L65-3-->L66-1: Formula: (and (= (+ |v_thread3Thread1of1ForFork0_#t~post6#1_1| 1) v_~s~0_46) (= v_~s~0_47 |v_thread3Thread1of1ForFork0_#t~post6#1_1|)) InVars {~s~0=v_~s~0_47} OutVars{thread3Thread1of1ForFork0_#t~post6#1=|v_thread3Thread1of1ForFork0_#t~post6#1_1|, ~s~0=v_~s~0_46} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post6#1, ~s~0][198], [Black: 94#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 2 ~s~0) ~t~0)), 9#thread4EXITtrue, 83#(<= ~s~0 ~t~0), 41#L66-1true, Black: 101#(<= (+ ~s~0 1) ~t~0), Black: 104#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 74#(= (mod ~b~0 256) 0), 117#true, Black: 100#(<= ~s~0 ~t~0), Black: 76#true, 51#thread2EXITtrue, Black: 111#(<= (+ ~s~0 1) ~t~0), Black: 114#(and (<= (+ ~s~0 1) ~t~0) (<= (+ ~s~0 1) |thread3Thread1of1ForFork0_#t~post5#1|)), 7#L44-1true, 98#true, 46#L101true, 127#true, Black: 124#(and (<= (+ 2 ~s~0) ~t~0) (<= (+ ~s~0 1) |thread4Thread1of1ForFork2_#t~post7#1|)), Black: 119#(<= ~s~0 ~t~0), Black: 90#(and (<= (+ 2 ~s~0) |thread4Thread1of1ForFork2_#t~post7#1|) (<= (+ 3 ~s~0) ~t~0))]) [2024-11-19 01:48:56,166 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,167 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,167 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,167 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-19 01:48:56,367 INFO L124 PetriNetUnfolderBase]: 31732/50954 cut-off events. [2024-11-19 01:48:56,367 INFO L125 PetriNetUnfolderBase]: For 160772/163129 co-relation queries the response was YES. [2024-11-19 01:48:56,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178732 conditions, 50954 events. 31732/50954 cut-off events. For 160772/163129 co-relation queries the response was YES. Maximal size of possible extension queue 2810. Compared 436290 event pairs, 8150 based on Foata normal form. 1179/50358 useless extension candidates. Maximal degree in co-relation 111088. Up to 23495 conditions per place. [2024-11-19 01:48:56,670 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 124 selfloop transitions, 85 changer transitions 12/246 dead transitions. [2024-11-19 01:48:56,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 246 transitions, 2344 flow [2024-11-19 01:48:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:48:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:48:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-11-19 01:48:56,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7254237288135593 [2024-11-19 01:48:56,672 INFO L175 Difference]: Start difference. First operand has 87 places, 175 transitions, 1487 flow. Second operand 5 states and 214 transitions. [2024-11-19 01:48:56,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 246 transitions, 2344 flow [2024-11-19 01:48:56,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 246 transitions, 2275 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-11-19 01:48:56,986 INFO L231 Difference]: Finished difference. Result has 91 places, 185 transitions, 1807 flow [2024-11-19 01:48:56,986 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1429, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1807, PETRI_PLACES=91, PETRI_TRANSITIONS=185} [2024-11-19 01:48:56,987 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 27 predicate places. [2024-11-19 01:48:56,987 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 185 transitions, 1807 flow [2024-11-19 01:48:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:56,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:48:56,988 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:48:56,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:48:56,988 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:48:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:48:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1047806689, now seen corresponding path program 5 times [2024-11-19 01:48:56,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:48:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38771614] [2024-11-19 01:48:56,989 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:48:56,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:48:57,002 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:48:57,003 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:48:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:48:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:48:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38771614] [2024-11-19 01:48:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38771614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:48:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:48:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:48:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390343877] [2024-11-19 01:48:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:48:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:48:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:48:57,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:48:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:48:57,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:48:57,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 185 transitions, 1807 flow. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:48:57,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:48:57,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:48:57,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:48:59,837 INFO L124 PetriNetUnfolderBase]: 20188/32582 cut-off events. [2024-11-19 01:48:59,838 INFO L125 PetriNetUnfolderBase]: For 113177/115127 co-relation queries the response was YES. [2024-11-19 01:48:59,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115558 conditions, 32582 events. 20188/32582 cut-off events. For 113177/115127 co-relation queries the response was YES. Maximal size of possible extension queue 1796. Compared 263393 event pairs, 5504 based on Foata normal form. 1250/32738 useless extension candidates. Maximal degree in co-relation 89621. Up to 16794 conditions per place. [2024-11-19 01:49:00,054 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 116 selfloop transitions, 91 changer transitions 5/237 dead transitions. [2024-11-19 01:49:00,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 237 transitions, 2473 flow [2024-11-19 01:49:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:49:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:49:00,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-11-19 01:49:00,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152542372881356 [2024-11-19 01:49:00,056 INFO L175 Difference]: Start difference. First operand has 91 places, 185 transitions, 1807 flow. Second operand 5 states and 211 transitions. [2024-11-19 01:49:00,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 237 transitions, 2473 flow [2024-11-19 01:49:00,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 237 transitions, 2372 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:49:00,528 INFO L231 Difference]: Finished difference. Result has 95 places, 189 transitions, 2039 flow [2024-11-19 01:49:00,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2039, PETRI_PLACES=95, PETRI_TRANSITIONS=189} [2024-11-19 01:49:00,529 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2024-11-19 01:49:00,529 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 189 transitions, 2039 flow [2024-11-19 01:49:00,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:00,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:00,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:00,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:49:00,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:00,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:00,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1574365825, now seen corresponding path program 6 times [2024-11-19 01:49:00,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:00,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371401110] [2024-11-19 01:49:00,531 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 01:49:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:00,548 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 01:49:00,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:00,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:00,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:00,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371401110] [2024-11-19 01:49:00,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371401110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:00,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:00,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:49:00,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382685199] [2024-11-19 01:49:00,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:00,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:49:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:00,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:49:00,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:49:00,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:00,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 189 transitions, 2039 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:00,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:00,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:00,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:03,472 INFO L124 PetriNetUnfolderBase]: 20083/32372 cut-off events. [2024-11-19 01:49:03,473 INFO L125 PetriNetUnfolderBase]: For 133913/136182 co-relation queries the response was YES. [2024-11-19 01:49:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120675 conditions, 32372 events. 20083/32372 cut-off events. For 133913/136182 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 262245 event pairs, 4425 based on Foata normal form. 1212/32298 useless extension candidates. Maximal degree in co-relation 94601. Up to 9620 conditions per place. [2024-11-19 01:49:03,660 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 120 selfloop transitions, 127 changer transitions 3/275 dead transitions. [2024-11-19 01:49:03,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 275 transitions, 2941 flow [2024-11-19 01:49:03,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:49:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:49:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 326 transitions. [2024-11-19 01:49:03,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2024-11-19 01:49:03,662 INFO L175 Difference]: Start difference. First operand has 95 places, 189 transitions, 2039 flow. Second operand 8 states and 326 transitions. [2024-11-19 01:49:03,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 275 transitions, 2941 flow [2024-11-19 01:49:03,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 275 transitions, 2828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:49:03,793 INFO L231 Difference]: Finished difference. Result has 102 places, 196 transitions, 2333 flow [2024-11-19 01:49:03,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2333, PETRI_PLACES=102, PETRI_TRANSITIONS=196} [2024-11-19 01:49:03,794 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2024-11-19 01:49:03,794 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 196 transitions, 2333 flow [2024-11-19 01:49:03,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:03,794 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:03,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:03,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:49:03,795 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:03,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash -466208189, now seen corresponding path program 2 times [2024-11-19 01:49:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:03,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648784827] [2024-11-19 01:49:03,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:49:03,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:03,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:49:03,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:03,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648784827] [2024-11-19 01:49:03,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648784827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:03,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:03,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:49:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424328311] [2024-11-19 01:49:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:03,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:49:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:03,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:49:03,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:49:03,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:03,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 196 transitions, 2333 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:03,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:03,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:03,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:06,918 INFO L124 PetriNetUnfolderBase]: 19464/31902 cut-off events. [2024-11-19 01:49:06,918 INFO L125 PetriNetUnfolderBase]: For 161756/163656 co-relation queries the response was YES. [2024-11-19 01:49:07,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124405 conditions, 31902 events. 19464/31902 cut-off events. For 161756/163656 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 262968 event pairs, 4270 based on Foata normal form. 1207/31930 useless extension candidates. Maximal degree in co-relation 97901. Up to 9533 conditions per place. [2024-11-19 01:49:07,134 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 122 selfloop transitions, 139 changer transitions 26/312 dead transitions. [2024-11-19 01:49:07,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 312 transitions, 3738 flow [2024-11-19 01:49:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:49:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:49:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2024-11-19 01:49:07,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7033898305084746 [2024-11-19 01:49:07,136 INFO L175 Difference]: Start difference. First operand has 102 places, 196 transitions, 2333 flow. Second operand 8 states and 332 transitions. [2024-11-19 01:49:07,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 312 transitions, 3738 flow [2024-11-19 01:49:07,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 312 transitions, 3515 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-11-19 01:49:07,331 INFO L231 Difference]: Finished difference. Result has 107 places, 207 transitions, 2653 flow [2024-11-19 01:49:07,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2158, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2653, PETRI_PLACES=107, PETRI_TRANSITIONS=207} [2024-11-19 01:49:07,332 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 43 predicate places. [2024-11-19 01:49:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 207 transitions, 2653 flow [2024-11-19 01:49:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:07,332 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:07,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:07,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:49:07,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash -520405845, now seen corresponding path program 7 times [2024-11-19 01:49:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331219637] [2024-11-19 01:49:07,333 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 01:49:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:49:07,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:07,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:07,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331219637] [2024-11-19 01:49:07,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331219637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:07,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:07,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:49:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784415126] [2024-11-19 01:49:07,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:07,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:49:07,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:07,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:49:07,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:49:07,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:07,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 207 transitions, 2653 flow. Second operand has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:07,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:07,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:07,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:09,712 INFO L124 PetriNetUnfolderBase]: 13479/22220 cut-off events. [2024-11-19 01:49:09,713 INFO L125 PetriNetUnfolderBase]: For 108052/109168 co-relation queries the response was YES. [2024-11-19 01:49:09,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86335 conditions, 22220 events. 13479/22220 cut-off events. For 108052/109168 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 173244 event pairs, 3104 based on Foata normal form. 828/22418 useless extension candidates. Maximal degree in co-relation 71321. Up to 6362 conditions per place. [2024-11-19 01:49:09,835 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 112 selfloop transitions, 138 changer transitions 35/309 dead transitions. [2024-11-19 01:49:09,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 309 transitions, 3930 flow [2024-11-19 01:49:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:49:09,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 01:49:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 328 transitions. [2024-11-19 01:49:09,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2024-11-19 01:49:09,837 INFO L175 Difference]: Start difference. First operand has 107 places, 207 transitions, 2653 flow. Second operand 8 states and 328 transitions. [2024-11-19 01:49:09,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 309 transitions, 3930 flow [2024-11-19 01:49:09,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 309 transitions, 3783 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:49:09,951 INFO L231 Difference]: Finished difference. Result has 113 places, 202 transitions, 2782 flow [2024-11-19 01:49:09,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2487, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2782, PETRI_PLACES=113, PETRI_TRANSITIONS=202} [2024-11-19 01:49:09,952 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 49 predicate places. [2024-11-19 01:49:09,952 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 202 transitions, 2782 flow [2024-11-19 01:49:09,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.142857142857142) internal successors, (190), 7 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:09,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:09,952 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:09,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:49:09,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:09,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1458401591, now seen corresponding path program 8 times [2024-11-19 01:49:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736457424] [2024-11-19 01:49:09,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:49:09,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:09,969 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:49:09,969 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49: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. [2024-11-19 01:49:10,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:10,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736457424] [2024-11-19 01:49:10,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736457424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:10,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:10,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:49:10,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118668280] [2024-11-19 01:49:10,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:10,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:49:10,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:10,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:49:10,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:49:10,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:10,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 202 transitions, 2782 flow. Second operand has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:10,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:10,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:10,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:11,917 INFO L124 PetriNetUnfolderBase]: 12306/19949 cut-off events. [2024-11-19 01:49:11,917 INFO L125 PetriNetUnfolderBase]: For 116199/117047 co-relation queries the response was YES. [2024-11-19 01:49:12,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79240 conditions, 19949 events. 12306/19949 cut-off events. For 116199/117047 co-relation queries the response was YES. Maximal size of possible extension queue 1045. Compared 151397 event pairs, 2965 based on Foata normal form. 496/19718 useless extension candidates. Maximal degree in co-relation 64408. Up to 7340 conditions per place. [2024-11-19 01:49:12,344 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 100 selfloop transitions, 138 changer transitions 31/293 dead transitions. [2024-11-19 01:49:12,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 293 transitions, 3831 flow [2024-11-19 01:49:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:49:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:49:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 348 transitions. [2024-11-19 01:49:12,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2024-11-19 01:49:12,345 INFO L175 Difference]: Start difference. First operand has 113 places, 202 transitions, 2782 flow. Second operand 9 states and 348 transitions. [2024-11-19 01:49:12,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 293 transitions, 3831 flow [2024-11-19 01:49:12,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 293 transitions, 3699 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:49:12,459 INFO L231 Difference]: Finished difference. Result has 119 places, 191 transitions, 2738 flow [2024-11-19 01:49:12,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2738, PETRI_PLACES=119, PETRI_TRANSITIONS=191} [2024-11-19 01:49:12,460 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 55 predicate places. [2024-11-19 01:49:12,460 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 191 transitions, 2738 flow [2024-11-19 01:49:12,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:12,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:12,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:12,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:49:12,461 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:12,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:12,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1356573209, now seen corresponding path program 9 times [2024-11-19 01:49:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310503723] [2024-11-19 01:49:12,461 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:49:12,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:12,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:49:12,475 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310503723] [2024-11-19 01:49:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310503723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:49:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428863821] [2024-11-19 01:49:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:49:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:12,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:49:12,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:12,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:12,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 191 transitions, 2738 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:12,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:12,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:12,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:14,445 INFO L124 PetriNetUnfolderBase]: 11627/18961 cut-off events. [2024-11-19 01:49:14,445 INFO L125 PetriNetUnfolderBase]: For 129513/130495 co-relation queries the response was YES. [2024-11-19 01:49:14,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76776 conditions, 18961 events. 11627/18961 cut-off events. For 129513/130495 co-relation queries the response was YES. Maximal size of possible extension queue 1016. Compared 144097 event pairs, 2866 based on Foata normal form. 670/18974 useless extension candidates. Maximal degree in co-relation 61763. Up to 7010 conditions per place. [2024-11-19 01:49:14,542 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 110 selfloop transitions, 136 changer transitions 18/288 dead transitions. [2024-11-19 01:49:14,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 288 transitions, 3743 flow [2024-11-19 01:49:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:49:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 01:49:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2024-11-19 01:49:14,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.614406779661017 [2024-11-19 01:49:14,544 INFO L175 Difference]: Start difference. First operand has 119 places, 191 transitions, 2738 flow. Second operand 12 states and 435 transitions. [2024-11-19 01:49:14,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 288 transitions, 3743 flow [2024-11-19 01:49:14,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 288 transitions, 3559 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-19 01:49:14,671 INFO L231 Difference]: Finished difference. Result has 127 places, 190 transitions, 2782 flow [2024-11-19 01:49:14,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2782, PETRI_PLACES=127, PETRI_TRANSITIONS=190} [2024-11-19 01:49:14,672 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2024-11-19 01:49:14,672 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 190 transitions, 2782 flow [2024-11-19 01:49:14,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:14,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:14,673 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:14,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:49:14,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:14,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1616034583, now seen corresponding path program 10 times [2024-11-19 01:49:14,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674111481] [2024-11-19 01:49:14,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:49:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:14,685 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:49:14,686 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674111481] [2024-11-19 01:49:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674111481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:49:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190989385] [2024-11-19 01:49:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:49:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:14,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:49:14,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:14,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:14,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 190 transitions, 2782 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:14,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:14,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:14,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:16,473 INFO L124 PetriNetUnfolderBase]: 11595/18937 cut-off events. [2024-11-19 01:49:16,474 INFO L125 PetriNetUnfolderBase]: For 145920/146700 co-relation queries the response was YES. [2024-11-19 01:49:16,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78317 conditions, 18937 events. 11595/18937 cut-off events. For 145920/146700 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 144326 event pairs, 3080 based on Foata normal form. 412/18659 useless extension candidates. Maximal degree in co-relation 62831. Up to 7053 conditions per place. [2024-11-19 01:49:16,816 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 94 selfloop transitions, 128 changer transitions 50/296 dead transitions. [2024-11-19 01:49:16,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 296 transitions, 3955 flow [2024-11-19 01:49:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:49:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 01:49:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-19 01:49:16,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-19 01:49:16,818 INFO L175 Difference]: Start difference. First operand has 127 places, 190 transitions, 2782 flow. Second operand 12 states and 438 transitions. [2024-11-19 01:49:16,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 296 transitions, 3955 flow [2024-11-19 01:49:16,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 296 transitions, 3697 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-19 01:49:16,953 INFO L231 Difference]: Finished difference. Result has 132 places, 181 transitions, 2659 flow [2024-11-19 01:49:16,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2659, PETRI_PLACES=132, PETRI_TRANSITIONS=181} [2024-11-19 01:49:16,954 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 68 predicate places. [2024-11-19 01:49:16,954 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 181 transitions, 2659 flow [2024-11-19 01:49:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:16,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:16,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:16,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:49:16,955 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:16,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:16,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1751130347, now seen corresponding path program 3 times [2024-11-19 01:49:16,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:16,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733206759] [2024-11-19 01:49:16,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:49:16,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:16,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:49:16,966 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:17,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:17,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733206759] [2024-11-19 01:49:17,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733206759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:17,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:17,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:49:17,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863252411] [2024-11-19 01:49:17,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:17,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:49:17,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:17,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:49:17,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:17,082 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:17,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 181 transitions, 2659 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:17,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:17,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:17,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:18,941 INFO L124 PetriNetUnfolderBase]: 11384/18738 cut-off events. [2024-11-19 01:49:18,942 INFO L125 PetriNetUnfolderBase]: For 149931/150935 co-relation queries the response was YES. [2024-11-19 01:49:18,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77816 conditions, 18738 events. 11384/18738 cut-off events. For 149931/150935 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 144227 event pairs, 3035 based on Foata normal form. 614/18734 useless extension candidates. Maximal degree in co-relation 62463. Up to 6965 conditions per place. [2024-11-19 01:49:19,024 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 103 selfloop transitions, 128 changer transitions 33/288 dead transitions. [2024-11-19 01:49:19,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 288 transitions, 3830 flow [2024-11-19 01:49:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:49:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 01:49:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 438 transitions. [2024-11-19 01:49:19,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2024-11-19 01:49:19,026 INFO L175 Difference]: Start difference. First operand has 132 places, 181 transitions, 2659 flow. Second operand 12 states and 438 transitions. [2024-11-19 01:49:19,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 288 transitions, 3830 flow [2024-11-19 01:49:19,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 288 transitions, 3530 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-11-19 01:49:19,161 INFO L231 Difference]: Finished difference. Result has 133 places, 180 transitions, 2605 flow [2024-11-19 01:49:19,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2605, PETRI_PLACES=133, PETRI_TRANSITIONS=180} [2024-11-19 01:49:19,162 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2024-11-19 01:49:19,162 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 180 transitions, 2605 flow [2024-11-19 01:49:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:19,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:49:19,163 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:49:19,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:49:19,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-19 01:49:19,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:49:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1735540055, now seen corresponding path program 2 times [2024-11-19 01:49:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:49:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461246986] [2024-11-19 01:49:19,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:49:19,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:49:19,173 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:49:19,174 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:49:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:49:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:49:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461246986] [2024-11-19 01:49:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461246986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:49:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:49:19,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:49:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658915251] [2024-11-19 01:49:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:49:19,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:49:19,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:49:19,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:49:19,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:49:19,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2024-11-19 01:49:19,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 180 transitions, 2605 flow. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:19,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:49:19,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2024-11-19 01:49:19,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:49:20,123 INFO L124 PetriNetUnfolderBase]: 3893/6605 cut-off events. [2024-11-19 01:49:20,123 INFO L125 PetriNetUnfolderBase]: For 41575/41953 co-relation queries the response was YES. [2024-11-19 01:49:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27678 conditions, 6605 events. 3893/6605 cut-off events. For 41575/41953 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 43186 event pairs, 1185 based on Foata normal form. 616/7119 useless extension candidates. Maximal degree in co-relation 27618. Up to 2436 conditions per place. [2024-11-19 01:49:20,144 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 0 selfloop transitions, 0 changer transitions 227/227 dead transitions. [2024-11-19 01:49:20,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 227 transitions, 3061 flow [2024-11-19 01:49:20,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:49:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 01:49:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 415 transitions. [2024-11-19 01:49:20,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5861581920903954 [2024-11-19 01:49:20,146 INFO L175 Difference]: Start difference. First operand has 133 places, 180 transitions, 2605 flow. Second operand 12 states and 415 transitions. [2024-11-19 01:49:20,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 227 transitions, 3061 flow [2024-11-19 01:49:20,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 227 transitions, 2997 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-19 01:49:20,202 INFO L231 Difference]: Finished difference. Result has 133 places, 0 transitions, 0 flow [2024-11-19 01:49:20,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=133, PETRI_TRANSITIONS=0} [2024-11-19 01:49:20,203 INFO L277 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2024-11-19 01:49:20,203 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 0 transitions, 0 flow [2024-11-19 01:49:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:49:20,205 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-19 01:49:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2024-11-19 01:49:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-19 01:49:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-19 01:49:20,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-19 01:49:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:49:20,207 INFO L407 BasicCegarLoop]: Path program histogram: [10, 3, 2, 1] [2024-11-19 01:49:20,212 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:49:20,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:49:20,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:49:20 BasicIcfg [2024-11-19 01:49:20,218 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:49:20,218 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:49:20,218 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:49:20,219 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:49:20,222 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:48:31" (3/4) ... [2024-11-19 01:49:20,225 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 01:49:20,228 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 01:49:20,228 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 01:49:20,228 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 01:49:20,228 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 01:49:20,232 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2024-11-19 01:49:20,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-19 01:49:20,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 01:49:20,233 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 01:49:20,306 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:49:20,307 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 01:49:20,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:49:20,308 INFO L158 Benchmark]: Toolchain (without parser) took 50136.12ms. Allocated memory was 138.4MB in the beginning and 15.1GB in the end (delta: 15.0GB). Free memory was 85.2MB in the beginning and 12.2GB in the end (delta: -12.2GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2024-11-19 01:49:20,308 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:49:20,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.53ms. Allocated memory is still 138.4MB. Free memory was 85.2MB in the beginning and 71.9MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:49:20,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.08ms. Allocated memory is still 138.4MB. Free memory was 71.5MB in the beginning and 69.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:49:20,309 INFO L158 Benchmark]: Boogie Preprocessor took 74.57ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 69.5MB in the beginning and 147.4MB in the end (delta: -77.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-19 01:49:20,309 INFO L158 Benchmark]: RCFGBuilder took 768.22ms. Allocated memory is still 176.2MB. Free memory was 147.3MB in the beginning and 113.0MB in the end (delta: 34.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-11-19 01:49:20,309 INFO L158 Benchmark]: TraceAbstraction took 48847.97ms. Allocated memory was 176.2MB in the beginning and 15.1GB in the end (delta: 14.9GB). Free memory was 111.9MB in the beginning and 12.2GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. [2024-11-19 01:49:20,309 INFO L158 Benchmark]: Witness Printer took 88.54ms. Allocated memory is still 15.1GB. Free memory was 12.2GB in the beginning and 12.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:49:20,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.53ms. Allocated memory is still 138.4MB. Free memory was 85.2MB in the beginning and 71.9MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.08ms. Allocated memory is still 138.4MB. Free memory was 71.5MB in the beginning and 69.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.57ms. Allocated memory was 138.4MB in the beginning and 176.2MB in the end (delta: 37.7MB). Free memory was 69.5MB in the beginning and 147.4MB in the end (delta: -77.9MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * RCFGBuilder took 768.22ms. Allocated memory is still 176.2MB. Free memory was 147.3MB in the beginning and 113.0MB in the end (delta: 34.3MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 48847.97ms. Allocated memory was 176.2MB in the beginning and 15.1GB in the end (delta: 14.9GB). Free memory was 111.9MB in the beginning and 12.2GB in the end (delta: -12.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.1GB. * Witness Printer took 88.54ms. Allocated memory is still 15.1GB. Free memory was 12.2GB in the beginning and 12.2GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 93 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 48.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 45.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1068 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1055 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4667 IncrementalHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 6 mSDtfsCounter, 4667 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2782occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 783 NumberOfCodeBlocks, 783 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 767 ConstructedInterpolants, 0 QuantifiedInterpolants, 1940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 01:49:20,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE