./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:28:06,435 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:28:06,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:28:06,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:28:06,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:28:06,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:28:06,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:28:06,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:28:06,520 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:28:06,521 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:28:06,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:28:06,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:28:06,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:28:06,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:28:06,522 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:28:06,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:28:06,522 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:28:06,523 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:28:06,523 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:06,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:28:06,524 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:28:06,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:28:06,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:28:06,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:28:06,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:28:06,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:28:06,525 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/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 -> 2aa715856437bb3403b6a2717a4123b124cdc9b291b63ee677b7c1993b3be7b6 [2025-03-09 01:28:06,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:28:06,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:28:06,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:28:06,747 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:28:06,747 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:28:06,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-03-09 01:28:07,899 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608ad926/5721db0bfd6340499c679cb00df78acf/FLAGc137e111b [2025-03-09 01:28:08,093 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:28:08,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-mult-equiv.wvr.c [2025-03-09 01:28:08,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608ad926/5721db0bfd6340499c679cb00df78acf/FLAGc137e111b [2025-03-09 01:28:08,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6608ad926/5721db0bfd6340499c679cb00df78acf [2025-03-09 01:28:08,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:28:08,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:28:08,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:08,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:28:08,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:28:08,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@410a912b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08, skipping insertion in model container [2025-03-09 01:28:08,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:28:08,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:08,588 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:28:08,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:08,612 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:28:08,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08 WrapperNode [2025-03-09 01:28:08,612 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:08,613 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:08,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:28:08,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:28:08,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,635 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2025-03-09 01:28:08,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:08,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:28:08,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:28:08,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:28:08,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,649 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-03-09 01:28:08,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:28:08,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:28:08,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:28:08,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:28:08,656 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (1/1) ... [2025-03-09 01:28:08,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:08,678 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:28:08,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:28:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:28:08,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:28:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:28:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:28:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:28:08,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:28:08,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:28:08,697 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:28:08,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:28:08,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:28:08,939 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:28:08,939 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:28:09,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:28:09,045 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:28:09,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:09 BoogieIcfgContainer [2025-03-09 01:28:09,045 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:28:09,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:28:09,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:28:09,054 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:28:09,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:28:08" (1/3) ... [2025-03-09 01:28:09,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a4c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:09, skipping insertion in model container [2025-03-09 01:28:09,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:08" (2/3) ... [2025-03-09 01:28:09,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a4c8aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:09, skipping insertion in model container [2025-03-09 01:28:09,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:09" (3/3) ... [2025-03-09 01:28:09,057 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-mult-equiv.wvr.c [2025-03-09 01:28:09,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:28:09,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-mult-equiv.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-09 01:28:09,068 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:28:09,117 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:28:09,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 89 flow [2025-03-09 01:28:09,176 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-03-09 01:28:09,178 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:28:09,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-09 01:28:09,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 89 flow [2025-03-09 01:28:09,184 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 78 flow [2025-03-09 01:28:09,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:28:09,206 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;@77f8ab64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:28:09,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-09 01:28:09,220 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:28:09,221 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2025-03-09 01:28:09,221 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:28:09,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:09,222 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] [2025-03-09 01:28:09,223 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-03-09 01:28:09,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:09,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573434, now seen corresponding path program 1 times [2025-03-09 01:28:09,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:09,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404001547] [2025-03-09 01:28:09,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:09,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:09,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:28:09,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:28:09,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:09,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404001547] [2025-03-09 01:28:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404001547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66443203] [2025-03-09 01:28:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:09,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:09,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:09,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-03-09 01:28:09,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:09,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:09,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-03-09 01:28:09,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:09,907 INFO L124 PetriNetUnfolderBase]: 510/800 cut-off events. [2025-03-09 01:28:09,908 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-09 01:28:09,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 800 events. 510/800 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3386 event pairs, 87 based on Foata normal form. 2/775 useless extension candidates. Maximal degree in co-relation 1433. Up to 573 conditions per place. [2025-03-09 01:28:09,918 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 32 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2025-03-09 01:28:09,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 195 flow [2025-03-09 01:28:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-09 01:28:09,929 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2025-03-09 01:28:09,930 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 78 flow. Second operand 3 states and 72 transitions. [2025-03-09 01:28:09,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 195 flow [2025-03-09 01:28:09,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 173 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:28:09,938 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 88 flow [2025-03-09 01:28:09,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-03-09 01:28:09,942 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2025-03-09 01:28:09,944 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 88 flow [2025-03-09 01:28:09,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:09,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:09,944 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] [2025-03-09 01:28:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:28:09,945 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-03-09 01:28:09,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -610158660, now seen corresponding path program 1 times [2025-03-09 01:28:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63108522] [2025-03-09 01:28:09,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:28:09,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:09,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:09,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:10,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63108522] [2025-03-09 01:28:10,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63108522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:10,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:10,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409076127] [2025-03-09 01:28:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:10,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:10,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:10,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 88 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-03-09 01:28:10,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:10,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:10,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:10,564 INFO L124 PetriNetUnfolderBase]: 898/1380 cut-off events. [2025-03-09 01:28:10,567 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2025-03-09 01:28:10,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 1380 events. 898/1380 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6432 event pairs, 27 based on Foata normal form. 0/1278 useless extension candidates. Maximal degree in co-relation 742. Up to 562 conditions per place. [2025-03-09 01:28:10,576 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 86 selfloop transitions, 19 changer transitions 0/111 dead transitions. [2025-03-09 01:28:10,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 111 transitions, 512 flow [2025-03-09 01:28:10,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:10,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-03-09 01:28:10,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6727941176470589 [2025-03-09 01:28:10,578 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 88 flow. Second operand 8 states and 183 transitions. [2025-03-09 01:28:10,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 111 transitions, 512 flow [2025-03-09 01:28:10,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 111 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:10,580 INFO L231 Difference]: Finished difference. Result has 44 places, 49 transitions, 228 flow [2025-03-09 01:28:10,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=49} [2025-03-09 01:28:10,581 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2025-03-09 01:28:10,581 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 49 transitions, 228 flow [2025-03-09 01:28:10,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-03-09 01:28:10,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:10,583 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] [2025-03-09 01:28:10,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:28:10,583 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-03-09 01:28:10,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1377797620, now seen corresponding path program 2 times [2025-03-09 01:28:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:10,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870392228] [2025-03-09 01:28:10,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:10,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:10,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:28:10,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:10,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:28:10,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870392228] [2025-03-09 01:28:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870392228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:28:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672271213] [2025-03-09 01:28:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:10,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:10,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:10,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 49 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:10,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:10,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:10,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:10,964 INFO L124 PetriNetUnfolderBase]: 1068/1613 cut-off events. [2025-03-09 01:28:10,964 INFO L125 PetriNetUnfolderBase]: For 1632/1635 co-relation queries the response was YES. [2025-03-09 01:28:10,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4787 conditions, 1613 events. 1068/1613 cut-off events. For 1632/1635 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7487 event pairs, 144 based on Foata normal form. 36/1633 useless extension candidates. Maximal degree in co-relation 4301. Up to 1134 conditions per place. [2025-03-09 01:28:10,978 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 64 selfloop transitions, 20 changer transitions 2/92 dead transitions. [2025-03-09 01:28:10,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 580 flow [2025-03-09 01:28:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:28:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:28:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-09 01:28:10,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2025-03-09 01:28:10,982 INFO L175 Difference]: Start difference. First operand has 44 places, 49 transitions, 228 flow. Second operand 6 states and 126 transitions. [2025-03-09 01:28:10,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 580 flow [2025-03-09 01:28:10,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 92 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:10,988 INFO L231 Difference]: Finished difference. Result has 53 places, 60 transitions, 382 flow [2025-03-09 01:28:10,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=53, PETRI_TRANSITIONS=60} [2025-03-09 01:28:10,989 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2025-03-09 01:28:10,990 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 60 transitions, 382 flow [2025-03-09 01:28:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:10,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:10,990 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] [2025-03-09 01:28:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:28:10,990 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-03-09 01:28:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1622258764, now seen corresponding path program 3 times [2025-03-09 01:28:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815501305] [2025-03-09 01:28:10,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:10,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:11,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:11,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:11,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:11,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:11,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815501305] [2025-03-09 01:28:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815501305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475203984] [2025-03-09 01:28:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:11,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:11,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:11,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-03-09 01:28:11,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 60 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-03-09 01:28:11,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:11,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-03-09 01:28:11,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:11,544 INFO L124 PetriNetUnfolderBase]: 1825/2696 cut-off events. [2025-03-09 01:28:11,544 INFO L125 PetriNetUnfolderBase]: For 3645/3645 co-relation queries the response was YES. [2025-03-09 01:28:11,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8495 conditions, 2696 events. 1825/2696 cut-off events. For 3645/3645 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 13457 event pairs, 167 based on Foata normal form. 42/2732 useless extension candidates. Maximal degree in co-relation 6626. Up to 1116 conditions per place. [2025-03-09 01:28:11,562 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 88 selfloop transitions, 38 changer transitions 2/133 dead transitions. [2025-03-09 01:28:11,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 133 transitions, 923 flow [2025-03-09 01:28:11,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2025-03-09 01:28:11,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6507352941176471 [2025-03-09 01:28:11,564 INFO L175 Difference]: Start difference. First operand has 53 places, 60 transitions, 382 flow. Second operand 8 states and 177 transitions. [2025-03-09 01:28:11,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 133 transitions, 923 flow [2025-03-09 01:28:11,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 133 transitions, 879 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:11,575 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 612 flow [2025-03-09 01:28:11,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2025-03-09 01:28:11,575 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 26 predicate places. [2025-03-09 01:28:11,575 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 612 flow [2025-03-09 01:28:11,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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-03-09 01:28:11,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:11,576 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] [2025-03-09 01:28:11,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:28:11,576 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-03-09 01:28:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1156533822, now seen corresponding path program 4 times [2025-03-09 01:28:11,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:11,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157514749] [2025-03-09 01:28:11,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:11,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:11,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:11,588 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:11,588 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:11,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:11,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:11,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157514749] [2025-03-09 01:28:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157514749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475602845] [2025-03-09 01:28:11,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:11,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:11,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:11,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:11,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:11,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-03-09 01:28:11,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:11,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:11,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:12,161 INFO L124 PetriNetUnfolderBase]: 2080/3229 cut-off events. [2025-03-09 01:28:12,162 INFO L125 PetriNetUnfolderBase]: For 8446/8453 co-relation queries the response was YES. [2025-03-09 01:28:12,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11532 conditions, 3229 events. 2080/3229 cut-off events. For 8446/8453 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17678 event pairs, 165 based on Foata normal form. 21/3231 useless extension candidates. Maximal degree in co-relation 8950. Up to 1970 conditions per place. [2025-03-09 01:28:12,183 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 96 selfloop transitions, 39 changer transitions 2/144 dead transitions. [2025-03-09 01:28:12,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1217 flow [2025-03-09 01:28:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2025-03-09 01:28:12,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6397058823529411 [2025-03-09 01:28:12,185 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 612 flow. Second operand 8 states and 174 transitions. [2025-03-09 01:28:12,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1217 flow [2025-03-09 01:28:12,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 144 transitions, 1196 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:12,205 INFO L231 Difference]: Finished difference. Result has 74 places, 91 transitions, 861 flow [2025-03-09 01:28:12,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=861, PETRI_PLACES=74, PETRI_TRANSITIONS=91} [2025-03-09 01:28:12,207 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2025-03-09 01:28:12,207 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 861 flow [2025-03-09 01:28:12,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-03-09 01:28:12,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:12,208 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] [2025-03-09 01:28:12,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:28:12,208 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-03-09 01:28:12,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1075063718, now seen corresponding path program 5 times [2025-03-09 01:28:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962249564] [2025-03-09 01:28:12,208 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:12,213 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:12,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:12,217 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:12,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962249564] [2025-03-09 01:28:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962249564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:12,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711650327] [2025-03-09 01:28:12,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:12,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:12,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:12,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:12,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:28:12,372 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:28:12,385 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:28:12,385 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:12,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:12,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 01:28:12,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:12,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711650327] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:12,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:12,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-03-09 01:28:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177249793] [2025-03-09 01:28:12,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:12,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:28:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:12,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:28:12,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:28:12,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-03-09 01:28:12,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 861 flow. Second operand has 14 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 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-03-09 01:28:12,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:12,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-03-09 01:28:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:14,817 INFO L124 PetriNetUnfolderBase]: 9088/13465 cut-off events. [2025-03-09 01:28:14,817 INFO L125 PetriNetUnfolderBase]: For 64042/64062 co-relation queries the response was YES. [2025-03-09 01:28:14,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56173 conditions, 13465 events. 9088/13465 cut-off events. For 64042/64062 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 81846 event pairs, 300 based on Foata normal form. 349/13799 useless extension candidates. Maximal degree in co-relation 43680. Up to 3436 conditions per place. [2025-03-09 01:28:14,921 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 375 selfloop transitions, 317 changer transitions 0/697 dead transitions. [2025-03-09 01:28:14,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 697 transitions, 6247 flow [2025-03-09 01:28:14,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-09 01:28:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-09 01:28:14,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 905 transitions. [2025-03-09 01:28:14,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190150478796169 [2025-03-09 01:28:14,924 INFO L175 Difference]: Start difference. First operand has 74 places, 91 transitions, 861 flow. Second operand 43 states and 905 transitions. [2025-03-09 01:28:14,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 697 transitions, 6247 flow [2025-03-09 01:28:15,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 697 transitions, 6157 flow, removed 39 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:15,010 INFO L231 Difference]: Finished difference. Result has 134 places, 436 transitions, 5168 flow [2025-03-09 01:28:15,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=5168, PETRI_PLACES=134, PETRI_TRANSITIONS=436} [2025-03-09 01:28:15,011 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2025-03-09 01:28:15,011 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 436 transitions, 5168 flow [2025-03-09 01:28:15,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.285714285714286) internal successors, (172), 14 states have internal predecessors, (172), 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-03-09 01:28:15,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:15,012 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-03-09 01:28:15,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:15,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:28:15,213 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-03-09 01:28:15,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash 538198718, now seen corresponding path program 1 times [2025-03-09 01:28:15,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:15,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384713477] [2025-03-09 01:28:15,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:15,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:15,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:28:15,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:15,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:15,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384713477] [2025-03-09 01:28:15,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384713477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053862835] [2025-03-09 01:28:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:15,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:15,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:15,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-03-09 01:28:15,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 436 transitions, 5168 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:15,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:15,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-03-09 01:28:15,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:17,365 INFO L124 PetriNetUnfolderBase]: 13257/19487 cut-off events. [2025-03-09 01:28:17,366 INFO L125 PetriNetUnfolderBase]: For 287530/288806 co-relation queries the response was YES. [2025-03-09 01:28:17,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105387 conditions, 19487 events. 13257/19487 cut-off events. For 287530/288806 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 123747 event pairs, 2861 based on Foata normal form. 303/18097 useless extension candidates. Maximal degree in co-relation 95501. Up to 10600 conditions per place. [2025-03-09 01:28:17,538 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 396 selfloop transitions, 265 changer transitions 0/705 dead transitions. [2025-03-09 01:28:17,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 705 transitions, 9239 flow [2025-03-09 01:28:17,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:17,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2025-03-09 01:28:17,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6764705882352942 [2025-03-09 01:28:17,540 INFO L175 Difference]: Start difference. First operand has 134 places, 436 transitions, 5168 flow. Second operand 5 states and 115 transitions. [2025-03-09 01:28:17,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 705 transitions, 9239 flow [2025-03-09 01:28:20,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 705 transitions, 7721 flow, removed 759 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:20,041 INFO L231 Difference]: Finished difference. Result has 140 places, 549 transitions, 5973 flow [2025-03-09 01:28:20,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=4144, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5973, PETRI_PLACES=140, PETRI_TRANSITIONS=549} [2025-03-09 01:28:20,042 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 103 predicate places. [2025-03-09 01:28:20,042 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 549 transitions, 5973 flow [2025-03-09 01:28:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:20,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:20,042 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-03-09 01:28:20,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:28:20,043 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-03-09 01:28:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash 112659800, now seen corresponding path program 2 times [2025-03-09 01:28:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:20,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109582459] [2025-03-09 01:28:20,044 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:20,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:28:20,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:20,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:28:20,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:20,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:20,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109582459] [2025-03-09 01:28:20,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109582459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:20,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:20,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:20,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592072375] [2025-03-09 01:28:20,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:20,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:20,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:20,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:20,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 549 transitions, 5973 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:28:20,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:20,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:20,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:22,890 INFO L124 PetriNetUnfolderBase]: 16486/24407 cut-off events. [2025-03-09 01:28:22,890 INFO L125 PetriNetUnfolderBase]: For 374492/376743 co-relation queries the response was YES. [2025-03-09 01:28:23,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131194 conditions, 24407 events. 16486/24407 cut-off events. For 374492/376743 co-relation queries the response was YES. Maximal size of possible extension queue 1225. Compared 163312 event pairs, 1813 based on Foata normal form. 539/24340 useless extension candidates. Maximal degree in co-relation 124357. Up to 10347 conditions per place. [2025-03-09 01:28:23,155 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 812 selfloop transitions, 400 changer transitions 0/1337 dead transitions. [2025-03-09 01:28:23,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 1337 transitions, 17656 flow [2025-03-09 01:28:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-09 01:28:23,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-03-09 01:28:23,157 INFO L175 Difference]: Start difference. First operand has 140 places, 549 transitions, 5973 flow. Second operand 5 states and 106 transitions. [2025-03-09 01:28:23,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 1337 transitions, 17656 flow [2025-03-09 01:28:25,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 1337 transitions, 17656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:25,395 INFO L231 Difference]: Finished difference. Result has 147 places, 877 transitions, 11842 flow [2025-03-09 01:28:25,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=5973, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=11842, PETRI_PLACES=147, PETRI_TRANSITIONS=877} [2025-03-09 01:28:25,396 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 110 predicate places. [2025-03-09 01:28:25,396 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 877 transitions, 11842 flow [2025-03-09 01:28:25,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:28:25,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:25,396 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-03-09 01:28:25,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:28:25,397 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-03-09 01:28:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1622038732, now seen corresponding path program 1 times [2025-03-09 01:28:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837003572] [2025-03-09 01:28:25,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:25,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:28:25,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:25,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:25,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:25,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:25,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837003572] [2025-03-09 01:28:25,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837003572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:25,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:25,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:25,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860333534] [2025-03-09 01:28:25,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:25,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:25,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:25,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:25,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:25,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-03-09 01:28:25,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 877 transitions, 11842 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-09 01:28:25,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:25,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-03-09 01:28:25,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:29,009 INFO L124 PetriNetUnfolderBase]: 17336/25521 cut-off events. [2025-03-09 01:28:29,009 INFO L125 PetriNetUnfolderBase]: For 406329/406621 co-relation queries the response was YES. [2025-03-09 01:28:29,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154254 conditions, 25521 events. 17336/25521 cut-off events. For 406329/406621 co-relation queries the response was YES. Maximal size of possible extension queue 1303. Compared 167668 event pairs, 1410 based on Foata normal form. 388/25880 useless extension candidates. Maximal degree in co-relation 143079. Up to 15471 conditions per place. [2025-03-09 01:28:29,357 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1103 selfloop transitions, 156 changer transitions 2/1268 dead transitions. [2025-03-09 01:28:29,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1268 transitions, 19377 flow [2025-03-09 01:28:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:28:29,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:28:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-03-09 01:28:29,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6218487394957983 [2025-03-09 01:28:29,358 INFO L175 Difference]: Start difference. First operand has 147 places, 877 transitions, 11842 flow. Second operand 7 states and 148 transitions. [2025-03-09 01:28:29,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 1268 transitions, 19377 flow [2025-03-09 01:28:33,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 1268 transitions, 19377 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:33,064 INFO L231 Difference]: Finished difference. Result has 155 places, 880 transitions, 12446 flow [2025-03-09 01:28:33,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=11842, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=877, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=12446, PETRI_PLACES=155, PETRI_TRANSITIONS=880} [2025-03-09 01:28:33,065 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 118 predicate places. [2025-03-09 01:28:33,065 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 880 transitions, 12446 flow [2025-03-09 01:28:33,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-09 01:28:33,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:33,066 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-03-09 01:28:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:28:33,066 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-03-09 01:28:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -418201640, now seen corresponding path program 2 times [2025-03-09 01:28:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727105328] [2025-03-09 01:28:33,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:33,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:28:33,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:33,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:33,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727105328] [2025-03-09 01:28:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727105328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:33,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:33,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:33,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154169778] [2025-03-09 01:28:33,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:33,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:33,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:33,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:33,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:33,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 880 transitions, 12446 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-03-09 01:28:33,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:33,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:33,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:37,098 INFO L124 PetriNetUnfolderBase]: 15857/23910 cut-off events. [2025-03-09 01:28:37,098 INFO L125 PetriNetUnfolderBase]: For 409117/410530 co-relation queries the response was YES. [2025-03-09 01:28:37,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152748 conditions, 23910 events. 15857/23910 cut-off events. For 409117/410530 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 163580 event pairs, 1816 based on Foata normal form. 398/24048 useless extension candidates. Maximal degree in co-relation 138029. Up to 20961 conditions per place. [2025-03-09 01:28:37,330 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 825 selfloop transitions, 69 changer transitions 0/944 dead transitions. [2025-03-09 01:28:37,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 944 transitions, 14921 flow [2025-03-09 01:28:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:37,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2025-03-09 01:28:37,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5992647058823529 [2025-03-09 01:28:37,332 INFO L175 Difference]: Start difference. First operand has 155 places, 880 transitions, 12446 flow. Second operand 8 states and 163 transitions. [2025-03-09 01:28:37,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 944 transitions, 14921 flow [2025-03-09 01:28:40,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 944 transitions, 14806 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:40,248 INFO L231 Difference]: Finished difference. Result has 163 places, 899 transitions, 12959 flow [2025-03-09 01:28:40,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=12346, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=824, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12959, PETRI_PLACES=163, PETRI_TRANSITIONS=899} [2025-03-09 01:28:40,249 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 126 predicate places. [2025-03-09 01:28:40,249 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 899 transitions, 12959 flow [2025-03-09 01:28:40,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-03-09 01:28:40,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:40,249 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-03-09 01:28:40,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:28:40,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:28:40,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:40,250 INFO L85 PathProgramCache]: Analyzing trace with hash -148992606, now seen corresponding path program 3 times [2025-03-09 01:28:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:40,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276032334] [2025-03-09 01:28:40,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:40,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:40,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:28:40,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:40,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:40,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276032334] [2025-03-09 01:28:40,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276032334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:28:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818993430] [2025-03-09 01:28:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:40,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:28:40,357 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:40,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 899 transitions, 12959 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:28:40,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:40,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:40,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:43,216 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L79-->thread3EXIT: Formula: (and (<= (mod v_~L~0_18 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_18} OutVars{~L~0=v_~L~0_18, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][231], [Black: 374#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0)), 79#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< (mod ~L~0 4294967296) 1)), 260#(and (<= 1 (mod thread1Thread1of1ForFork2_~cond~0 256)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), 365#true, 90#true, 14#L99-1true, 53#(<= (mod ~L~0 4294967296) 0), 387#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 10#thread3EXITtrue, 27#L64true, Black: 278#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 57#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 113#(<= 1 (mod ~N~0 4294967296)), Black: 288#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 162#(or (and (<= (mod (+ ~L~0 1) 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 50#(= ~N~0 ~L~0), Black: 292#(and (<= (+ ~L~0 1) (+ ~N~0 (mod ~L~0 4294967296))) (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 302#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 52#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< (mod ~L~0 4294967296) 1)), Black: 286#(and (<= 1 (mod ~N~0 4294967296)) (<= 1 (mod thread1Thread1of1ForFork2_~cond~0 256))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0)), 355#true, Black: 274#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 166#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 290#(and (<= 1 (mod ~N~0 4294967296)) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 109#true, Black: 118#(= ~N~0 ~L~0), Black: 306#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 310#(and (or (and (<= (mod (+ ~L~0 1) 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 70#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 208#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), 349#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 200#(< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)), Black: 68#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 294#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 264#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 204#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), Black: 256#(and (<= (+ ~L~0 1) (+ ~N~0 (mod ~L~0 4294967296))) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 337#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 75#true, Black: 338#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 80#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 351#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 345#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 3#L45true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (or (< 4294967294 (mod ~L~0 4294967296)) (< 0 thread1Thread1of1ForFork2_~cond~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), 339#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 360#(<= 1 (mod ~L~0 4294967296)), Black: 97#(<= 1 (mod ~N~0 4294967296)), Black: 94#(and (or (< 4294967294 (mod ~L~0 4294967296)) (< 0 thread1Thread1of1ForFork2_~cond~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 378#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 372#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 380#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0))]) [2025-03-09 01:28:43,216 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2025-03-09 01:28:43,217 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-09 01:28:43,217 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2025-03-09 01:28:43,217 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-03-09 01:28:43,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([229] L79-->thread3EXIT: Formula: (and (<= (mod v_~L~0_18 4294967296) 0) (= |v_thread3Thread1of1ForFork0_#res.base_1| 0) (= |v_thread3Thread1of1ForFork0_#res.offset_1| 0)) InVars {~L~0=v_~L~0_18} OutVars{~L~0=v_~L~0_18, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_1|, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, thread3Thread1of1ForFork0_#res.base][231], [Black: 374#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0)), 79#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< (mod ~L~0 4294967296) 1)), 260#(and (<= 1 (mod thread1Thread1of1ForFork2_~cond~0 256)) (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296)))), 365#true, 90#true, 26#L100true, 53#(<= (mod ~L~0 4294967296) 0), 387#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 46#(and (= ~p~0 0) (= ~q~0 0)), 10#thread3EXITtrue, 27#L64true, Black: 278#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 57#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0)), Black: 113#(<= 1 (mod ~N~0 4294967296)), Black: 288#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 51#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 162#(or (and (<= (mod (+ ~L~0 1) 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 50#(= ~N~0 ~L~0), Black: 292#(and (<= (+ ~L~0 1) (+ ~N~0 (mod ~L~0 4294967296))) (= ~N~0 ~L~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 302#(and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 52#(or (and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)) (< (mod ~L~0 4294967296) 1)), Black: 286#(and (<= 1 (mod ~N~0 4294967296)) (<= 1 (mod thread1Thread1of1ForFork2_~cond~0 256))), Black: 55#(and (<= (mod ~L~0 4294967296) 0) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 0)), 355#true, Black: 274#(and (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 166#(= thread1Thread1of1ForFork2_~cond~0 1), Black: 290#(and (<= 1 (mod ~N~0 4294967296)) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 109#true, Black: 118#(= ~N~0 ~L~0), Black: 306#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 310#(and (or (and (<= (mod (+ ~L~0 1) 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 70#(and (= ~N~0 ~L~0) (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= 1 (mod ~L~0 4294967296)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 208#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296))), Black: 200#(< 0 (mod thread1Thread1of1ForFork2_~cond~0 256)), 349#(or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))), Black: 68#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 294#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 280#(and (or (< 0 (mod (+ 4294967295 ~L~0) 4294967296)) (< 0 (mod ~N~0 4294967296))) (= thread1Thread1of1ForFork2_~cond~0 1) (or (< 0 (mod ~L~0 4294967296)) (< 0 (mod ~N~0 4294967296)))), Black: 264#(and (= (+ ~L~0 1) ~N~0) (<= 1 (mod (+ ~L~0 1) 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 204#(or (< 0 (mod ~L~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork2_~cond~0 256))), Black: 256#(and (<= (+ ~L~0 1) (+ ~N~0 (mod ~L~0 4294967296))) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 337#(or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1))), Black: 75#true, Black: 338#(and (or (< 0 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 0)) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 78#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 80#(and (<= 1 thread1Thread1of1ForFork2_~cond~0) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 82#(and (<= 1 (mod ~N~0 4294967296)) (= ~N~0 ~L~0) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 351#(and (or (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)) (and (= thread2Thread1of1ForFork1_~cond~1 0) (= (mod ~N~0 4294967296) 1))) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 345#(or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))), 3#L45true, Black: 99#(and (<= 1 (mod ~N~0 4294967296)) (or (< 4294967294 (mod ~L~0 4294967296)) (< 0 thread1Thread1of1ForFork2_~cond~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 360#(<= 1 (mod ~L~0 4294967296)), Black: 97#(<= 1 (mod ~N~0 4294967296)), 339#(and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)), Black: 94#(and (or (< 4294967294 (mod ~L~0 4294967296)) (< 0 thread1Thread1of1ForFork2_~cond~0)) (<= (div thread1Thread1of1ForFork2_~cond~0 256) 0)), Black: 378#(and (or (and (<= (mod ~N~0 4294967296) 1) (= thread2Thread1of1ForFork1_~cond~1 0)) (and (<= 2 (mod ~N~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1))) (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 372#(and (= ~N~0 ~L~0) (or (and (<= (mod ~N~0 4294967296) 0) (= thread1Thread1of1ForFork2_~cond~0 0)) (and (<= 1 (mod ~N~0 4294967296)) (= thread1Thread1of1ForFork2_~cond~0 1)))), Black: 380#(and (<= (mod ~N~0 4294967296) 0) (= ~N~0 ~L~0) (= thread2Thread1of1ForFork1_~cond~1 0) (= thread1Thread1of1ForFork2_~cond~0 0))]) [2025-03-09 01:28:43,551 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2025-03-09 01:28:43,551 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-09 01:28:43,551 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2025-03-09 01:28:43,551 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-03-09 01:28:44,420 INFO L124 PetriNetUnfolderBase]: 17418/26466 cut-off events. [2025-03-09 01:28:44,420 INFO L125 PetriNetUnfolderBase]: For 520561/522915 co-relation queries the response was YES. [2025-03-09 01:28:44,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169476 conditions, 26466 events. 17418/26466 cut-off events. For 520561/522915 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 185921 event pairs, 3502 based on Foata normal form. 736/26780 useless extension candidates. Maximal degree in co-relation 153517. Up to 12522 conditions per place. [2025-03-09 01:28:44,747 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 437 selfloop transitions, 508 changer transitions 3/1076 dead transitions. [2025-03-09 01:28:44,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 1076 transitions, 16927 flow [2025-03-09 01:28:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-09 01:28:44,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2025-03-09 01:28:44,748 INFO L175 Difference]: Start difference. First operand has 163 places, 899 transitions, 12959 flow. Second operand 5 states and 113 transitions. [2025-03-09 01:28:44,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 1076 transitions, 16927 flow [2025-03-09 01:28:48,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 1076 transitions, 16823 flow, removed 52 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:48,330 INFO L231 Difference]: Finished difference. Result has 170 places, 953 transitions, 15369 flow [2025-03-09 01:28:48,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=12848, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=15369, PETRI_PLACES=170, PETRI_TRANSITIONS=953} [2025-03-09 01:28:48,331 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 133 predicate places. [2025-03-09 01:28:48,331 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 953 transitions, 15369 flow [2025-03-09 01:28:48,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:28:48,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,331 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-03-09 01:28:48,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:28:48,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:28:48,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2090261282, now seen corresponding path program 4 times [2025-03-09 01:28:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748062146] [2025-03-09 01:28:48,332 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,335 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:28:48,343 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:28:48,343 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:48,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:48,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748062146] [2025-03-09 01:28:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748062146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:48,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:28:48,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777815789] [2025-03-09 01:28:48,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:48,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:28:48,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:28:48,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 953 transitions, 15369 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-03-09 01:28:48,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:28:48,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:53,833 INFO L124 PetriNetUnfolderBase]: 22802/34706 cut-off events. [2025-03-09 01:28:53,833 INFO L125 PetriNetUnfolderBase]: For 778279/781356 co-relation queries the response was YES. [2025-03-09 01:28:54,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229129 conditions, 34706 events. 22802/34706 cut-off events. For 778279/781356 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 254765 event pairs, 1181 based on Foata normal form. 1144/35401 useless extension candidates. Maximal degree in co-relation 207014. Up to 10924 conditions per place. [2025-03-09 01:28:54,407 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 1189 selfloop transitions, 470 changer transitions 2/1789 dead transitions. [2025-03-09 01:28:54,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1789 transitions, 31119 flow [2025-03-09 01:28:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:28:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:28:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2025-03-09 01:28:54,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6512605042016807 [2025-03-09 01:28:54,408 INFO L175 Difference]: Start difference. First operand has 170 places, 953 transitions, 15369 flow. Second operand 7 states and 155 transitions. [2025-03-09 01:28:54,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 1789 transitions, 31119 flow [2025-03-09 01:29:00,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1789 transitions, 30226 flow, removed 38 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:00,181 INFO L231 Difference]: Finished difference. Result has 180 places, 1209 transitions, 21768 flow [2025-03-09 01:29:00,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=14820, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=952, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=21768, PETRI_PLACES=180, PETRI_TRANSITIONS=1209} [2025-03-09 01:29:00,181 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 143 predicate places. [2025-03-09 01:29:00,182 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 1209 transitions, 21768 flow [2025-03-09 01:29:00,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-03-09 01:29:00,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:00,182 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-03-09 01:29:00,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:29:00,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:29:00,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:00,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2144896652, now seen corresponding path program 5 times [2025-03-09 01:29:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:00,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172928167] [2025-03-09 01:29:00,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:29:00,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:00,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:29:00,190 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:29:00,190 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:00,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:00,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:00,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172928167] [2025-03-09 01:29:00,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172928167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:00,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:00,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:29:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613847329] [2025-03-09 01:29:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:00,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:29:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:00,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:29:00,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:29:00,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:29:00,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 1209 transitions, 21768 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:00,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:00,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:29:00,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:07,004 INFO L124 PetriNetUnfolderBase]: 23666/36240 cut-off events. [2025-03-09 01:29:07,004 INFO L125 PetriNetUnfolderBase]: For 629645/632922 co-relation queries the response was YES. [2025-03-09 01:29:07,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251903 conditions, 36240 events. 23666/36240 cut-off events. For 629645/632922 co-relation queries the response was YES. Maximal size of possible extension queue 2001. Compared 269274 event pairs, 5265 based on Foata normal form. 916/36534 useless extension candidates. Maximal degree in co-relation 243705. Up to 19107 conditions per place. [2025-03-09 01:29:07,580 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 533 selfloop transitions, 932 changer transitions 9/1602 dead transitions. [2025-03-09 01:29:07,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1602 transitions, 30463 flow [2025-03-09 01:29:07,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:29:07,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:29:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-03-09 01:29:07,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2025-03-09 01:29:07,581 INFO L175 Difference]: Start difference. First operand has 180 places, 1209 transitions, 21768 flow. Second operand 6 states and 130 transitions. [2025-03-09 01:29:07,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 1602 transitions, 30463 flow [2025-03-09 01:29:12,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1602 transitions, 30337 flow, removed 63 selfloop flow, removed 0 redundant places. [2025-03-09 01:29:12,182 INFO L231 Difference]: Finished difference. Result has 188 places, 1347 transitions, 27239 flow [2025-03-09 01:29:12,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=21252, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=774, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=27239, PETRI_PLACES=188, PETRI_TRANSITIONS=1347} [2025-03-09 01:29:12,183 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 151 predicate places. [2025-03-09 01:29:12,183 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 1347 transitions, 27239 flow [2025-03-09 01:29:12,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:12,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:12,183 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-03-09 01:29:12,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:29:12,183 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:29:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1913917528, now seen corresponding path program 3 times [2025-03-09 01:29:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:12,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555811505] [2025-03-09 01:29:12,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:12,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:29:12,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:29:12,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:29:12,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555811505] [2025-03-09 01:29:12,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555811505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:12,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:12,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:29:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623707958] [2025-03-09 01:29:12,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:12,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:29:12,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:12,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:29:12,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:29:12,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:29:12,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1347 transitions, 27239 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:12,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:12,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:29:12,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:19,264 INFO L124 PetriNetUnfolderBase]: 22313/34100 cut-off events. [2025-03-09 01:29:19,264 INFO L125 PetriNetUnfolderBase]: For 671675/674446 co-relation queries the response was YES. [2025-03-09 01:29:19,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251326 conditions, 34100 events. 22313/34100 cut-off events. For 671675/674446 co-relation queries the response was YES. Maximal size of possible extension queue 1915. Compared 250847 event pairs, 2752 based on Foata normal form. 900/34626 useless extension candidates. Maximal degree in co-relation 243973. Up to 29844 conditions per place. [2025-03-09 01:29:19,711 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 1281 selfloop transitions, 61 changer transitions 3/1397 dead transitions. [2025-03-09 01:29:19,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1397 transitions, 30520 flow [2025-03-09 01:29:19,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:29:19,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:29:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:29:19,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-03-09 01:29:19,712 INFO L175 Difference]: Start difference. First operand has 188 places, 1347 transitions, 27239 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:29:19,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 1397 transitions, 30520 flow [2025-03-09 01:29:24,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 1397 transitions, 30132 flow, removed 194 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:24,711 INFO L231 Difference]: Finished difference. Result has 192 places, 1339 transitions, 26777 flow [2025-03-09 01:29:24,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=26540, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=26777, PETRI_PLACES=192, PETRI_TRANSITIONS=1339} [2025-03-09 01:29:24,712 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 155 predicate places. [2025-03-09 01:29:24,712 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 1339 transitions, 26777 flow [2025-03-09 01:29:24,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:24,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:24,712 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-03-09 01:29:24,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:29:24,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:29:24,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2027164572, now seen corresponding path program 6 times [2025-03-09 01:29:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:24,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954150852] [2025-03-09 01:29:24,713 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:29:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:24,717 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:29:24,720 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:29:24,720 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:29:24,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:24,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954150852] [2025-03-09 01:29:24,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954150852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:24,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:24,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:29:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887468805] [2025-03-09 01:29:24,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:24,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:29:24,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:24,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:29:24,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:29:24,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:29:24,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 1339 transitions, 26777 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:24,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:24,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:29:24,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:31,659 INFO L124 PetriNetUnfolderBase]: 22556/34351 cut-off events. [2025-03-09 01:29:31,659 INFO L125 PetriNetUnfolderBase]: For 711809/715375 co-relation queries the response was YES. [2025-03-09 01:29:32,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254815 conditions, 34351 events. 22556/34351 cut-off events. For 711809/715375 co-relation queries the response was YES. Maximal size of possible extension queue 1918. Compared 253450 event pairs, 2816 based on Foata normal form. 997/34625 useless extension candidates. Maximal degree in co-relation 246849. Up to 14752 conditions per place. [2025-03-09 01:29:32,166 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 799 selfloop transitions, 733 changer transitions 6/1666 dead transitions. [2025-03-09 01:29:32,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1666 transitions, 34866 flow [2025-03-09 01:29:32,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:29:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:29:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:29:32,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-03-09 01:29:32,167 INFO L175 Difference]: Start difference. First operand has 192 places, 1339 transitions, 26777 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:29:32,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1666 transitions, 34866 flow [2025-03-09 01:29:36,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 1666 transitions, 34789 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 01:29:36,753 INFO L231 Difference]: Finished difference. Result has 198 places, 1424 transitions, 31900 flow [2025-03-09 01:29:36,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=26281, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=628, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=31900, PETRI_PLACES=198, PETRI_TRANSITIONS=1424} [2025-03-09 01:29:36,754 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 161 predicate places. [2025-03-09 01:29:36,754 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 1424 transitions, 31900 flow [2025-03-09 01:29:36,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-03-09 01:29:36,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:36,754 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-03-09 01:29:36,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:29:36,755 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-09 01:29:36,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:36,755 INFO L85 PathProgramCache]: Analyzing trace with hash -368090530, now seen corresponding path program 7 times [2025-03-09 01:29:36,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:36,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495473238] [2025-03-09 01:29:36,755 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:29:36,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:36,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:29:36,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:29:36,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:36,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:36,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:36,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495473238] [2025-03-09 01:29:36,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495473238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:29:36,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:29:36,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:29:36,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973840994] [2025-03-09 01:29:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:29:36,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:29:36,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:36,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:29:36,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:29:36,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2025-03-09 01:29:36,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1424 transitions, 31900 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-03-09 01:29:36,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:36,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2025-03-09 01:29:36,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand