./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d 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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:38:31,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:38:31,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:38:31,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:38:31,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:38:31,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:38:31,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:38:31,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:38:31,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:38:31,613 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:38:31,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:38:31,614 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:38:31,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:38:31,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:38:31,617 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:38:31,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:38:31,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:38:31,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:38:31,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:38:31,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:38:31,619 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:38:31,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:38:31,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:38:31,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:38:31,623 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:38:31,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:38:31,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:38:31,624 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:38:31,624 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:38:31,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:38:31,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:38:31,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:38:31,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:38:31,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:38:31,626 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:38:31,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:38:31,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:38:31,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:38:31,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:38:31,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:38:31,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:38:31,629 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:38:31,629 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a42fdc99fbc54512a7829bd297e0f02fe251a511098f304812399f6e9de1d8b6 [2024-10-13 12:38:31,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:38:31,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:38:31,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:38:31,921 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:38:31,921 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:38:31,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-4.wvr.c [2024-10-13 12:38:33,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:38:33,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:38:33,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-bakery-4.wvr.c [2024-10-13 12:38:33,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c0c20e2/fe6ac734933e4c5f85fcf30f16a59b98/FLAGd787fce2e [2024-10-13 12:38:33,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4c0c20e2/fe6ac734933e4c5f85fcf30f16a59b98 [2024-10-13 12:38:33,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:38:33,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:38:33,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:38:33,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:38:33,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:38:33,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:33,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c24feab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33, skipping insertion in model container [2024-10-13 12:38:33,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:33,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:38:33,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:38:33,912 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:38:33,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:38:33,982 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:38:33,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33 WrapperNode [2024-10-13 12:38:33,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:38:33,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:38:33,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:38:33,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:38:33,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,042 INFO L138 Inliner]: procedures = 22, calls = 157, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 390 [2024-10-13 12:38:34,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:38:34,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:38:34,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:38:34,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:38:34,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,085 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-10-13 12:38:34,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:38:34,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:38:34,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:38:34,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:38:34,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (1/1) ... [2024-10-13 12:38:34,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:38:34,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:38:34,144 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-10-13 12:38:34,151 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-10-13 12:38:34,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:38:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 12:38:34,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 12:38:34,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 12:38:34,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 12:38:34,205 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 12:38:34,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 12:38:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-13 12:38:34,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-13 12:38:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 12:38:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:38:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:38:34,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:38:34,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:38:34,210 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:38:34,335 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:38:34,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:38:34,860 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:38:34,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:38:35,237 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:38:35,237 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:38:35,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:38:35 BoogieIcfgContainer [2024-10-13 12:38:35,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:38:35,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:38:35,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:38:35,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:38:35,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:38:33" (1/3) ... [2024-10-13 12:38:35,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688ea8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:38:35, skipping insertion in model container [2024-10-13 12:38:35,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:38:33" (2/3) ... [2024-10-13 12:38:35,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688ea8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:38:35, skipping insertion in model container [2024-10-13 12:38:35,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:38:35" (3/3) ... [2024-10-13 12:38:35,251 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2024-10-13 12:38:35,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:38:35,270 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 12:38:35,270 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:38:35,336 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 12:38:35,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 90 transitions, 208 flow [2024-10-13 12:38:35,428 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-10-13 12:38:35,429 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 12:38:35,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 86 events. 0/86 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 210 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-10-13 12:38:35,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 90 transitions, 208 flow [2024-10-13 12:38:35,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 85 transitions, 194 flow [2024-10-13 12:38:35,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:38:35,450 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=None, 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;@7aed1665, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:38:35,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 12:38:35,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:38:35,480 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2024-10-13 12:38:35,480 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 12:38:35,480 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:38:35,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 12:38:35,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:38:35,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:38:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 824714501, now seen corresponding path program 1 times [2024-10-13 12:38:35,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:38:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785529127] [2024-10-13 12:38:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:38:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:38:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:38:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:38:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:38:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785529127] [2024-10-13 12:38:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785529127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:38:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:38:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 12:38:36,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348874061] [2024-10-13 12:38:36,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:38:36,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 12:38:36,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:38:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 12:38:36,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:38:36,633 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 90 [2024-10-13 12:38:36,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 194 flow. Second operand has 11 states, 11 states have (on average 38.90909090909091) internal successors, (428), 11 states have internal predecessors, (428), 0 states have call successors, (0), 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-10-13 12:38:36,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:38:36,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 90 [2024-10-13 12:38:36,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:38:52,193 INFO L124 PetriNetUnfolderBase]: 125690/181291 cut-off events. [2024-10-13 12:38:52,195 INFO L125 PetriNetUnfolderBase]: For 6198/6198 co-relation queries the response was YES. [2024-10-13 12:38:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355111 conditions, 181291 events. 125690/181291 cut-off events. For 6198/6198 co-relation queries the response was YES. Maximal size of possible extension queue 4912. Compared 1448683 event pairs, 44888 based on Foata normal form. 8/180796 useless extension candidates. Maximal degree in co-relation 336036. Up to 64438 conditions per place. [2024-10-13 12:38:53,526 INFO L140 encePairwiseOnDemand]: 79/90 looper letters, 294 selfloop transitions, 25 changer transitions 22/370 dead transitions. [2024-10-13 12:38:53,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 370 transitions, 1548 flow [2024-10-13 12:38:53,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 12:38:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-10-13 12:38:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 825 transitions. [2024-10-13 12:38:53,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2024-10-13 12:38:53,544 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 194 flow. Second operand 14 states and 825 transitions. [2024-10-13 12:38:53,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 370 transitions, 1548 flow [2024-10-13 12:38:53,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 370 transitions, 1464 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:38:53,752 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 329 flow [2024-10-13 12:38:53,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=329, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-10-13 12:38:53,759 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-10-13 12:38:53,760 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 329 flow [2024-10-13 12:38:53,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 38.90909090909091) internal successors, (428), 11 states have internal predecessors, (428), 0 states have call successors, (0), 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-10-13 12:38:53,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:38:53,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 12:38:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 12:38:53,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:38:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:38:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1983229987, now seen corresponding path program 2 times [2024-10-13 12:38:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:38:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055218615] [2024-10-13 12:38:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:38:53,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:38:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:38:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:38:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:38:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055218615] [2024-10-13 12:38:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055218615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:38:54,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:38:54,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:38:54,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291992102] [2024-10-13 12:38:54,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:38:54,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 12:38:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:38:54,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 12:38:54,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 12:38:54,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 90 [2024-10-13 12:38:54,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 329 flow. Second operand has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-10-13 12:38:54,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:38:54,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 90 [2024-10-13 12:38:54,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:39:14,544 INFO L124 PetriNetUnfolderBase]: 201457/291479 cut-off events. [2024-10-13 12:39:14,545 INFO L125 PetriNetUnfolderBase]: For 1675/1675 co-relation queries the response was YES. [2024-10-13 12:39:15,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582839 conditions, 291479 events. 201457/291479 cut-off events. For 1675/1675 co-relation queries the response was YES. Maximal size of possible extension queue 5587. Compared 2403117 event pairs, 83001 based on Foata normal form. 2982/288220 useless extension candidates. Maximal degree in co-relation 582803. Up to 231752 conditions per place. [2024-10-13 12:39:16,866 INFO L140 encePairwiseOnDemand]: 76/90 looper letters, 195 selfloop transitions, 36 changer transitions 0/286 dead transitions. [2024-10-13 12:39:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 286 transitions, 1150 flow [2024-10-13 12:39:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:39:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:39:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 512 transitions. [2024-10-13 12:39:16,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6320987654320988 [2024-10-13 12:39:16,869 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 329 flow. Second operand 9 states and 512 transitions. [2024-10-13 12:39:16,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 286 transitions, 1150 flow [2024-10-13 12:39:16,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 286 transitions, 1148 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 12:39:16,978 INFO L231 Difference]: Finished difference. Result has 117 places, 150 transitions, 568 flow [2024-10-13 12:39:16,978 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=568, PETRI_PLACES=117, PETRI_TRANSITIONS=150} [2024-10-13 12:39:16,979 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 19 predicate places. [2024-10-13 12:39:16,979 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 150 transitions, 568 flow [2024-10-13 12:39:16,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.55555555555556) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-10-13 12:39:16,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:39:16,982 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 12:39:16,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 12:39:16,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 12:39:16,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:39:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -267321881, now seen corresponding path program 3 times [2024-10-13 12:39:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 12:39:16,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899267] [2024-10-13 12:39:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:39:16,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 12:39:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:39:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:39:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 12:39:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899267] [2024-10-13 12:39:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:39:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:39:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:39:17,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255400136] [2024-10-13 12:39:17,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:39:17,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:39:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 12:39:17,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:39:17,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:39:17,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 90 [2024-10-13 12:39:17,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 150 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:39:17,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:39:17,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 90 [2024-10-13 12:39:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:39:20,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 10#L118true, 38#$Ultimate##0true, 106#true, 61#L273-4true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 163#true, 142#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:20,309 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-10-13 12:39:20,309 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:39:20,313 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:39:20,313 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-10-13 12:39:20,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, 29#L274true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 10#L118true, 38#$Ultimate##0true, 106#true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), 142#true, 163#true, Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:20,606 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,606 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,606 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,606 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,609 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 38#$Ultimate##0true, 106#true, 61#L273-4true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 68#L121true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), 142#true, 163#true, Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:20,609 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,609 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,609 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,609 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-10-13 12:39:20,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, 29#L274true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 38#$Ultimate##0true, 106#true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 68#L121true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), 142#true, 163#true, Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:20,929 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-10-13 12:39:20,929 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-13 12:39:20,930 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-13 12:39:20,930 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-10-13 12:39:21,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([910] L157-->L160: Formula: (= (+ v_~n3~0_35 1) v_~n3~0_34) InVars {~n3~0=v_~n3~0_35} OutVars{~n3~0=v_~n3~0_34, thread3Thread1of1ForFork3_#t~post3#1=|v_thread3Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post3#1, ~n3~0][84], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 25#L160true, 106#true, 4#L206true, 61#L273-4true, 49#L111true, 11#thread1EXITtrue, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 163#true, 142#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:21,022 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,022 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,022 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,022 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 38#$Ultimate##0true, 106#true, 61#L273-4true, 35#L124true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 142#true, 163#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:21,643 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2024-10-13 12:39:21,643 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2024-10-13 12:39:21,643 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2024-10-13 12:39:21,643 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2024-10-13 12:39:21,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([927] L209-->L212: Formula: (= (+ 1 v_~n4~0_135) v_~n4~0_134) InVars {~n4~0=v_~n4~0_135} OutVars{~n4~0=v_~n4~0_134, thread4Thread1of1ForFork1_#t~post4#1=|v_thread4Thread1of1ForFork1_#t~post4#1_1|} AuxVars[] AssignedVars[~n4~0, thread4Thread1of1ForFork1_#t~post4#1][98], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 26#L88true, 44#L212true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 38#$Ultimate##0true, 106#true, 61#L273-4true, 93#L127true, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 142#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), 163#true, Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:21,661 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,661 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,661 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,661 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-10-13 12:39:21,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([910] L157-->L160: Formula: (= (+ v_~n3~0_35 1) v_~n3~0_34) InVars {~n3~0=v_~n3~0_35} OutVars{~n3~0=v_~n3~0_34, thread3Thread1of1ForFork3_#t~post3#1=|v_thread3Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_#t~post3#1, ~n3~0][84], [Black: 145#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 152#(and (<= 1 ~n1~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 144#(and (<= ~n2~0 0) (= ~n1~0 0) (<= ~n3~0 0) (<= ~n4~0 0)), 29#L274true, Black: 130#(and (= ~i4~0 0) (= 3 ~i~0) (= ~i3~0 1) (= 2 ~i2~0)), Black: 120#(and (= ~i4~0 0) (= ~i~0 1)), Black: 124#(and (= 2 ~i~0) (= ~i4~0 0) (= ~i3~0 1)), Black: 108#(= ~i~0 0), 25#L160true, 106#true, 4#L206true, 49#L111true, 11#thread1EXITtrue, Black: 146#(and (<= 1 ~n1~0) (= ~n2~0 ~n1~0) (<= (+ ~n4~0 1) ~n1~0) (<= (+ ~n3~0 1) ~n1~0)), 142#true, 163#true, Black: 154#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= (+ ~n4~0 1) ~n2~0) (<= ~n1~0 ~n2~0)), Black: 156#(and (<= 1 ~n1~0) (<= 2 ~n2~0) (<= ~n1~0 ~n2~0))]) [2024-10-13 12:39:21,740 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2024-10-13 12:39:21,740 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-13 12:39:21,740 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2024-10-13 12:39:21,740 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event