./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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/popl20-proofs-counter-add-4-semi-Q67.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 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:53:05,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:53:05,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:53:05,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:53:05,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:53:05,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:53:05,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:53:05,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:53:05,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:53:05,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:53:05,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:53:05,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:53:05,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:53:05,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:53:05,629 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:53:05,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:53:05,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:53:05,630 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:53:05,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:53:05,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:53:05,631 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:53:05,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:53:05,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:53:05,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:53:05,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:53:05,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:53:05,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:53:05,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:53:05,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:53:05,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:53:05,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:53:05,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:53:05,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:53:05,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:53:05,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:53:05,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:53:05,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:53:05,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:53:05,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:53:05,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:53:05,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:53:05,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:53:05,640 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 -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2024-11-22 13:53:05,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:53:05,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:53:05,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:53:05,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:53:05,943 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:53:05,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-22 13:53:07,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:53:07,551 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:53:07,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-22 13:53:07,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685987d41/dcbfc9b16c6848d1943993f9686b1f32/FLAG0092758fe [2024-11-22 13:53:07,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685987d41/dcbfc9b16c6848d1943993f9686b1f32 [2024-11-22 13:53:07,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:53:07,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:53:07,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:53:07,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:53:07,957 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:53:07,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:07" (1/1) ... [2024-11-22 13:53:07,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98496b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:07, skipping insertion in model container [2024-11-22 13:53:07,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:53:07" (1/1) ... [2024-11-22 13:53:07,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:53:08,191 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/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-11-22 13:53:08,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:53:08,209 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:53:08,236 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/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2663,2676] [2024-11-22 13:53:08,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:53:08,261 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:53:08,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08 WrapperNode [2024-11-22 13:53:08,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:53:08,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:53:08,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:53:08,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:53:08,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,297 INFO L138 Inliner]: procedures = 21, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2024-11-22 13:53:08,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:53:08,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:53:08,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:53:08,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:53:08,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,330 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-22 13:53:08,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:53:08,352 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:53:08,352 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:53:08,352 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:53:08,353 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (1/1) ... [2024-11-22 13:53:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:53:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:08,392 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-22 13:53:08,397 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-22 13:53:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:53:08,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 13:53:08,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 13:53:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 13:53:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 13:53:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 13:53:08,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 13:53:08,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 13:53:08,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 13:53:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:53:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 13:53:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 13:53:08,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:53:08,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:53:08,453 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 13:53:08,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:53:08,551 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:53:08,799 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 13:53:08,800 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:53:08,963 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:53:08,963 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 13:53:08,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:08 BoogieIcfgContainer [2024-11-22 13:53:08,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:53:08,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:53:08,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:53:08,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:53:08,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:53:07" (1/3) ... [2024-11-22 13:53:08,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ca0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:08, skipping insertion in model container [2024-11-22 13:53:08,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:53:08" (2/3) ... [2024-11-22 13:53:08,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ca0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:53:08, skipping insertion in model container [2024-11-22 13:53:08,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:53:08" (3/3) ... [2024-11-22 13:53:08,972 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-11-22 13:53:08,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:53:08,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:53:08,988 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 13:53:09,050 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 13:53:09,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 100 flow [2024-11-22 13:53:09,117 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2024-11-22 13:53:09,118 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:53:09,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-11-22 13:53:09,123 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 36 transitions, 100 flow [2024-11-22 13:53:09,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2024-11-22 13:53:09,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:53:09,142 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;@3e81577f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:53:09,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-22 13:53:09,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 13:53:09,158 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-22 13:53:09,159 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 13:53:09,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:09,159 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] [2024-11-22 13:53:09,160 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-22 13:53:09,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:09,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1863071349, now seen corresponding path program 1 times [2024-11-22 13:53:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770226509] [2024-11-22 13:53:09,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:09,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:09,496 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-22 13:53:09,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:09,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770226509] [2024-11-22 13:53:09,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770226509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:09,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:09,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:53:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499369082] [2024-11-22 13:53:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:09,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 13:53:09,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:09,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 13:53:09,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 13:53:09,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-22 13:53:09,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:53:09,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:09,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-22 13:53:09,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:09,874 INFO L124 PetriNetUnfolderBase]: 1184/1704 cut-off events. [2024-11-22 13:53:09,874 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-11-22 13:53:09,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1704 events. 1184/1704 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7289 event pairs, 182 based on Foata normal form. 44/1726 useless extension candidates. Maximal degree in co-relation 2858. Up to 1334 conditions per place. [2024-11-22 13:53:09,902 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 34 selfloop transitions, 3 changer transitions 2/48 dead transitions. [2024-11-22 13:53:09,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 219 flow [2024-11-22 13:53:09,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 13:53:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 13:53:09,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-11-22 13:53:09,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-11-22 13:53:09,936 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 81 transitions. [2024-11-22 13:53:09,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 219 flow [2024-11-22 13:53:09,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 13:53:09,949 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 93 flow [2024-11-22 13:53:09,952 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2024-11-22 13:53:09,958 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2024-11-22 13:53:09,958 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 93 flow [2024-11-22 13:53:09,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 13:53:09,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:09,959 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] [2024-11-22 13:53:09,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 13:53:09,960 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-22 13:53:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash 297338149, now seen corresponding path program 1 times [2024-11-22 13:53:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:09,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582352474] [2024-11-22 13:53:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:10,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:10,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582352474] [2024-11-22 13:53:10,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582352474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:10,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:10,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:10,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244879121] [2024-11-22 13:53:10,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:10,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:10,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:10,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:10,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-22 13:53:10,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:10,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:10,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-22 13:53:10,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:10,556 INFO L124 PetriNetUnfolderBase]: 1990/2821 cut-off events. [2024-11-22 13:53:10,556 INFO L125 PetriNetUnfolderBase]: For 694/740 co-relation queries the response was YES. [2024-11-22 13:53:10,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6514 conditions, 2821 events. 1990/2821 cut-off events. For 694/740 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 13010 event pairs, 331 based on Foata normal form. 8/2644 useless extension candidates. Maximal degree in co-relation 1262. Up to 1664 conditions per place. [2024-11-22 13:53:10,579 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 68 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2024-11-22 13:53:10,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 85 transitions, 398 flow [2024-11-22 13:53:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:10,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-11-22 13:53:10,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-11-22 13:53:10,583 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 93 flow. Second operand 5 states and 134 transitions. [2024-11-22 13:53:10,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 85 transitions, 398 flow [2024-11-22 13:53:10,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 85 transitions, 393 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:10,588 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 155 flow [2024-11-22 13:53:10,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2024-11-22 13:53:10,589 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-11-22 13:53:10,590 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 155 flow [2024-11-22 13:53:10,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:10,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:10,591 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] [2024-11-22 13:53:10,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:53:10,591 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-22 13:53:10,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1487597447, now seen corresponding path program 2 times [2024-11-22 13:53:10,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:10,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767433921] [2024-11-22 13:53:10,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:10,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:10,624 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:10,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:10,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767433921] [2024-11-22 13:53:10,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767433921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:10,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706831995] [2024-11-22 13:53:10,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:10,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:10,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:10,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:10,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:53:10,876 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:10,877 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:10,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:53:10,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:10,997 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:53:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706831995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:10,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:53:10,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-22 13:53:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037446323] [2024-11-22 13:53:10,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:10,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:10,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:53:11,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-22 13:53:11,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:11,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:11,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-22 13:53:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:11,293 INFO L124 PetriNetUnfolderBase]: 2154/3129 cut-off events. [2024-11-22 13:53:11,293 INFO L125 PetriNetUnfolderBase]: For 2715/2715 co-relation queries the response was YES. [2024-11-22 13:53:11,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 3129 events. 2154/3129 cut-off events. For 2715/2715 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 15455 event pairs, 320 based on Foata normal form. 96/3211 useless extension candidates. Maximal degree in co-relation 1832. Up to 1840 conditions per place. [2024-11-22 13:53:11,317 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 61 selfloop transitions, 5 changer transitions 2/76 dead transitions. [2024-11-22 13:53:11,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 417 flow [2024-11-22 13:53:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-22 13:53:11,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2024-11-22 13:53:11,321 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 155 flow. Second operand 4 states and 105 transitions. [2024-11-22 13:53:11,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 417 flow [2024-11-22 13:53:11,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 76 transitions, 417 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:11,327 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 189 flow [2024-11-22 13:53:11,327 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2024-11-22 13:53:11,328 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-11-22 13:53:11,328 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 189 flow [2024-11-22 13:53:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:11,329 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:11,329 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] [2024-11-22 13:53:11,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:53:11,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:11,530 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-22 13:53:11,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:11,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2084442391, now seen corresponding path program 3 times [2024-11-22 13:53:11,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:11,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520612244] [2024-11-22 13:53:11,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:11,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:11,550 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:11,550 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:11,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:11,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520612244] [2024-11-22 13:53:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520612244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:11,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:11,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:11,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109592331] [2024-11-22 13:53:11,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:11,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:11,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:11,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-22 13:53:11,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:11,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:11,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-22 13:53:11,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:11,976 INFO L124 PetriNetUnfolderBase]: 2169/3111 cut-off events. [2024-11-22 13:53:11,977 INFO L125 PetriNetUnfolderBase]: For 3865/3931 co-relation queries the response was YES. [2024-11-22 13:53:11,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 3111 events. 2169/3111 cut-off events. For 3865/3931 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 15027 event pairs, 498 based on Foata normal form. 14/3098 useless extension candidates. Maximal degree in co-relation 3577. Up to 2237 conditions per place. [2024-11-22 13:53:12,002 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 8 changer transitions 7/88 dead transitions. [2024-11-22 13:53:12,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 508 flow [2024-11-22 13:53:12,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:12,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-11-22 13:53:12,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-11-22 13:53:12,005 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 189 flow. Second operand 5 states and 128 transitions. [2024-11-22 13:53:12,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 508 flow [2024-11-22 13:53:12,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:12,010 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 235 flow [2024-11-22 13:53:12,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2024-11-22 13:53:12,012 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-11-22 13:53:12,012 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 235 flow [2024-11-22 13:53:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:12,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:12,013 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] [2024-11-22 13:53:12,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:53:12,014 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-22 13:53:12,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1459367843, now seen corresponding path program 1 times [2024-11-22 13:53:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810615781] [2024-11-22 13:53:12,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:12,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810615781] [2024-11-22 13:53:12,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810615781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:12,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486969601] [2024-11-22 13:53:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:12,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:12,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-22 13:53:12,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:12,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:12,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-22 13:53:12,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:12,507 INFO L124 PetriNetUnfolderBase]: 3230/4524 cut-off events. [2024-11-22 13:53:12,507 INFO L125 PetriNetUnfolderBase]: For 6748/6817 co-relation queries the response was YES. [2024-11-22 13:53:12,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14275 conditions, 4524 events. 3230/4524 cut-off events. For 6748/6817 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 22466 event pairs, 688 based on Foata normal form. 38/4418 useless extension candidates. Maximal degree in co-relation 7860. Up to 3502 conditions per place. [2024-11-22 13:53:12,546 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 56 selfloop transitions, 11 changer transitions 7/83 dead transitions. [2024-11-22 13:53:12,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 574 flow [2024-11-22 13:53:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:12,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:12,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-22 13:53:12,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-22 13:53:12,550 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 235 flow. Second operand 4 states and 100 transitions. [2024-11-22 13:53:12,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 574 flow [2024-11-22 13:53:12,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 546 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-22 13:53:12,560 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 302 flow [2024-11-22 13:53:12,561 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2024-11-22 13:53:12,562 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-11-22 13:53:12,564 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 302 flow [2024-11-22 13:53:12,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:12,565 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:12,565 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] [2024-11-22 13:53:12,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 13:53:12,565 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-22 13:53:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1243983511, now seen corresponding path program 2 times [2024-11-22 13:53:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782857729] [2024-11-22 13:53:12,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:12,580 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:12,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:12,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782857729] [2024-11-22 13:53:12,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782857729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:12,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:12,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120500733] [2024-11-22 13:53:12,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:12,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:12,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:12,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:12,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:12,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-11-22 13:53:12,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:12,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:12,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-11-22 13:53:12,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:13,073 INFO L124 PetriNetUnfolderBase]: 3126/4377 cut-off events. [2024-11-22 13:53:13,073 INFO L125 PetriNetUnfolderBase]: For 7759/7793 co-relation queries the response was YES. [2024-11-22 13:53:13,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 4377 events. 3126/4377 cut-off events. For 7759/7793 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 22007 event pairs, 828 based on Foata normal form. 22/4333 useless extension candidates. Maximal degree in co-relation 7065. Up to 3912 conditions per place. [2024-11-22 13:53:13,109 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 50 selfloop transitions, 11 changer transitions 7/77 dead transitions. [2024-11-22 13:53:13,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 518 flow [2024-11-22 13:53:13,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-22 13:53:13,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-11-22 13:53:13,111 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 302 flow. Second operand 4 states and 100 transitions. [2024-11-22 13:53:13,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 518 flow [2024-11-22 13:53:13,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:13,116 INFO L231 Difference]: Finished difference. Result has 56 places, 53 transitions, 330 flow [2024-11-22 13:53:13,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=56, PETRI_TRANSITIONS=53} [2024-11-22 13:53:13,119 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-11-22 13:53:13,120 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 330 flow [2024-11-22 13:53:13,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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-22 13:53:13,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:13,120 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] [2024-11-22 13:53:13,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:53:13,120 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-22 13:53:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1927580853, now seen corresponding path program 3 times [2024-11-22 13:53:13,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:13,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620090142] [2024-11-22 13:53:13,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:13,135 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:13,135 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620090142] [2024-11-22 13:53:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620090142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8778699] [2024-11-22 13:53:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:13,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:13,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:13,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 330 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-22 13:53:13,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:13,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:13,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:13,754 INFO L124 PetriNetUnfolderBase]: 4031/5394 cut-off events. [2024-11-22 13:53:13,755 INFO L125 PetriNetUnfolderBase]: For 10476/10508 co-relation queries the response was YES. [2024-11-22 13:53:13,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19394 conditions, 5394 events. 4031/5394 cut-off events. For 10476/10508 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 25000 event pairs, 782 based on Foata normal form. 33/5275 useless extension candidates. Maximal degree in co-relation 8616. Up to 4454 conditions per place. [2024-11-22 13:53:13,797 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 58 selfloop transitions, 8 changer transitions 6/80 dead transitions. [2024-11-22 13:53:13,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 586 flow [2024-11-22 13:53:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-22 13:53:13,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2024-11-22 13:53:13,799 INFO L175 Difference]: Start difference. First operand has 56 places, 53 transitions, 330 flow. Second operand 4 states and 97 transitions. [2024-11-22 13:53:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 586 flow [2024-11-22 13:53:13,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 562 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 13:53:13,806 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 293 flow [2024-11-22 13:53:13,808 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2024-11-22 13:53:13,809 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-22 13:53:13,809 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 293 flow [2024-11-22 13:53:13,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-22 13:53:13,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:13,810 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] [2024-11-22 13:53:13,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:53:13,811 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-22 13:53:13,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1595937107, now seen corresponding path program 4 times [2024-11-22 13:53:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:13,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466010932] [2024-11-22 13:53:13,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:53:13,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:13,824 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:53:13,825 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466010932] [2024-11-22 13:53:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466010932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850969585] [2024-11-22 13:53:13,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:53:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:13,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:13,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:53:13,976 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:53:13,976 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:13,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:53:13,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:14,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:14,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850969585] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:53:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2024-11-22 13:53:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570552296] [2024-11-22 13:53:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:14,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:14,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:14,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:14,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:53:14,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:14,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-22 13:53:14,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:14,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:14,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:14,634 INFO L124 PetriNetUnfolderBase]: 2816/3779 cut-off events. [2024-11-22 13:53:14,634 INFO L125 PetriNetUnfolderBase]: For 9019/9113 co-relation queries the response was YES. [2024-11-22 13:53:14,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14581 conditions, 3779 events. 2816/3779 cut-off events. For 9019/9113 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 16932 event pairs, 570 based on Foata normal form. 124/3838 useless extension candidates. Maximal degree in co-relation 4578. Up to 1765 conditions per place. [2024-11-22 13:53:14,662 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 65 selfloop transitions, 12 changer transitions 3/88 dead transitions. [2024-11-22 13:53:14,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 627 flow [2024-11-22 13:53:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-22 13:53:14,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7152777777777778 [2024-11-22 13:53:14,665 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 293 flow. Second operand 4 states and 103 transitions. [2024-11-22 13:53:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 627 flow [2024-11-22 13:53:14,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 597 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-11-22 13:53:14,671 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 332 flow [2024-11-22 13:53:14,671 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-22 13:53:14,672 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-11-22 13:53:14,672 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 332 flow [2024-11-22 13:53:14,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-22 13:53:14,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53: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] [2024-11-22 13:53:14,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:53:14,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-22 13:53:14,873 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-22 13:53:14,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:14,874 INFO L85 PathProgramCache]: Analyzing trace with hash -369155627, now seen corresponding path program 1 times [2024-11-22 13:53:14,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:14,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631760191] [2024-11-22 13:53:14,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:14,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:14,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631760191] [2024-11-22 13:53:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631760191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:14,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331114899] [2024-11-22 13:53:14,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:14,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:14,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:14,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:14,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:53:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:15,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:53:15,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:15,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:15,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331114899] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:15,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:53:15,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-11-22 13:53:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995705887] [2024-11-22 13:53:15,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:15,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:15,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:15,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:15,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:53:15,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:15,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:15,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:15,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:15,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:15,558 INFO L124 PetriNetUnfolderBase]: 3051/4147 cut-off events. [2024-11-22 13:53:15,558 INFO L125 PetriNetUnfolderBase]: For 12229/12325 co-relation queries the response was YES. [2024-11-22 13:53:15,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16811 conditions, 4147 events. 3051/4147 cut-off events. For 12229/12325 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 19204 event pairs, 570 based on Foata normal form. 70/4130 useless extension candidates. Maximal degree in co-relation 4824. Up to 2083 conditions per place. [2024-11-22 13:53:15,590 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 79 selfloop transitions, 10 changer transitions 1/100 dead transitions. [2024-11-22 13:53:15,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 100 transitions, 806 flow [2024-11-22 13:53:15,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2024-11-22 13:53:15,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2024-11-22 13:53:15,592 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 332 flow. Second operand 4 states and 102 transitions. [2024-11-22 13:53:15,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 100 transitions, 806 flow [2024-11-22 13:53:15,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 794 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:15,599 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 427 flow [2024-11-22 13:53:15,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2024-11-22 13:53:15,600 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-11-22 13:53:15,600 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 427 flow [2024-11-22 13:53:15,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:15,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:15,600 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] [2024-11-22 13:53:15,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:53:15,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:15,801 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-22 13:53:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1547694181, now seen corresponding path program 2 times [2024-11-22 13:53:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:15,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528614445] [2024-11-22 13:53:15,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:15,816 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:15,817 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528614445] [2024-11-22 13:53:15,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528614445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:15,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:15,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 13:53:15,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151989034] [2024-11-22 13:53:15,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:15,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:15,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:15,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:53:15,884 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:15,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:15,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:15,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:15,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:16,291 INFO L124 PetriNetUnfolderBase]: 3572/4933 cut-off events. [2024-11-22 13:53:16,291 INFO L125 PetriNetUnfolderBase]: For 17072/17638 co-relation queries the response was YES. [2024-11-22 13:53:16,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20860 conditions, 4933 events. 3572/4933 cut-off events. For 17072/17638 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 23771 event pairs, 815 based on Foata normal form. 53/4869 useless extension candidates. Maximal degree in co-relation 6937. Up to 4076 conditions per place. [2024-11-22 13:53:16,335 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 64 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-11-22 13:53:16,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 766 flow [2024-11-22 13:53:16,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:16,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-22 13:53:16,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6805555555555556 [2024-11-22 13:53:16,336 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 427 flow. Second operand 4 states and 98 transitions. [2024-11-22 13:53:16,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 766 flow [2024-11-22 13:53:16,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 766 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:16,345 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 540 flow [2024-11-22 13:53:16,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=540, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-22 13:53:16,346 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-11-22 13:53:16,346 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 540 flow [2024-11-22 13:53:16,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:16,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:16,346 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] [2024-11-22 13:53:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 13:53:16,347 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-22 13:53:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1381948709, now seen corresponding path program 3 times [2024-11-22 13:53:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183619407] [2024-11-22 13:53:16,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:16,357 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:16,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:16,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:16,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183619407] [2024-11-22 13:53:16,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183619407] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:16,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346204065] [2024-11-22 13:53:16,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:16,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:16,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:16,437 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:16,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:53:16,503 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:16,503 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:16,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:53:16,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:16,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346204065] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:16,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:53:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 8 [2024-11-22 13:53:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944399166] [2024-11-22 13:53:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:16,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:53:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:53:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:53:16,687 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:16,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 540 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:16,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:16,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:16,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:17,128 INFO L124 PetriNetUnfolderBase]: 3739/5020 cut-off events. [2024-11-22 13:53:17,129 INFO L125 PetriNetUnfolderBase]: For 21689/21865 co-relation queries the response was YES. [2024-11-22 13:53:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23079 conditions, 5020 events. 3739/5020 cut-off events. For 21689/21865 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 23343 event pairs, 566 based on Foata normal form. 29/4883 useless extension candidates. Maximal degree in co-relation 14031. Up to 2172 conditions per place. [2024-11-22 13:53:17,184 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 80 selfloop transitions, 6 changer transitions 5/102 dead transitions. [2024-11-22 13:53:17,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 1012 flow [2024-11-22 13:53:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:53:17,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 13:53:17,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-22 13:53:17,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-11-22 13:53:17,186 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 540 flow. Second operand 4 states and 93 transitions. [2024-11-22 13:53:17,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 1012 flow [2024-11-22 13:53:17,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 102 transitions, 1005 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:17,206 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 601 flow [2024-11-22 13:53:17,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=601, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-22 13:53:17,207 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-11-22 13:53:17,207 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 601 flow [2024-11-22 13:53:17,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-22 13:53:17,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:17,208 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] [2024-11-22 13:53:17,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 13:53:17,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:17,408 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-22 13:53:17,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:17,409 INFO L85 PathProgramCache]: Analyzing trace with hash 341393769, now seen corresponding path program 1 times [2024-11-22 13:53:17,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:17,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118888191] [2024-11-22 13:53:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:17,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:17,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118888191] [2024-11-22 13:53:17,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118888191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:53:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:53:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:53:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208365102] [2024-11-22 13:53:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:53:17,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:53:17,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:53:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:53:17,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-11-22 13:53:17,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 601 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 13:53:17,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:17,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-11-22 13:53:17,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:17,992 INFO L124 PetriNetUnfolderBase]: 3597/5013 cut-off events. [2024-11-22 13:53:17,992 INFO L125 PetriNetUnfolderBase]: For 30328/31236 co-relation queries the response was YES. [2024-11-22 13:53:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24681 conditions, 5013 events. 3597/5013 cut-off events. For 30328/31236 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24711 event pairs, 261 based on Foata normal form. 256/5158 useless extension candidates. Maximal degree in co-relation 14105. Up to 2998 conditions per place. [2024-11-22 13:53:18,045 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 88 selfloop transitions, 12 changer transitions 0/115 dead transitions. [2024-11-22 13:53:18,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 115 transitions, 1145 flow [2024-11-22 13:53:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-22 13:53:18,047 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-11-22 13:53:18,047 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 601 flow. Second operand 5 states and 124 transitions. [2024-11-22 13:53:18,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 115 transitions, 1145 flow [2024-11-22 13:53:18,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 1131 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-11-22 13:53:18,072 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 632 flow [2024-11-22 13:53:18,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=632, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2024-11-22 13:53:18,073 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-11-22 13:53:18,075 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 632 flow [2024-11-22 13:53:18,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-22 13:53:18,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:18,075 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] [2024-11-22 13:53:18,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 13:53:18,075 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-22 13:53:18,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1506728749, now seen corresponding path program 1 times [2024-11-22 13:53:18,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:18,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717862890] [2024-11-22 13:53:18,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:18,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:18,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717862890] [2024-11-22 13:53:18,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717862890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:18,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731755050] [2024-11-22 13:53:18,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:53:18,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:18,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:18,193 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:18,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:53:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:53:18,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:53:18,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:18,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:18,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731755050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:53:18,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:53:18,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 7 [2024-11-22 13:53:18,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658315537] [2024-11-22 13:53:18,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:53:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:53:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:18,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:53:18,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:53:18,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-11-22 13:53:18,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 632 flow. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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-22 13:53:18,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:18,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-11-22 13:53:18,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:19,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, 681#(= ~counter~0 0), Black: 50#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,021 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-22 13:53:19,021 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:53:19,021 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:53:19,021 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:53:19,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,287 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,287 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,287 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,287 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,288 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,288 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,288 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,288 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,289 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,289 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,290 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,290 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,359 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,359 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,360 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-22 13:53:19,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 36#thread3EXITtrue, 151#true, Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 445#(< ~j2~0 ~M2~0), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L99true, 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,362 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,362 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,362 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,362 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 8#L67true, Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,363 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,363 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,363 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,363 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,364 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,364 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,364 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,364 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,409 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 14#L98-4true, 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,409 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,409 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,410 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,410 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,410 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-22 13:53:19,412 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 52#true, 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 11#L99true, 13#L41true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,413 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,413 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,413 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,413 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,442 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([363] L52-->L56: Formula: (and (= v_~counter~0_122 (+ v_~counter~0_121 1)) (= (+ v_~i2~0_53 1) v_~i2~0_52) (not (= (ite (< 0 v_~counter~0_122) 1 0) 0))) InVars {~counter~0=v_~counter~0_122, ~i2~0=v_~i2~0_53} OutVars{~counter~0=v_~counter~0_121, thread2Thread1of1ForFork2_#t~post4#1=|v_thread2Thread1of1ForFork2_#t~post4#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_#t~post3#1=|v_thread2Thread1of1ForFork2_#t~post3#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~i2~0=v_~i2~0_52} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork2_#t~post4#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~post3#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~i2~0][93], [Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 173#true, 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 327#true, Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 3#thread4EXITtrue, 6#L56true, 36#thread3EXITtrue, 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 503#true, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 13#L41true, 11#L99true, Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 176#(<= (+ ~i1~0 1) ~N1~0)]) [2024-11-22 13:53:19,442 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,442 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,442 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,442 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,442 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-22 13:53:19,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L75-->L79: Formula: (and (not (= (ite (< 0 v_~counter~0_128) 1 0) 0)) (= (+ v_~counter~0_127 1) v_~counter~0_128) (= v_~j2~0_42 (+ v_~j2~0_43 1))) InVars {~counter~0=v_~counter~0_128, ~j2~0=v_~j2~0_43} OutVars{~counter~0=v_~counter~0_127, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_1|, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork1_#t~post7#1=|v_thread4Thread1of1ForFork1_#t~post7#1_1|, ~j2~0=v_~j2~0_42, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork1_#t~post7#1, ~j2~0, thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1][128], [18#L99-1true, Black: 290#(or (< ~M1~0 (+ ~j1~0 1)) (< ~i1~0 ~N1~0)), Black: 176#(<= (+ ~i1~0 1) ~N1~0), 671#true, Black: 140#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= 1 ~M1~0) (<= ~j1~0 0)), Black: 68#(and (<= 0 ~i1~0) (= ~M1~0 ~N1~0) (<= ~j1~0 0)), Black: 145#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0)), 22#L79true, 19#L64true, Black: 503#true, 327#true, Black: 634#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), Black: 153#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 675#(and (<= 1 ~N2~0) (= ~i2~0 0)), 151#true, Black: 445#(< ~j2~0 ~M2~0), Black: 168#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 173#true, 52#true, Black: 464#(or (< ~j2~0 ~M2~0) (< ~N1~0 (+ ~i1~0 1))), 10#thread2EXITtrue, Black: 50#(= ~counter~0 0), 681#(= ~counter~0 0), Black: 497#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 500#(and (= ~i1~0 0) (<= 1 ~N2~0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 621#(<= ~N1~0 ~i1~0), Black: 57#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 54#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0))]) [2024-11-22 13:53:19,557 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-22 13:53:19,557 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:53:19,557 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-22 13:53:19,557 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-22 13:53:19,562 INFO L124 PetriNetUnfolderBase]: 8892/13328 cut-off events. [2024-11-22 13:53:19,562 INFO L125 PetriNetUnfolderBase]: For 83146/84845 co-relation queries the response was YES. [2024-11-22 13:53:19,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68546 conditions, 13328 events. 8892/13328 cut-off events. For 83146/84845 co-relation queries the response was YES. Maximal size of possible extension queue 775. Compared 84869 event pairs, 1550 based on Foata normal form. 894/13813 useless extension candidates. Maximal degree in co-relation 39129. Up to 5508 conditions per place. [2024-11-22 13:53:19,674 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 86 selfloop transitions, 33 changer transitions 2/152 dead transitions. [2024-11-22 13:53:19,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 152 transitions, 1494 flow [2024-11-22 13:53:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:53:19,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 13:53:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-11-22 13:53:19,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2024-11-22 13:53:19,676 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 632 flow. Second operand 5 states and 147 transitions. [2024-11-22 13:53:19,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 152 transitions, 1494 flow [2024-11-22 13:53:19,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 152 transitions, 1445 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 13:53:19,723 INFO L231 Difference]: Finished difference. Result has 76 places, 96 transitions, 1013 flow [2024-11-22 13:53:19,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1013, PETRI_PLACES=76, PETRI_TRANSITIONS=96} [2024-11-22 13:53:19,724 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2024-11-22 13:53:19,725 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 96 transitions, 1013 flow [2024-11-22 13:53:19,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 8 states have internal predecessors, (143), 0 states have call successors, (0), 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-22 13:53:19,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:19,726 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:53:19,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 13:53:19,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 13:53:19,927 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-22 13:53:19,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash -381347263, now seen corresponding path program 2 times [2024-11-22 13:53:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:19,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356509546] [2024-11-22 13:53:19,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:19,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:19,938 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:19,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:20,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:53:20,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356509546] [2024-11-22 13:53:20,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356509546] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:20,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319659187] [2024-11-22 13:53:20,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 13:53:20,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:20,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:20,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 13:53:20,121 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 13:53:20,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:20,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:53:20,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:20,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319659187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:53:20,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:53:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-22 13:53:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622629555] [2024-11-22 13:53:20,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:53:20,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 13:53:20,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 13:53:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:53:20,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-22 13:53:20,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 96 transitions, 1013 flow. Second operand has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 13:53:20,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:20,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-22 13:53:20,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:28,126 INFO L124 PetriNetUnfolderBase]: 51822/70930 cut-off events. [2024-11-22 13:53:28,126 INFO L125 PetriNetUnfolderBase]: For 424524/424720 co-relation queries the response was YES. [2024-11-22 13:53:28,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365106 conditions, 70930 events. 51822/70930 cut-off events. For 424524/424720 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 457604 event pairs, 1792 based on Foata normal form. 6373/77164 useless extension candidates. Maximal degree in co-relation 136942. Up to 22627 conditions per place. [2024-11-22 13:53:28,690 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 730 selfloop transitions, 416 changer transitions 16/1169 dead transitions. [2024-11-22 13:53:28,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 1169 transitions, 13411 flow [2024-11-22 13:53:28,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-22 13:53:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-11-22 13:53:28,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 1139 transitions. [2024-11-22 13:53:28,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-11-22 13:53:28,695 INFO L175 Difference]: Start difference. First operand has 76 places, 96 transitions, 1013 flow. Second operand 51 states and 1139 transitions. [2024-11-22 13:53:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 1169 transitions, 13411 flow [2024-11-22 13:53:28,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 1169 transitions, 12339 flow, removed 536 selfloop flow, removed 0 redundant places. [2024-11-22 13:53:28,884 INFO L231 Difference]: Finished difference. Result has 168 places, 498 transitions, 6908 flow [2024-11-22 13:53:28,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=6908, PETRI_PLACES=168, PETRI_TRANSITIONS=498} [2024-11-22 13:53:28,885 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-11-22 13:53:28,885 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 498 transitions, 6908 flow [2024-11-22 13:53:28,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.357142857142858) internal successors, (215), 14 states have internal predecessors, (215), 0 states have call successors, (0), 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-22 13:53:28,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:53:28,886 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:53:28,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 13:53:29,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:29,091 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-22 13:53:29,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:53:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash 564055613, now seen corresponding path program 3 times [2024-11-22 13:53:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:53:29,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821508198] [2024-11-22 13:53:29,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:53:29,106 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:29,107 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:53:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:53:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821508198] [2024-11-22 13:53:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821508198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:53:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261837089] [2024-11-22 13:53:29,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 13:53:29,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:53:29,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:53:29,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:53:29,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 13:53:29,261 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 13:53:29,262 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:53:29,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:53:29,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:53:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:53:29,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:53:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 13:53:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261837089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:53:29,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:53:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-22 13:53:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831883837] [2024-11-22 13:53:29,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:53:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 13:53:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:53:29,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 13:53:29,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:53:29,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-22 13:53:29,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 498 transitions, 6908 flow. Second operand has 14 states, 14 states have (on average 15.5) internal successors, (217), 14 states have internal predecessors, (217), 0 states have call successors, (0), 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-22 13:53:29,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:53:29,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-22 13:53:29,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 13:53:53,011 INFO L124 PetriNetUnfolderBase]: 92595/126183 cut-off events. [2024-11-22 13:53:53,011 INFO L125 PetriNetUnfolderBase]: For 4753197/4753287 co-relation queries the response was YES. [2024-11-22 13:53:54,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085413 conditions, 126183 events. 92595/126183 cut-off events. For 4753197/4753287 co-relation queries the response was YES. Maximal size of possible extension queue 5077. Compared 858822 event pairs, 5733 based on Foata normal form. 4070/129936 useless extension candidates. Maximal degree in co-relation 797428. Up to 33443 conditions per place. [2024-11-22 13:53:54,906 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 1087 selfloop transitions, 700 changer transitions 79/1873 dead transitions. [2024-11-22 13:53:54,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 1873 transitions, 30950 flow [2024-11-22 13:53:54,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 13:53:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-22 13:53:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 699 transitions. [2024-11-22 13:53:54,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6067708333333334 [2024-11-22 13:53:54,909 INFO L175 Difference]: Start difference. First operand has 168 places, 498 transitions, 6908 flow. Second operand 32 states and 699 transitions. [2024-11-22 13:53:54,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 1873 transitions, 30950 flow [2024-11-22 13:54:27,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1873 transitions, 28795 flow, removed 959 selfloop flow, removed 4 redundant places. [2024-11-22 13:54:28,008 INFO L231 Difference]: Finished difference. Result has 214 places, 1012 transitions, 16608 flow [2024-11-22 13:54:28,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=6088, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=493, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=16608, PETRI_PLACES=214, PETRI_TRANSITIONS=1012} [2024-11-22 13:54:28,009 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 174 predicate places. [2024-11-22 13:54:28,009 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 1012 transitions, 16608 flow [2024-11-22 13:54:28,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.5) internal successors, (217), 14 states have internal predecessors, (217), 0 states have call successors, (0), 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-22 13:54:28,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 13:54:28,010 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:54:28,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 13:54:28,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:28,210 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-22 13:54:28,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:54:28,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1114993845, now seen corresponding path program 4 times [2024-11-22 13:54:28,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:54:28,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219081869] [2024-11-22 13:54:28,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:54:28,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:54:28,222 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:54:28,222 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:28,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 13:54:28,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:54:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219081869] [2024-11-22 13:54:28,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219081869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:54:28,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717244918] [2024-11-22 13:54:28,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 13:54:28,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:54:28,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:54:28,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:54:28,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 13:54:28,362 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 13:54:28,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 13:54:28,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 13:54:28,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:54:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:54:28,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:54:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 13:54:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717244918] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:54:28,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:54:28,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-22 13:54:28,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676653728] [2024-11-22 13:54:28,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:54:28,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 13:54:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:54:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 13:54:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-22 13:54:28,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-11-22 13:54:28,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 1012 transitions, 16608 flow. Second operand has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 13 states have internal predecessors, (196), 0 states have call successors, (0), 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-22 13:54:28,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 13:54:28,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-11-22 13:54:28,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand