./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:37:25,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:37:25,392 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:37:25,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:37:25,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:37:25,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:37:25,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:37:25,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:37:25,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:37:25,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:37:25,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:37:25,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:37:25,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:37:25,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:37:25,417 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:37:25,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:37:25,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:37:25,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:25,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:37:25,418 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:37:25,419 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2025-02-08 08:37:25,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:37:25,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:37:25,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:37:25,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:37:25,633 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:37:25,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-02-08 08:37:26,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5dcdd85/d2d895723628448db9d76ff9c0c41884/FLAG24948de91 [2025-02-08 08:37:26,960 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:37:26,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2025-02-08 08:37:26,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5dcdd85/d2d895723628448db9d76ff9c0c41884/FLAG24948de91 [2025-02-08 08:37:27,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fd5dcdd85/d2d895723628448db9d76ff9c0c41884 [2025-02-08 08:37:27,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:37:27,310 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:37:27,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:27,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:37:27,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:37:27,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cad158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27, skipping insertion in model container [2025-02-08 08:37:27,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:37:27,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:27,461 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:37:27,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:37:27,489 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:37:27,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27 WrapperNode [2025-02-08 08:37:27,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:37:27,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:27,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:37:27,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:37:27,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,509 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-02-08 08:37:27,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:37:27,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:37:27,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:37:27,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:37:27,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,523 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]. [2025-02-08 08:37:27,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:37:27,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:37:27,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:37:27,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:37:27,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (1/1) ... [2025-02-08 08:37:27,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:37:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:27,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:37:27,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:37:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:37:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:37:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:37:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:37:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:37:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 08:37:27,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 08:37:27,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:37:27,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:37:27,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:37:27,574 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:37:27,631 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:37:27,632 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:37:27,757 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:37:27,757 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:37:27,830 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:37:27,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:37:27,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:27 BoogieIcfgContainer [2025-02-08 08:37:27,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:37:27,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:37:27,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:37:27,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:37:27,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:37:27" (1/3) ... [2025-02-08 08:37:27,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec0c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:27, skipping insertion in model container [2025-02-08 08:37:27,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:37:27" (2/3) ... [2025-02-08 08:37:27,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ec0c85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:37:27, skipping insertion in model container [2025-02-08 08:37:27,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:27" (3/3) ... [2025-02-08 08:37:27,838 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-02-08 08:37:27,852 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:37:27,853 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-08 08:37:27,853 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:37:27,890 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 08:37:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2025-02-08 08:37:27,947 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-02-08 08:37:27,949 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:37:27,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2025-02-08 08:37:27,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2025-02-08 08:37:27,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2025-02-08 08:37:27,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:37:27,970 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;@6762fc2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:37:27,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 08:37:27,979 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:37:27,979 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-02-08 08:37:27,980 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 08:37:27,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:27,980 INFO L206 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] [2025-02-08 08:37:27,980 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:27,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash 704258695, now seen corresponding path program 1 times [2025-02-08 08:37:27,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213814071] [2025-02-08 08:37:27,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:37:28,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:37:28,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:28,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:28,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:28,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213814071] [2025-02-08 08:37:28,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213814071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:28,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:28,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:37:28,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372317084] [2025-02-08 08:37:28,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:28,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:28,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:28,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:28,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:28,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-02-08 08:37:28,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-02-08 08:37:28,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:28,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-02-08 08:37:28,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:28,676 INFO L124 PetriNetUnfolderBase]: 553/1058 cut-off events. [2025-02-08 08:37:28,677 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 08:37:28,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 1058 events. 553/1058 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6206 event pairs, 72 based on Foata normal form. 66/1004 useless extension candidates. Maximal degree in co-relation 1706. Up to 445 conditions per place. [2025-02-08 08:37:28,689 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 43 selfloop transitions, 8 changer transitions 1/67 dead transitions. [2025-02-08 08:37:28,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 280 flow [2025-02-08 08:37:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:37:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:37:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-02-08 08:37:28,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7116279069767442 [2025-02-08 08:37:28,702 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 5 states and 153 transitions. [2025-02-08 08:37:28,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 280 flow [2025-02-08 08:37:28,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 67 transitions, 252 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:37:28,710 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 135 flow [2025-02-08 08:37:28,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2025-02-08 08:37:28,715 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2025-02-08 08:37:28,715 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 135 flow [2025-02-08 08:37:28,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2025-02-08 08:37:28,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:28,717 INFO L206 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] [2025-02-08 08:37:28,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:37:28,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash 461261025, now seen corresponding path program 2 times [2025-02-08 08:37:28,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:28,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325517516] [2025-02-08 08:37:28,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:28,733 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:37:28,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:37:28,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:37:28,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325517516] [2025-02-08 08:37:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325517516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874959627] [2025-02-08 08:37:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:28,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:28,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:28,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-08 08:37:28,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:28,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:28,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-08 08:37:28,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:28,955 INFO L124 PetriNetUnfolderBase]: 848/1437 cut-off events. [2025-02-08 08:37:28,955 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2025-02-08 08:37:28,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 1437 events. 848/1437 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7927 event pairs, 256 based on Foata normal form. 109/1428 useless extension candidates. Maximal degree in co-relation 1942. Up to 830 conditions per place. [2025-02-08 08:37:28,967 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 34 selfloop transitions, 5 changer transitions 1/53 dead transitions. [2025-02-08 08:37:28,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 254 flow [2025-02-08 08:37:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:37:28,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:37:28,969 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 135 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:37:28,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 254 flow [2025-02-08 08:37:28,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:28,972 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 162 flow [2025-02-08 08:37:28,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-02-08 08:37:28,972 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-02-08 08:37:28,973 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 162 flow [2025-02-08 08:37:28,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:28,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:28,973 INFO L206 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] [2025-02-08 08:37:28,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:37:28,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:28,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash 232629361, now seen corresponding path program 1 times [2025-02-08 08:37:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:28,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961952799] [2025-02-08 08:37:28,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:28,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:28,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 08:37:28,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 08:37:28,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:28,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:29,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:29,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:29,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961952799] [2025-02-08 08:37:29,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961952799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:29,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:29,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181266106] [2025-02-08 08:37:29,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:29,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:29,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:29,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:29,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-02-08 08:37:29,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:29,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:29,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-02-08 08:37:29,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:29,204 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 25#L88-1true, 27#L71true, 15#L56true, 32#L42true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,205 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,205 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 08:37:29,205 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,205 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 08:37:29,217 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [38#L43true, Black: 61#true, 25#L88-1true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,217 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,217 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,217 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,217 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 25#L88-1true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,218 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,218 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,218 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,218 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 27#L71true, 15#L56true, 32#L42true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,222 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,222 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,222 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,222 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,224 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 25#L88-1true, 18#thread3EXITtrue, 15#L56true, 32#L42true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,224 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,224 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,224 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,224 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [38#L43true, Black: 61#true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,234 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,234 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,234 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,234 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [Black: 61#true, 38#L43true, 25#L88-1true, 18#thread3EXITtrue, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,234 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 27#L71true, 26#L55true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,235 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,235 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 25#L88-1true, 26#L55true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,236 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,236 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,236 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,236 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 18#thread3EXITtrue, 15#L56true, 32#L42true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,240 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,240 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,240 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,241 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 25#L88-1true, 27#L71true, 15#L56true, 32#L42true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,247 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [Black: 61#true, 38#L43true, 25#L88-1true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,247 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 25#L88-1true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,247 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,247 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [38#L43true, Black: 61#true, 18#thread3EXITtrue, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,251 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,251 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,251 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,251 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 26#L55true, 18#thread3EXITtrue, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,252 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,252 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,252 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,252 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([227] L55-->L56: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][16], [Black: 61#true, 27#L71true, 15#L56true, 32#L42true, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,259 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [38#L43true, Black: 61#true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,259 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,259 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 27#L71true, 26#L55true, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,260 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [38#L43true, Black: 61#true, 25#L88-1true, 26#L55true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,260 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 25#L88-1true, 26#L55true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,260 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [38#L43true, Black: 61#true, 27#L71true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2025-02-08 08:37:29,265 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,265 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,265 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,265 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [38#L43true, Black: 61#true, 18#thread3EXITtrue, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2025-02-08 08:37:29,265 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,267 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,267 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,267 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [38#L43true, Black: 61#true, 42#L62true, 27#L71true, 25#L88-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,268 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [38#L43true, Black: 61#true, 42#L62true, 25#L88-1true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,268 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,268 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 27#L71true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2025-02-08 08:37:29,269 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 18#thread3EXITtrue, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2025-02-08 08:37:29,269 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 42#L62true, 27#L71true, 25#L88-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,269 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 08:37:29,269 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 42#L62true, 25#L88-1true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,270 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,270 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,270 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,270 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][32], [Black: 61#true, 38#L43true, 26#L55true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,273 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][45], [Black: 61#true, 34#L46true, 26#L55true, 18#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 3#L89true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2025-02-08 08:37:29,273 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,273 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [Black: 61#true, 38#L43true, 42#L62true, 18#thread3EXITtrue, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,278 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][14], [Black: 61#true, 38#L43true, 27#L71true, 42#L62true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,278 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,278 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 42#L62true, 18#thread3EXITtrue, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,279 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([222] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][34], [Black: 61#true, 34#L46true, 27#L71true, 42#L62true, 3#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2025-02-08 08:37:29,279 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:29,279 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:29,283 INFO L124 PetriNetUnfolderBase]: 1793/2946 cut-off events. [2025-02-08 08:37:29,283 INFO L125 PetriNetUnfolderBase]: For 2445/2543 co-relation queries the response was YES. [2025-02-08 08:37:29,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7379 conditions, 2946 events. 1793/2946 cut-off events. For 2445/2543 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 17796 event pairs, 664 based on Foata normal form. 0/2395 useless extension candidates. Maximal degree in co-relation 4324. Up to 1201 conditions per place. [2025-02-08 08:37:29,302 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 44 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-02-08 08:37:29,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 330 flow [2025-02-08 08:37:29,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2025-02-08 08:37:29,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-02-08 08:37:29,304 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 162 flow. Second operand 3 states and 88 transitions. [2025-02-08 08:37:29,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 330 flow [2025-02-08 08:37:29,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:29,315 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 174 flow [2025-02-08 08:37:29,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-02-08 08:37:29,315 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2025-02-08 08:37:29,315 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 174 flow [2025-02-08 08:37:29,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:29,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:29,316 INFO L206 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] [2025-02-08 08:37:29,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:37:29,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:29,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1194864993, now seen corresponding path program 1 times [2025-02-08 08:37:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:29,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042226056] [2025-02-08 08:37:29,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:29,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 08:37:29,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 08:37:29,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:29,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042226056] [2025-02-08 08:37:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042226056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:37:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465452850] [2025-02-08 08:37:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:37:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:37:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:37:29,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-02-08 08:37:29,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:29,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:29,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-02-08 08:37:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:29,644 INFO L124 PetriNetUnfolderBase]: 2028/3436 cut-off events. [2025-02-08 08:37:29,645 INFO L125 PetriNetUnfolderBase]: For 2131/2189 co-relation queries the response was YES. [2025-02-08 08:37:29,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8473 conditions, 3436 events. 2028/3436 cut-off events. For 2131/2189 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 21374 event pairs, 815 based on Foata normal form. 0/3003 useless extension candidates. Maximal degree in co-relation 4916. Up to 1484 conditions per place. [2025-02-08 08:37:29,661 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 44 selfloop transitions, 3 changer transitions 2/65 dead transitions. [2025-02-08 08:37:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 347 flow [2025-02-08 08:37:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:37:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:37:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-02-08 08:37:29,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-02-08 08:37:29,662 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 174 flow. Second operand 3 states and 90 transitions. [2025-02-08 08:37:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 347 flow [2025-02-08 08:37:29,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:29,671 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 184 flow [2025-02-08 08:37:29,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-02-08 08:37:29,672 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2025-02-08 08:37:29,672 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 184 flow [2025-02-08 08:37:29,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2025-02-08 08:37:29,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:29,673 INFO L206 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] [2025-02-08 08:37:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:37:29,673 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:29,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1784693843, now seen corresponding path program 1 times [2025-02-08 08:37:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:29,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147123963] [2025-02-08 08:37:29,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:29,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:29,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:37:29,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:29,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:29,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:29,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:29,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147123963] [2025-02-08 08:37:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147123963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:29,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401550744] [2025-02-08 08:37:29,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:29,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:29,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:29,850 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:29,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:37:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 08:37:29,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 08:37:29,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:29,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:29,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-08 08:37:29,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:30,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401550744] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:30,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2025-02-08 08:37:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688762761] [2025-02-08 08:37:30,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:37:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:30,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:37:30,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:37:30,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2025-02-08 08:37:30,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 184 flow. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 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) [2025-02-08 08:37:30,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:30,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2025-02-08 08:37:30,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:30,610 INFO L124 PetriNetUnfolderBase]: 2895/5337 cut-off events. [2025-02-08 08:37:30,610 INFO L125 PetriNetUnfolderBase]: For 4269/4313 co-relation queries the response was YES. [2025-02-08 08:37:30,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13751 conditions, 5337 events. 2895/5337 cut-off events. For 4269/4313 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 37008 event pairs, 211 based on Foata normal form. 160/5248 useless extension candidates. Maximal degree in co-relation 9174. Up to 1219 conditions per place. [2025-02-08 08:37:30,627 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 20 changer transitions 21/113 dead transitions. [2025-02-08 08:37:30,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 619 flow [2025-02-08 08:37:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:37:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:37:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2025-02-08 08:37:30,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2025-02-08 08:37:30,629 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 184 flow. Second operand 9 states and 240 transitions. [2025-02-08 08:37:30,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 619 flow [2025-02-08 08:37:30,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 113 transitions, 613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:30,634 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 361 flow [2025-02-08 08:37:30,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-02-08 08:37:30,634 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-02-08 08:37:30,634 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 361 flow [2025-02-08 08:37:30,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 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) [2025-02-08 08:37:30,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:30,635 INFO L206 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] [2025-02-08 08:37:30,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 08:37:30,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:30,839 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash -40987348, now seen corresponding path program 1 times [2025-02-08 08:37:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196935498] [2025-02-08 08:37:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:30,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:37:30,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:37:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:31,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196935498] [2025-02-08 08:37:31,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196935498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:31,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:31,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:37:31,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167364904] [2025-02-08 08:37:31,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:31,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:37:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:31,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:37:31,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:37:31,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-02-08 08:37:31,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2025-02-08 08:37:31,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:31,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-02-08 08:37:31,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:31,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L57-1-->L62: Formula: (= (+ 2 v_~pos~0_30) v_~pos~0_29) InVars {~pos~0=v_~pos~0_30} OutVars{~pos~0=v_~pos~0_29} AuxVars[] AssignedVars[~pos~0][67], [Black: 61#true, 281#true, 42#L62true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 34#L46true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 12#L87-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,296 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2025-02-08 08:37:31,296 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:31,296 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:31,296 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2025-02-08 08:37:31,317 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L57-1-->L62: Formula: (= (+ 2 v_~pos~0_30) v_~pos~0_29) InVars {~pos~0=v_~pos~0_30} OutVars{~pos~0=v_~pos~0_29} AuxVars[] AssignedVars[~pos~0][67], [Black: 61#true, 281#true, 42#L62true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 34#L46true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L88-2true]) [2025-02-08 08:37:31,318 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-02-08 08:37:31,318 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-02-08 08:37:31,318 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-08 08:37:31,318 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:31,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L57-1-->L62: Formula: (= (+ 2 v_~pos~0_30) v_~pos~0_29) InVars {~pos~0=v_~pos~0_30} OutVars{~pos~0=v_~pos~0_29} AuxVars[] AssignedVars[~pos~0][67], [Black: 61#true, 281#true, 42#L62true, Black: 66#true, 44#thread3ENTRYtrue, Black: 73#(<= 1 (mod ~d1~0 256)), 34#L46true, 25#L88-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,341 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 08:37:31,341 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-08 08:37:31,341 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 08:37:31,341 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-08 08:37:31,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L41-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][8], [Black: 61#true, 281#true, 32#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), 15#L56true, Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 12#L87-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,345 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2025-02-08 08:37:31,345 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:31,345 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:31,345 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-08 08:37:31,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([231] L57-1-->L62: Formula: (= (+ 2 v_~pos~0_30) v_~pos~0_29) InVars {~pos~0=v_~pos~0_30} OutVars{~pos~0=v_~pos~0_29} AuxVars[] AssignedVars[~pos~0][67], [Black: 61#true, 281#true, 42#L62true, Black: 66#true, 44#thread3ENTRYtrue, 3#L89true, Black: 73#(<= 1 (mod ~d1~0 256)), 34#L46true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,363 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 08:37:31,363 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:31,363 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-02-08 08:37:31,363 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-08 08:37:31,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L41-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][8], [Black: 61#true, 281#true, Black: 68#(<= 1 (mod ~d2~0 256)), 32#L42true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), 15#L56true, Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L88-2true]) [2025-02-08 08:37:31,364 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2025-02-08 08:37:31,364 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-08 08:37:31,364 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:31,364 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-08 08:37:31,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L41-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][8], [281#true, Black: 61#true, 44#thread3ENTRYtrue, 32#L42true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), 25#L88-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), 15#L56true, Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,380 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2025-02-08 08:37:31,380 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-02-08 08:37:31,380 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-08 08:37:31,380 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2025-02-08 08:37:31,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([217] L41-->L42: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][8], [281#true, Black: 61#true, 44#thread3ENTRYtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 32#L42true, 3#L89true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), 15#L56true, Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2025-02-08 08:37:31,393 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2025-02-08 08:37:31,393 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2025-02-08 08:37:31,393 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-02-08 08:37:31,393 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-02-08 08:37:31,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][41], [Black: 61#true, 281#true, 42#L62true, 18#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 71#true, 38#L43true, 25#L88-1true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2025-02-08 08:37:31,409 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2025-02-08 08:37:31,409 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 08:37:31,409 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2025-02-08 08:37:31,409 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2025-02-08 08:37:31,415 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([221] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][41], [Black: 61#true, 281#true, 42#L62true, 18#thread3EXITtrue, Black: 68#(<= 1 (mod ~d2~0 256)), 3#L89true, Black: 71#true, 38#L43true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2025-02-08 08:37:31,415 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2025-02-08 08:37:31,415 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2025-02-08 08:37:31,415 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2025-02-08 08:37:31,415 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2025-02-08 08:37:31,423 INFO L124 PetriNetUnfolderBase]: 2753/5676 cut-off events. [2025-02-08 08:37:31,423 INFO L125 PetriNetUnfolderBase]: For 15253/15673 co-relation queries the response was YES. [2025-02-08 08:37:31,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18066 conditions, 5676 events. 2753/5676 cut-off events. For 15253/15673 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45146 event pairs, 448 based on Foata normal form. 171/5112 useless extension candidates. Maximal degree in co-relation 14675. Up to 1945 conditions per place. [2025-02-08 08:37:31,496 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 44 selfloop transitions, 21 changer transitions 42/129 dead transitions. [2025-02-08 08:37:31,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 129 transitions, 1031 flow [2025-02-08 08:37:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:37:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:37:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2025-02-08 08:37:31,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611295681063123 [2025-02-08 08:37:31,498 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 361 flow. Second operand 7 states and 199 transitions. [2025-02-08 08:37:31,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 129 transitions, 1031 flow [2025-02-08 08:37:31,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 886 flow, removed 71 selfloop flow, removed 3 redundant places. [2025-02-08 08:37:31,518 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 531 flow [2025-02-08 08:37:31,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2025-02-08 08:37:31,518 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2025-02-08 08:37:31,519 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 531 flow [2025-02-08 08:37:31,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2025-02-08 08:37:31,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:31,519 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2025-02-08 08:37:31,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:37:31,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:31,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1071395183, now seen corresponding path program 2 times [2025-02-08 08:37:31,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:31,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955586037] [2025-02-08 08:37:31,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:31,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:37:31,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:37:31,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:37:31,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:31,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:37:31,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:31,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955586037] [2025-02-08 08:37:31,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955586037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:37:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616371014] [2025-02-08 08:37:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:31,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:31,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:31,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:31,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:31,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-02-08 08:37:31,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:31,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:31,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-02-08 08:37:31,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:32,118 INFO L124 PetriNetUnfolderBase]: 3436/6268 cut-off events. [2025-02-08 08:37:32,119 INFO L125 PetriNetUnfolderBase]: For 22168/23418 co-relation queries the response was YES. [2025-02-08 08:37:32,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22741 conditions, 6268 events. 3436/6268 cut-off events. For 22168/23418 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 45390 event pairs, 1131 based on Foata normal form. 148/5534 useless extension candidates. Maximal degree in co-relation 22008. Up to 1749 conditions per place. [2025-02-08 08:37:32,159 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 100 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2025-02-08 08:37:32,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1135 flow [2025-02-08 08:37:32,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2025-02-08 08:37:32,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2025-02-08 08:37:32,160 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 531 flow. Second operand 4 states and 120 transitions. [2025-02-08 08:37:32,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1135 flow [2025-02-08 08:37:32,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 122 transitions, 1073 flow, removed 31 selfloop flow, removed 2 redundant places. [2025-02-08 08:37:32,204 INFO L231 Difference]: Finished difference. Result has 70 places, 76 transitions, 543 flow [2025-02-08 08:37:32,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=543, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2025-02-08 08:37:32,205 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-02-08 08:37:32,205 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 543 flow [2025-02-08 08:37:32,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:32,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:32,205 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:32,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:37:32,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:32,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash 403400766, now seen corresponding path program 2 times [2025-02-08 08:37:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054263358] [2025-02-08 08:37:32,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:32,212 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-02-08 08:37:32,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 08:37:32,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:37:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:32,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:37:32,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:32,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054263358] [2025-02-08 08:37:32,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054263358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:32,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:37:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137926856] [2025-02-08 08:37:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:32,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:37:32,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:32,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:37:32,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:37:32,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2025-02-08 08:37:32,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 543 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:32,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:32,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2025-02-08 08:37:32,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:32,802 INFO L124 PetriNetUnfolderBase]: 3018/5642 cut-off events. [2025-02-08 08:37:32,803 INFO L125 PetriNetUnfolderBase]: For 18142/18622 co-relation queries the response was YES. [2025-02-08 08:37:32,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20759 conditions, 5642 events. 3018/5642 cut-off events. For 18142/18622 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 39035 event pairs, 886 based on Foata normal form. 61/5178 useless extension candidates. Maximal degree in co-relation 16187. Up to 1736 conditions per place. [2025-02-08 08:37:32,827 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 92 selfloop transitions, 5 changer transitions 2/118 dead transitions. [2025-02-08 08:37:32,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 1028 flow [2025-02-08 08:37:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:37:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:37:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-02-08 08:37:32,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6918604651162791 [2025-02-08 08:37:32,830 INFO L175 Difference]: Start difference. First operand has 70 places, 76 transitions, 543 flow. Second operand 4 states and 119 transitions. [2025-02-08 08:37:32,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 1028 flow [2025-02-08 08:37:32,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 118 transitions, 1014 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-02-08 08:37:32,847 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 553 flow [2025-02-08 08:37:32,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-02-08 08:37:32,847 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2025-02-08 08:37:32,847 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 553 flow [2025-02-08 08:37:32,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:37:32,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:32,848 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:32,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:37:32,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1737097394, now seen corresponding path program 1 times [2025-02-08 08:37:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456425100] [2025-02-08 08:37:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:32,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:37:32,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:37:32,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:32,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:32,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:32,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456425100] [2025-02-08 08:37:32,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456425100] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:37:32,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266708674] [2025-02-08 08:37:32,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:37:32,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:32,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:37:32,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:37:32,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:37:33,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 08:37:33,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:37:33,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:37:33,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:33,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-08 08:37:33,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:37:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:33,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:37:33,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:33,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266708674] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:37:33,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:37:33,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2025-02-08 08:37:33,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762474349] [2025-02-08 08:37:33,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:37:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:37:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:33,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:37:33,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:37:33,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2025-02-08 08:37:33,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 553 flow. Second operand has 12 states, 12 states have (on average 18.166666666666668) internal successors, (218), 12 states have internal predecessors, (218), 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) [2025-02-08 08:37:33,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:33,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2025-02-08 08:37:33,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:34,672 INFO L124 PetriNetUnfolderBase]: 9663/17183 cut-off events. [2025-02-08 08:37:34,672 INFO L125 PetriNetUnfolderBase]: For 53470/53526 co-relation queries the response was YES. [2025-02-08 08:37:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64811 conditions, 17183 events. 9663/17183 cut-off events. For 53470/53526 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 130749 event pairs, 895 based on Foata normal form. 324/17419 useless extension candidates. Maximal degree in co-relation 47202. Up to 3376 conditions per place. [2025-02-08 08:37:34,738 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 98 selfloop transitions, 56 changer transitions 129/297 dead transitions. [2025-02-08 08:37:34,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 297 transitions, 2624 flow [2025-02-08 08:37:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:37:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-08 08:37:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 384 transitions. [2025-02-08 08:37:34,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2025-02-08 08:37:34,740 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 553 flow. Second operand 16 states and 384 transitions. [2025-02-08 08:37:34,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 297 transitions, 2624 flow [2025-02-08 08:37:34,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:37:34,834 INFO L231 Difference]: Finished difference. Result has 100 places, 109 transitions, 1121 flow [2025-02-08 08:37:34,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1121, PETRI_PLACES=100, PETRI_TRANSITIONS=109} [2025-02-08 08:37:34,835 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2025-02-08 08:37:34,835 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 1121 flow [2025-02-08 08:37:34,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.166666666666668) internal successors, (218), 12 states have internal predecessors, (218), 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) [2025-02-08 08:37:34,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:37:34,835 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:37:34,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:37:35,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:37:35,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-02-08 08:37:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:37:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1517504980, now seen corresponding path program 2 times [2025-02-08 08:37:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:37:35,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163065412] [2025-02-08 08:37:35,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:37:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:37:35,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 08:37:35,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 08:37:35,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:37:35,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:37:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:37:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:37:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163065412] [2025-02-08 08:37:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163065412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:37:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:37:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:37:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778013320] [2025-02-08 08:37:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:37:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:37:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:37:35,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:37:35,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:37:35,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2025-02-08 08:37:35,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 1121 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2025-02-08 08:37:35,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:37:35,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2025-02-08 08:37:35,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:37:35,733 INFO L124 PetriNetUnfolderBase]: 1754/4717 cut-off events. [2025-02-08 08:37:35,733 INFO L125 PetriNetUnfolderBase]: For 36548/37429 co-relation queries the response was YES. [2025-02-08 08:37:35,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20169 conditions, 4717 events. 1754/4717 cut-off events. For 36548/37429 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 41562 event pairs, 323 based on Foata normal form. 526/5001 useless extension candidates. Maximal degree in co-relation 20112. Up to 927 conditions per place. [2025-02-08 08:37:35,760 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 0 selfloop transitions, 0 changer transitions 180/180 dead transitions. [2025-02-08 08:37:35,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 180 transitions, 2144 flow [2025-02-08 08:37:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:37:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:37:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 262 transitions. [2025-02-08 08:37:35,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6093023255813953 [2025-02-08 08:37:35,761 INFO L175 Difference]: Start difference. First operand has 100 places, 109 transitions, 1121 flow. Second operand 10 states and 262 transitions. [2025-02-08 08:37:35,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 180 transitions, 2144 flow [2025-02-08 08:37:35,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 180 transitions, 1883 flow, removed 85 selfloop flow, removed 12 redundant places. [2025-02-08 08:37:35,829 INFO L231 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2025-02-08 08:37:35,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2025-02-08 08:37:35,830 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2025-02-08 08:37:35,830 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2025-02-08 08:37:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 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) [2025-02-08 08:37:35,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2025-02-08 08:37:35,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2025-02-08 08:37:35,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-02-08 08:37:35,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-02-08 08:37:35,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-02-08 08:37:35,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:37:35,833 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2025-02-08 08:37:35,835 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:37:35,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:37:35,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:37:35 BasicIcfg [2025-02-08 08:37:35,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:37:35,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:37:35,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:37:35,840 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:37:35,840 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:37:27" (3/4) ... [2025-02-08 08:37:35,841 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:37:35,843 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:37:35,844 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:37:35,844 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 08:37:35,845 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-08 08:37:35,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-08 08:37:35,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:37:35,846 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-08 08:37:35,896 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:37:35,897 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:37:35,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:37:35,898 INFO L158 Benchmark]: Toolchain (without parser) took 8587.27ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 105.6MB in the beginning and 416.3MB in the end (delta: -310.7MB). Peak memory consumption was 586.9MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,898 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:35,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.08ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 93.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,899 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.46ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.2MB in the end (delta: 643.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:37:35,901 INFO L158 Benchmark]: Boogie Preprocessor took 20.90ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,901 INFO L158 Benchmark]: IcfgBuilder took 299.42ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 69.7MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,901 INFO L158 Benchmark]: TraceAbstraction took 8006.11ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 68.7MB in the beginning and 420.6MB in the end (delta: -351.9MB). Peak memory consumption was 545.0MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,902 INFO L158 Benchmark]: Witness Printer took 57.33ms. Allocated memory is still 1.0GB. Free memory was 420.6MB in the beginning and 416.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:37:35,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.08ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 93.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.46ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 93.2MB in the end (delta: 643.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.90ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 91.2MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 299.42ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 69.7MB in the end (delta: 21.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8006.11ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 897.6MB). Free memory was 68.7MB in the beginning and 420.6MB in the end (delta: -351.9MB). Peak memory consumption was 545.0MB. Max. memory is 16.1GB. * Witness Printer took 57.33ms. Allocated memory is still 1.0GB. Free memory was 420.6MB in the beginning and 416.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 74]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 500 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 21 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1121occurred in iteration=9, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 450 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202 SizeOfPredicates, 11 NumberOfNonLiveVariables, 323 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 31/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:37:35,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE