./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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-nonblocking-cntr-alt.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 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:15:19,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:15:19,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:15:19,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:15:19,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:15:19,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:15:19,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:15:19,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:15:19,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:15:19,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:15:19,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:15:19,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:15:19,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:15:19,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:15:19,476 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:15:19,478 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:15:19,478 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:15:19,478 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:15:19,479 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:15:19,479 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:15:19,479 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:15:19,479 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:15:19,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:19,479 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:15:19,479 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:15:19,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:15:19,480 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 -> 0ead2366baa94ec77674f75cd829f45857f5651e204e91d33a749a2af2868461 [2025-03-04 10:15:19,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:15:19,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:15:19,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:15:19,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:15:19,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:15:19,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 10:15:20,857 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244b103a4/931b698e9beb4fe59b39d203e0573ccf/FLAG0a9202472 [2025-03-04 10:15:21,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:15:21,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 10:15:21,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244b103a4/931b698e9beb4fe59b39d203e0573ccf/FLAG0a9202472 [2025-03-04 10:15:21,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/244b103a4/931b698e9beb4fe59b39d203e0573ccf [2025-03-04 10:15:21,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:15:21,135 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:15:21,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:21,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:15:21,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:15:21,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21, skipping insertion in model container [2025-03-04 10:15:21,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:15:21,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:21,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:15:21,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:15:21,305 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:15:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21 WrapperNode [2025-03-04 10:15:21,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:15:21,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:21,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:15:21,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:15:21,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,327 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 48 [2025-03-04 10:15:21,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:15:21,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:15:21,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:15:21,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:15:21,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,336 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,346 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-04 10:15:21,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,348 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:15:21,359 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:15:21,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:15:21,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:15:21,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (1/1) ... [2025-03-04 10:15:21,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:15:21,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:21,393 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-04 10:15:21,398 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-04 10:15:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:15:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:15:21,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:15:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:15:21,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:15:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:15:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:15:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:15:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:15:21,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:15:21,418 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:15:21,486 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:15:21,487 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:15:21,636 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:15:21,636 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:15:21,726 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:15:21,727 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:15:21,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:21 BoogieIcfgContainer [2025-03-04 10:15:21,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:15:21,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:15:21,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:15:21,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:15:21,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:15:21" (1/3) ... [2025-03-04 10:15:21,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6735d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:21, skipping insertion in model container [2025-03-04 10:15:21,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:15:21" (2/3) ... [2025-03-04 10:15:21,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6735d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:15:21, skipping insertion in model container [2025-03-04 10:15:21,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:15:21" (3/3) ... [2025-03-04 10:15:21,734 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2025-03-04 10:15:21,743 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:15:21,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-nonblocking-cntr-alt.wvr.c that has 3 procedures, 22 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 10:15:21,744 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:15:21,776 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:15:21,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 60 flow [2025-03-04 10:15:21,826 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-04 10:15:21,829 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:15:21,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-04 10:15:21,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 23 transitions, 60 flow [2025-03-04 10:15:21,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 20 transitions, 52 flow [2025-03-04 10:15:21,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:15:21,847 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;@52c6e398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:15:21,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:15:21,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:15:21,853 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-03-04 10:15:21,853 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:15:21,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:21,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:21,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -889916623, now seen corresponding path program 1 times [2025-03-04 10:15:21,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:21,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461900449] [2025-03-04 10:15:21,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:21,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:21,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:15:21,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:15:21,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:21,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:22,087 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-04 10:15:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461900449] [2025-03-04 10:15:22,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461900449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:22,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:22,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481626624] [2025-03-04 10:15:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:22,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:22,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:22,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:22,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:22,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04 10:15:22,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:22,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:22,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:22,180 INFO L124 PetriNetUnfolderBase]: 70/140 cut-off events. [2025-03-04 10:15:22,180 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:15:22,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 140 events. 70/140 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 438 event pairs, 31 based on Foata normal form. 9/148 useless extension candidates. Maximal degree in co-relation 255. Up to 86 conditions per place. [2025-03-04 10:15:22,182 INFO L140 encePairwiseOnDemand]: 18/23 looper letters, 20 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-03-04 10:15:22,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 113 flow [2025-03-04 10:15:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2025-03-04 10:15:22,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2025-03-04 10:15:22,193 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 52 flow. Second operand 4 states and 49 transitions. [2025-03-04 10:15:22,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 113 flow [2025-03-04 10:15:22,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 26 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:15:22,198 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 54 flow [2025-03-04 10:15:22,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2025-03-04 10:15:22,202 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, -2 predicate places. [2025-03-04 10:15:22,203 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 54 flow [2025-03-04 10:15:22,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-04 10:15:22,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:22,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:22,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:15:22,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:22,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -827944112, now seen corresponding path program 1 times [2025-03-04 10:15:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212274275] [2025-03-04 10:15:22,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:22,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:22,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:15:22,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:15:22,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:22,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:22,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:22,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212274275] [2025-03-04 10:15:22,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212274275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:22,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:22,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:15:22,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553760289] [2025-03-04 10:15:22,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:15:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:22,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:15:22,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:15:22,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:22,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-04 10:15:22,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:22,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:22,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:22,410 INFO L124 PetriNetUnfolderBase]: 89/183 cut-off events. [2025-03-04 10:15:22,410 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:15:22,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 183 events. 89/183 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 621 event pairs, 49 based on Foata normal form. 13/193 useless extension candidates. Maximal degree in co-relation 87. Up to 124 conditions per place. [2025-03-04 10:15:22,412 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-04 10:15:22,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 129 flow [2025-03-04 10:15:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:15:22,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:15:22,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-03-04 10:15:22,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2025-03-04 10:15:22,413 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 54 flow. Second operand 4 states and 47 transitions. [2025-03-04 10:15:22,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 129 flow [2025-03-04 10:15:22,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 27 transitions, 123 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:22,414 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 64 flow [2025-03-04 10:15:22,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-03-04 10:15:22,415 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-03-04 10:15:22,415 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 64 flow [2025-03-04 10:15:22,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-04 10:15:22,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:22,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:22,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:15:22,416 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:22,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1039507494, now seen corresponding path program 1 times [2025-03-04 10:15:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-04 10:15:22,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:22,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:22,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:22,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:22,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:22,786 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-04 10:15:22,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:22,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-04 10:15:22,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618869954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:22,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340579442] [2025-03-04 10:15:22,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:22,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:22,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:22,789 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-04 10:15:22,791 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-04 10:15:22,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:22,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:22,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:22,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:22,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:15:22,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:23,103 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-04 10:15:23,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:23,526 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-04 10:15:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340579442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:23,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 10:15:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557570326] [2025-03-04 10:15:23,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:15:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:23,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:15:23,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:15:23,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:23,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 64 flow. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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-04 10:15:23,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:23,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:23,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:24,374 INFO L124 PetriNetUnfolderBase]: 396/689 cut-off events. [2025-03-04 10:15:24,375 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2025-03-04 10:15:24,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 689 events. 396/689 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2876 event pairs, 26 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 632. Up to 195 conditions per place. [2025-03-04 10:15:24,378 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 89 selfloop transitions, 64 changer transitions 13/167 dead transitions. [2025-03-04 10:15:24,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 167 transitions, 833 flow [2025-03-04 10:15:24,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:15:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-04 10:15:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 272 transitions. [2025-03-04 10:15:24,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.422360248447205 [2025-03-04 10:15:24,381 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 64 flow. Second operand 28 states and 272 transitions. [2025-03-04 10:15:24,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 167 transitions, 833 flow [2025-03-04 10:15:24,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 167 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:24,383 INFO L231 Difference]: Finished difference. Result has 68 places, 90 transitions, 567 flow [2025-03-04 10:15:24,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=567, PETRI_PLACES=68, PETRI_TRANSITIONS=90} [2025-03-04 10:15:24,384 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 43 predicate places. [2025-03-04 10:15:24,384 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 90 transitions, 567 flow [2025-03-04 10:15:24,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 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-04 10:15:24,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:24,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:24,392 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-04 10:15:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:24,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1997909340, now seen corresponding path program 2 times [2025-03-04 10:15:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-04 10:15:24,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:24,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:24,600 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:24,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812860082] [2025-03-04 10:15:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812860082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:24,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947641288] [2025-03-04 10:15:24,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:24,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:24,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:24,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:15:24,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:24,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:24,822 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:24,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:24,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:15:24,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:24,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:24,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:25,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947641288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:25,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:25,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 10:15:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279464482] [2025-03-04 10:15:25,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:15:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:25,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:15:25,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:15:25,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:25,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 90 transitions, 567 flow. Second operand has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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-04 10:15:25,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:25,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:25,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:26,159 INFO L124 PetriNetUnfolderBase]: 579/1036 cut-off events. [2025-03-04 10:15:26,160 INFO L125 PetriNetUnfolderBase]: For 2829/2829 co-relation queries the response was YES. [2025-03-04 10:15:26,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4341 conditions, 1036 events. 579/1036 cut-off events. For 2829/2829 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4925 event pairs, 17 based on Foata normal form. 2/1038 useless extension candidates. Maximal degree in co-relation 4284. Up to 219 conditions per place. [2025-03-04 10:15:26,167 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 114 selfloop transitions, 109 changer transitions 29/253 dead transitions. [2025-03-04 10:15:26,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 253 transitions, 2066 flow [2025-03-04 10:15:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:15:26,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 10:15:26,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 307 transitions. [2025-03-04 10:15:26,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4171195652173913 [2025-03-04 10:15:26,170 INFO L175 Difference]: Start difference. First operand has 68 places, 90 transitions, 567 flow. Second operand 32 states and 307 transitions. [2025-03-04 10:15:26,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 253 transitions, 2066 flow [2025-03-04 10:15:26,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 253 transitions, 2035 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-04 10:15:26,196 INFO L231 Difference]: Finished difference. Result has 106 places, 149 transitions, 1311 flow [2025-03-04 10:15:26,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1311, PETRI_PLACES=106, PETRI_TRANSITIONS=149} [2025-03-04 10:15:26,197 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 81 predicate places. [2025-03-04 10:15:26,197 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 1311 flow [2025-03-04 10:15:26,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 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-04 10:15:26,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:26,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:26,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:26,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:15:26,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -770457362, now seen corresponding path program 3 times [2025-03-04 10:15:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203342230] [2025-03-04 10:15:26,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:26,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:26,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:26,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:26,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:26,583 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-04 10:15:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203342230] [2025-03-04 10:15:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203342230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067037766] [2025-03-04 10:15:26,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:26,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:26,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:26,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:26,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:15:26,610 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:26,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:26,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:26,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:26,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:15:26,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:26,767 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-04 10:15:26,768 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:27,086 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-04 10:15:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067037766] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:27,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-04 10:15:27,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528626941] [2025-03-04 10:15:27,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:27,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:15:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:27,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:15:27,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:15:27,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:27,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 1311 flow. Second operand has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 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-04 10:15:27,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:27,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:27,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:28,321 INFO L124 PetriNetUnfolderBase]: 685/1235 cut-off events. [2025-03-04 10:15:28,322 INFO L125 PetriNetUnfolderBase]: For 6765/6765 co-relation queries the response was YES. [2025-03-04 10:15:28,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6481 conditions, 1235 events. 685/1235 cut-off events. For 6765/6765 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6227 event pairs, 17 based on Foata normal form. 16/1251 useless extension candidates. Maximal degree in co-relation 6396. Up to 268 conditions per place. [2025-03-04 10:15:28,334 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 130 selfloop transitions, 144 changer transitions 27/302 dead transitions. [2025-03-04 10:15:28,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 302 transitions, 3091 flow [2025-03-04 10:15:28,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-04 10:15:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-04 10:15:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 381 transitions. [2025-03-04 10:15:28,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40402969247083775 [2025-03-04 10:15:28,338 INFO L175 Difference]: Start difference. First operand has 106 places, 149 transitions, 1311 flow. Second operand 41 states and 381 transitions. [2025-03-04 10:15:28,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 302 transitions, 3091 flow [2025-03-04 10:15:28,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 302 transitions, 2752 flow, removed 130 selfloop flow, removed 12 redundant places. [2025-03-04 10:15:28,388 INFO L231 Difference]: Finished difference. Result has 148 places, 185 transitions, 1957 flow [2025-03-04 10:15:28,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1957, PETRI_PLACES=148, PETRI_TRANSITIONS=185} [2025-03-04 10:15:28,391 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 123 predicate places. [2025-03-04 10:15:28,391 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 185 transitions, 1957 flow [2025-03-04 10:15:28,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.869565217391305) internal successors, (135), 23 states have internal predecessors, (135), 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-04 10:15:28,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:28,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:28,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:15:28,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:28,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:28,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 53860782, now seen corresponding path program 4 times [2025-03-04 10:15:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:28,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496059867] [2025-03-04 10:15:28,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:28,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:28,606 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:28,607 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:28,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496059867] [2025-03-04 10:15:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496059867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:28,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731531454] [2025-03-04 10:15:28,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:28,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:28,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:28,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:28,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:15:28,804 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:28,812 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:28,812 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:28,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:28,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:15:28,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:28,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:29,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731531454] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:29,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2025-03-04 10:15:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183603637] [2025-03-04 10:15:29,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:15:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:29,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:15:29,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:15:29,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:29,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 185 transitions, 1957 flow. Second operand has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 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-04 10:15:29,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:29,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:29,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:31,273 INFO L124 PetriNetUnfolderBase]: 1036/1841 cut-off events. [2025-03-04 10:15:31,273 INFO L125 PetriNetUnfolderBase]: For 17551/17551 co-relation queries the response was YES. [2025-03-04 10:15:31,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11131 conditions, 1841 events. 1036/1841 cut-off events. For 17551/17551 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9729 event pairs, 6 based on Foata normal form. 22/1863 useless extension candidates. Maximal degree in co-relation 11028. Up to 415 conditions per place. [2025-03-04 10:15:31,287 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 211 selfloop transitions, 302 changer transitions 22/536 dead transitions. [2025-03-04 10:15:31,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 536 transitions, 6611 flow [2025-03-04 10:15:31,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 10:15:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 10:15:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 651 transitions. [2025-03-04 10:15:31,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4043478260869565 [2025-03-04 10:15:31,290 INFO L175 Difference]: Start difference. First operand has 148 places, 185 transitions, 1957 flow. Second operand 70 states and 651 transitions. [2025-03-04 10:15:31,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 536 transitions, 6611 flow [2025-03-04 10:15:31,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 536 transitions, 6121 flow, removed 151 selfloop flow, removed 21 redundant places. [2025-03-04 10:15:31,349 INFO L231 Difference]: Finished difference. Result has 218 places, 363 transitions, 4978 flow [2025-03-04 10:15:31,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=1692, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=4978, PETRI_PLACES=218, PETRI_TRANSITIONS=363} [2025-03-04 10:15:31,350 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 193 predicate places. [2025-03-04 10:15:31,350 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 363 transitions, 4978 flow [2025-03-04 10:15:31,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.714285714285714) internal successors, (160), 28 states have internal predecessors, (160), 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-04 10:15:31,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:31,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:31,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:31,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:31,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:31,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:31,552 INFO L85 PathProgramCache]: Analyzing trace with hash 491186606, now seen corresponding path program 5 times [2025-03-04 10:15:31,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:31,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-03-04 10:15:31,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:31,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:31,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:31,559 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:31,559 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:31,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:31,724 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-04 10:15:31,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:31,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487326396] [2025-03-04 10:15:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487326396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:31,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:15:31,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091385330] [2025-03-04 10:15:31,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:31,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:31,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:31,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:31,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:31,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 363 transitions, 4978 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:31,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:31,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:31,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:32,003 INFO L124 PetriNetUnfolderBase]: 876/1659 cut-off events. [2025-03-04 10:15:32,003 INFO L125 PetriNetUnfolderBase]: For 33044/33072 co-relation queries the response was YES. [2025-03-04 10:15:32,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12293 conditions, 1659 events. 876/1659 cut-off events. For 33044/33072 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9292 event pairs, 42 based on Foata normal form. 3/1647 useless extension candidates. Maximal degree in co-relation 12136. Up to 1120 conditions per place. [2025-03-04 10:15:32,019 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 244 selfloop transitions, 36 changer transitions 6/394 dead transitions. [2025-03-04 10:15:32,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 394 transitions, 5889 flow [2025-03-04 10:15:32,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 10:15:32,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48695652173913045 [2025-03-04 10:15:32,021 INFO L175 Difference]: Start difference. First operand has 218 places, 363 transitions, 4978 flow. Second operand 10 states and 112 transitions. [2025-03-04 10:15:32,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 394 transitions, 5889 flow [2025-03-04 10:15:32,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 394 transitions, 5040 flow, removed 327 selfloop flow, removed 14 redundant places. [2025-03-04 10:15:32,159 INFO L231 Difference]: Finished difference. Result has 210 places, 373 transitions, 4410 flow [2025-03-04 10:15:32,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4136, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4410, PETRI_PLACES=210, PETRI_TRANSITIONS=373} [2025-03-04 10:15:32,160 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2025-03-04 10:15:32,160 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 373 transitions, 4410 flow [2025-03-04 10:15:32,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:32,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:32,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:32,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:15:32,160 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:32,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:32,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2100897780, now seen corresponding path program 6 times [2025-03-04 10:15:32,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:32,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635900195] [2025-03-04 10:15:32,161 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:15:32,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:32,164 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:32,166 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:32,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:15:32,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:32,327 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-04 10:15:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635900195] [2025-03-04 10:15:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635900195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:15:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548806125] [2025-03-04 10:15:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:32,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:32,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:32,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 373 transitions, 4410 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:32,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:32,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:32,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:32,612 INFO L124 PetriNetUnfolderBase]: 875/1655 cut-off events. [2025-03-04 10:15:32,613 INFO L125 PetriNetUnfolderBase]: For 28134/28176 co-relation queries the response was YES. [2025-03-04 10:15:32,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11094 conditions, 1655 events. 875/1655 cut-off events. For 28134/28176 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9253 event pairs, 45 based on Foata normal form. 3/1639 useless extension candidates. Maximal degree in co-relation 10962. Up to 1159 conditions per place. [2025-03-04 10:15:32,627 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 261 selfloop transitions, 21 changer transitions 4/394 dead transitions. [2025-03-04 10:15:32,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 394 transitions, 5208 flow [2025-03-04 10:15:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2025-03-04 10:15:32,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4652173913043478 [2025-03-04 10:15:32,631 INFO L175 Difference]: Start difference. First operand has 210 places, 373 transitions, 4410 flow. Second operand 10 states and 107 transitions. [2025-03-04 10:15:32,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 394 transitions, 5208 flow [2025-03-04 10:15:32,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 394 transitions, 5037 flow, removed 60 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:32,732 INFO L231 Difference]: Finished difference. Result has 213 places, 375 transitions, 4364 flow [2025-03-04 10:15:32,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4283, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4364, PETRI_PLACES=213, PETRI_TRANSITIONS=375} [2025-03-04 10:15:32,733 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 188 predicate places. [2025-03-04 10:15:32,733 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 375 transitions, 4364 flow [2025-03-04 10:15:32,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:32,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:32,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:32,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:15:32,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:32,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:32,734 INFO L85 PathProgramCache]: Analyzing trace with hash -382554074, now seen corresponding path program 7 times [2025-03-04 10:15:32,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:32,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331531740] [2025-03-04 10:15:32,734 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:32,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:32,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:32,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:32,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:32,885 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-04 10:15:32,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:32,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331531740] [2025-03-04 10:15:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331531740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:32,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:15:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939680959] [2025-03-04 10:15:32,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:32,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:32,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:32,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:32,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:32,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 375 transitions, 4364 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:32,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:32,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:32,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:33,136 INFO L124 PetriNetUnfolderBase]: 888/1689 cut-off events. [2025-03-04 10:15:33,137 INFO L125 PetriNetUnfolderBase]: For 26962/26992 co-relation queries the response was YES. [2025-03-04 10:15:33,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11233 conditions, 1689 events. 888/1689 cut-off events. For 26962/26992 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9570 event pairs, 47 based on Foata normal form. 5/1679 useless extension candidates. Maximal degree in co-relation 11092. Up to 1147 conditions per place. [2025-03-04 10:15:33,154 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 257 selfloop transitions, 36 changer transitions 4/405 dead transitions. [2025-03-04 10:15:33,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 405 transitions, 5276 flow [2025-03-04 10:15:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:15:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:15:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 122 transitions. [2025-03-04 10:15:33,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48221343873517786 [2025-03-04 10:15:33,155 INFO L175 Difference]: Start difference. First operand has 213 places, 375 transitions, 4364 flow. Second operand 11 states and 122 transitions. [2025-03-04 10:15:33,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 405 transitions, 5276 flow [2025-03-04 10:15:33,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 405 transitions, 5234 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 10:15:33,295 INFO L231 Difference]: Finished difference. Result has 219 places, 380 transitions, 4552 flow [2025-03-04 10:15:33,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4324, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4552, PETRI_PLACES=219, PETRI_TRANSITIONS=380} [2025-03-04 10:15:33,296 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 194 predicate places. [2025-03-04 10:15:33,296 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 380 transitions, 4552 flow [2025-03-04 10:15:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:33,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:33,296 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:33,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:15:33,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:33,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:33,296 INFO L85 PathProgramCache]: Analyzing trace with hash -514826114, now seen corresponding path program 8 times [2025-03-04 10:15:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818465129] [2025-03-04 10:15:33,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:33,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:33,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:33,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:15:33,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:33,461 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-04 10:15:33,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:33,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818465129] [2025-03-04 10:15:33,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818465129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:33,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:33,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:15:33,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659222481] [2025-03-04 10:15:33,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:33,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:33,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:33,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:33,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:33,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:33,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 380 transitions, 4552 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:33,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:33,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:33,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:33,707 INFO L124 PetriNetUnfolderBase]: 888/1685 cut-off events. [2025-03-04 10:15:33,707 INFO L125 PetriNetUnfolderBase]: For 29022/29052 co-relation queries the response was YES. [2025-03-04 10:15:33,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11394 conditions, 1685 events. 888/1685 cut-off events. For 29022/29052 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9506 event pairs, 47 based on Foata normal form. 5/1677 useless extension candidates. Maximal degree in co-relation 11258. Up to 1147 conditions per place. [2025-03-04 10:15:33,721 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 252 selfloop transitions, 34 changer transitions 7/401 dead transitions. [2025-03-04 10:15:33,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 401 transitions, 5368 flow [2025-03-04 10:15:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2025-03-04 10:15:33,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2025-03-04 10:15:33,722 INFO L175 Difference]: Start difference. First operand has 219 places, 380 transitions, 4552 flow. Second operand 10 states and 110 transitions. [2025-03-04 10:15:33,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 401 transitions, 5368 flow [2025-03-04 10:15:33,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 401 transitions, 5236 flow, removed 51 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:33,868 INFO L231 Difference]: Finished difference. Result has 223 places, 380 transitions, 4552 flow [2025-03-04 10:15:33,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4458, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4552, PETRI_PLACES=223, PETRI_TRANSITIONS=380} [2025-03-04 10:15:33,868 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 198 predicate places. [2025-03-04 10:15:33,868 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 380 transitions, 4552 flow [2025-03-04 10:15:33,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:33,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:33,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:33,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:15:33,869 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:33,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2057408758, now seen corresponding path program 9 times [2025-03-04 10:15:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:33,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937053318] [2025-03-04 10:15:33,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:33,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:33,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:33,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:33,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:33,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937053318] [2025-03-04 10:15:33,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937053318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193169110] [2025-03-04 10:15:33,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:33,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:33,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:33,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:33,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:15:33,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:33,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:33,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:15:33,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:33,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:15:33,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:33,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193169110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:34,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:34,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:15:34,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273561749] [2025-03-04 10:15:34,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:34,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:34,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:34,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 23 [2025-03-04 10:15:34,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 380 transitions, 4552 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-04 10:15:34,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:34,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 23 [2025-03-04 10:15:34,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:34,291 INFO L124 PetriNetUnfolderBase]: 1050/1892 cut-off events. [2025-03-04 10:15:34,291 INFO L125 PetriNetUnfolderBase]: For 31940/32008 co-relation queries the response was YES. [2025-03-04 10:15:34,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12698 conditions, 1892 events. 1050/1892 cut-off events. For 31940/32008 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10305 event pairs, 31 based on Foata normal form. 40/1921 useless extension candidates. Maximal degree in co-relation 12585. Up to 899 conditions per place. [2025-03-04 10:15:34,304 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 228 selfloop transitions, 165 changer transitions 1/441 dead transitions. [2025-03-04 10:15:34,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 441 transitions, 6144 flow [2025-03-04 10:15:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-03-04 10:15:34,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-03-04 10:15:34,306 INFO L175 Difference]: Start difference. First operand has 223 places, 380 transitions, 4552 flow. Second operand 6 states and 70 transitions. [2025-03-04 10:15:34,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 441 transitions, 6144 flow [2025-03-04 10:15:34,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 441 transitions, 6054 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-03-04 10:15:34,432 INFO L231 Difference]: Finished difference. Result has 212 places, 401 transitions, 5474 flow [2025-03-04 10:15:34,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=4348, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5474, PETRI_PLACES=212, PETRI_TRANSITIONS=401} [2025-03-04 10:15:34,432 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 187 predicate places. [2025-03-04 10:15:34,432 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 401 transitions, 5474 flow [2025-03-04 10:15:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-04 10:15:34,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:34,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:34,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:15:34,633 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:34,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash 56422970, now seen corresponding path program 10 times [2025-03-04 10:15:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278751178] [2025-03-04 10:15:34,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:34,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:34,636 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:34,639 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:34,639 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:34,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:34,772 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-04 10:15:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278751178] [2025-03-04 10:15:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278751178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555226915] [2025-03-04 10:15:34,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:34,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:34,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:15:34,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:34,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:34,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:34,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:34,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:15:34,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:34,965 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-04 10:15:34,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:35,239 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-04 10:15:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555226915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:35,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 26 [2025-03-04 10:15:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254962303] [2025-03-04 10:15:35,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:35,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:15:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:35,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:15:35,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2025-03-04 10:15:35,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:35,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 401 transitions, 5474 flow. Second operand has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:35,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:35,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:35,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:36,003 INFO L124 PetriNetUnfolderBase]: 1269/2218 cut-off events. [2025-03-04 10:15:36,003 INFO L125 PetriNetUnfolderBase]: For 34596/34596 co-relation queries the response was YES. [2025-03-04 10:15:36,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15714 conditions, 2218 events. 1269/2218 cut-off events. For 34596/34596 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11997 event pairs, 8 based on Foata normal form. 3/2221 useless extension candidates. Maximal degree in co-relation 15528. Up to 911 conditions per place. [2025-03-04 10:15:36,019 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 172 selfloop transitions, 352 changer transitions 21/546 dead transitions. [2025-03-04 10:15:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 546 transitions, 8248 flow [2025-03-04 10:15:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:15:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:15:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 215 transitions. [2025-03-04 10:15:36,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4064272211720227 [2025-03-04 10:15:36,021 INFO L175 Difference]: Start difference. First operand has 212 places, 401 transitions, 5474 flow. Second operand 23 states and 215 transitions. [2025-03-04 10:15:36,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 546 transitions, 8248 flow [2025-03-04 10:15:36,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 546 transitions, 8134 flow, removed 57 selfloop flow, removed 0 redundant places. [2025-03-04 10:15:36,209 INFO L231 Difference]: Finished difference. Result has 246 places, 483 transitions, 7939 flow [2025-03-04 10:15:36,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=5424, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=268, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7939, PETRI_PLACES=246, PETRI_TRANSITIONS=483} [2025-03-04 10:15:36,212 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 221 predicate places. [2025-03-04 10:15:36,212 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 483 transitions, 7939 flow [2025-03-04 10:15:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.7407407407407405) internal successors, (155), 27 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:36,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:36,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:36,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:36,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1046974894, now seen corresponding path program 11 times [2025-03-04 10:15:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559689891] [2025-03-04 10:15:36,414 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:36,416 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:36,422 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:36,422 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:36,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:36,543 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-04 10:15:36,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:36,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559689891] [2025-03-04 10:15:36,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559689891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:36,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912251842] [2025-03-04 10:15:36,544 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:15:36,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:36,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:36,546 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:36,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:15:36,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:15:36,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:36,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:36,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:36,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:15:36,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:36,717 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-04 10:15:36,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:37,006 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-04 10:15:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912251842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:37,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:37,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2025-03-04 10:15:37,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209914347] [2025-03-04 10:15:37,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:37,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:15:37,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:15:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:15:37,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:37,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 483 transitions, 7939 flow. Second operand has 26 states, 26 states have (on average 5.846153846153846) internal successors, (152), 26 states have internal predecessors, (152), 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-04 10:15:37,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:37,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:37,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:38,147 INFO L124 PetriNetUnfolderBase]: 1402/2447 cut-off events. [2025-03-04 10:15:38,147 INFO L125 PetriNetUnfolderBase]: For 38799/38799 co-relation queries the response was YES. [2025-03-04 10:15:38,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19363 conditions, 2447 events. 1402/2447 cut-off events. For 38799/38799 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13516 event pairs, 13 based on Foata normal form. 3/2450 useless extension candidates. Maximal degree in co-relation 19228. Up to 1073 conditions per place. [2025-03-04 10:15:38,166 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 252 selfloop transitions, 387 changer transitions 12/652 dead transitions. [2025-03-04 10:15:38,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 652 transitions, 11377 flow [2025-03-04 10:15:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 10:15:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 10:15:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 317 transitions. [2025-03-04 10:15:38,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4053708439897698 [2025-03-04 10:15:38,168 INFO L175 Difference]: Start difference. First operand has 246 places, 483 transitions, 7939 flow. Second operand 34 states and 317 transitions. [2025-03-04 10:15:38,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 652 transitions, 11377 flow [2025-03-04 10:15:38,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 652 transitions, 10896 flow, removed 215 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:38,433 INFO L231 Difference]: Finished difference. Result has 283 places, 583 transitions, 10579 flow [2025-03-04 10:15:38,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=7671, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=10579, PETRI_PLACES=283, PETRI_TRANSITIONS=583} [2025-03-04 10:15:38,434 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 258 predicate places. [2025-03-04 10:15:38,434 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 583 transitions, 10579 flow [2025-03-04 10:15:38,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.846153846153846) internal successors, (152), 26 states have internal predecessors, (152), 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-04 10:15:38,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:38,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:38,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:15:38,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:38,635 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:38,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:38,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1545109492, now seen corresponding path program 12 times [2025-03-04 10:15:38,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:38,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-03-04 10:15:38,636 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:15:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:38,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:15:38,640 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:15:38,640 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:15:38,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:38,768 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-04 10:15:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859649173] [2025-03-04 10:15:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859649173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:38,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:38,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:15:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028414830] [2025-03-04 10:15:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:15:38,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:38,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:15:38,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:15:38,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-04 10:15:38,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 583 transitions, 10579 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:38,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:38,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-04 10:15:38,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:39,138 INFO L124 PetriNetUnfolderBase]: 1194/2214 cut-off events. [2025-03-04 10:15:39,138 INFO L125 PetriNetUnfolderBase]: For 38577/38579 co-relation queries the response was YES. [2025-03-04 10:15:39,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19639 conditions, 2214 events. 1194/2214 cut-off events. For 38577/38579 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12971 event pairs, 16 based on Foata normal form. 1/2202 useless extension candidates. Maximal degree in co-relation 19550. Up to 1554 conditions per place. [2025-03-04 10:15:39,156 INFO L140 encePairwiseOnDemand]: 14/23 looper letters, 401 selfloop transitions, 21 changer transitions 4/597 dead transitions. [2025-03-04 10:15:39,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 597 transitions, 11513 flow [2025-03-04 10:15:39,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 103 transitions. [2025-03-04 10:15:39,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44782608695652176 [2025-03-04 10:15:39,157 INFO L175 Difference]: Start difference. First operand has 283 places, 583 transitions, 10579 flow. Second operand 10 states and 103 transitions. [2025-03-04 10:15:39,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 597 transitions, 11513 flow [2025-03-04 10:15:39,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 597 transitions, 11265 flow, removed 30 selfloop flow, removed 9 redundant places. [2025-03-04 10:15:39,441 INFO L231 Difference]: Finished difference. Result has 280 places, 583 transitions, 10412 flow [2025-03-04 10:15:39,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=10322, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10412, PETRI_PLACES=280, PETRI_TRANSITIONS=583} [2025-03-04 10:15:39,442 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 255 predicate places. [2025-03-04 10:15:39,442 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 583 transitions, 10412 flow [2025-03-04 10:15:39,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 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-04 10:15:39,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:39,442 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:39,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:15:39,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1798051257, now seen corresponding path program 13 times [2025-03-04 10:15:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267526260] [2025-03-04 10:15:39,443 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:39,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:15:39,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:39,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:39,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:39,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267526260] [2025-03-04 10:15:39,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267526260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:39,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356672035] [2025-03-04 10:15:39,601 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:15:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:39,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:39,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:39,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:15:39,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:15:39,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:39,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:39,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:39,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:39,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:39,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356672035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:40,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 10:15:40,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524097703] [2025-03-04 10:15:40,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:15:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:15:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:15:40,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:40,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 583 transitions, 10412 flow. Second operand has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 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-04 10:15:40,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:40,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:40,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:43,037 INFO L124 PetriNetUnfolderBase]: 2047/3561 cut-off events. [2025-03-04 10:15:43,038 INFO L125 PetriNetUnfolderBase]: For 65033/65033 co-relation queries the response was YES. [2025-03-04 10:15:43,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31417 conditions, 3561 events. 2047/3561 cut-off events. For 65033/65033 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 20844 event pairs, 36 based on Foata normal form. 6/3567 useless extension candidates. Maximal degree in co-relation 31328. Up to 1034 conditions per place. [2025-03-04 10:15:43,066 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 361 selfloop transitions, 644 changer transitions 30/1036 dead transitions. [2025-03-04 10:15:43,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 1036 transitions, 19903 flow [2025-03-04 10:15:43,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-04 10:15:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2025-03-04 10:15:43,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 762 transitions. [2025-03-04 10:15:43,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.389769820971867 [2025-03-04 10:15:43,068 INFO L175 Difference]: Start difference. First operand has 280 places, 583 transitions, 10412 flow. Second operand 85 states and 762 transitions. [2025-03-04 10:15:43,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 1036 transitions, 19903 flow [2025-03-04 10:15:43,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1036 transitions, 19831 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-03-04 10:15:43,562 INFO L231 Difference]: Finished difference. Result has 369 places, 865 transitions, 18255 flow [2025-03-04 10:15:43,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=10348, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=411, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=18255, PETRI_PLACES=369, PETRI_TRANSITIONS=865} [2025-03-04 10:15:43,563 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 344 predicate places. [2025-03-04 10:15:43,563 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 865 transitions, 18255 flow [2025-03-04 10:15:43,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 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-04 10:15:43,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:43,563 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:43,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:15:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:15:43,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:43,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 813912233, now seen corresponding path program 14 times [2025-03-04 10:15:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:43,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369333919] [2025-03-04 10:15:43,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:43,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:43,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:15:43,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:43,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369333919] [2025-03-04 10:15:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369333919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054448316] [2025-03-04 10:15:43,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:43,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:43,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:43,921 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:43,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:15:43,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:15:43,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:43,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:43,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:43,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:43,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:44,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:44,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054448316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:44,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:44,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 10:15:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389158469] [2025-03-04 10:15:44,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:15:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:44,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:15:44,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=891, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:15:44,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:44,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 865 transitions, 18255 flow. Second operand has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 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-04 10:15:44,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:44,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:44,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:47,088 INFO L124 PetriNetUnfolderBase]: 2292/4082 cut-off events. [2025-03-04 10:15:47,088 INFO L125 PetriNetUnfolderBase]: For 98162/98162 co-relation queries the response was YES. [2025-03-04 10:15:47,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39709 conditions, 4082 events. 2292/4082 cut-off events. For 98162/98162 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 25045 event pairs, 75 based on Foata normal form. 4/4086 useless extension candidates. Maximal degree in co-relation 39604. Up to 1116 conditions per place. [2025-03-04 10:15:47,127 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 375 selfloop transitions, 742 changer transitions 23/1141 dead transitions. [2025-03-04 10:15:47,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1141 transitions, 24783 flow [2025-03-04 10:15:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-04 10:15:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2025-03-04 10:15:47,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 619 transitions. [2025-03-04 10:15:47,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4077733860342556 [2025-03-04 10:15:47,128 INFO L175 Difference]: Start difference. First operand has 369 places, 865 transitions, 18255 flow. Second operand 66 states and 619 transitions. [2025-03-04 10:15:47,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1141 transitions, 24783 flow [2025-03-04 10:15:48,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1141 transitions, 23953 flow, removed 305 selfloop flow, removed 17 redundant places. [2025-03-04 10:15:48,171 INFO L231 Difference]: Finished difference. Result has 429 places, 977 transitions, 22375 flow [2025-03-04 10:15:48,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=17569, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=865, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=642, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=22375, PETRI_PLACES=429, PETRI_TRANSITIONS=977} [2025-03-04 10:15:48,172 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 404 predicate places. [2025-03-04 10:15:48,172 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 977 transitions, 22375 flow [2025-03-04 10:15:48,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 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-04 10:15:48,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:48,172 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:48,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:15:48,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:15:48,373 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:48,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:48,373 INFO L85 PathProgramCache]: Analyzing trace with hash -401749897, now seen corresponding path program 15 times [2025-03-04 10:15:48,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610548210] [2025-03-04 10:15:48,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:48,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:48,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 10:15:48,379 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:48,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:15:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:48,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:48,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610548210] [2025-03-04 10:15:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610548210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:48,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120604373] [2025-03-04 10:15:48,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:15:48,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:48,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:48,538 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:48,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:15:48,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-04 10:15:48,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:48,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:15:48,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:48,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:48,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:48,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:49,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120604373] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:49,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:49,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 10:15:49,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540549883] [2025-03-04 10:15:49,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:49,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:15:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:49,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:15:49,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=893, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:15:49,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:49,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 977 transitions, 22375 flow. Second operand has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 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-04 10:15:49,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:49,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:49,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:52,574 INFO L124 PetriNetUnfolderBase]: 2524/4491 cut-off events. [2025-03-04 10:15:52,575 INFO L125 PetriNetUnfolderBase]: For 123736/123736 co-relation queries the response was YES. [2025-03-04 10:15:52,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46201 conditions, 4491 events. 2524/4491 cut-off events. For 123736/123736 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28135 event pairs, 51 based on Foata normal form. 5/4496 useless extension candidates. Maximal degree in co-relation 46087. Up to 1192 conditions per place. [2025-03-04 10:15:52,619 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 398 selfloop transitions, 828 changer transitions 24/1251 dead transitions. [2025-03-04 10:15:52,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 1251 transitions, 29129 flow [2025-03-04 10:15:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-03-04 10:15:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2025-03-04 10:15:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 738 transitions. [2025-03-04 10:15:52,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2025-03-04 10:15:52,621 INFO L175 Difference]: Start difference. First operand has 429 places, 977 transitions, 22375 flow. Second operand 82 states and 738 transitions. [2025-03-04 10:15:52,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 1251 transitions, 29129 flow [2025-03-04 10:15:53,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 1251 transitions, 28124 flow, removed 213 selfloop flow, removed 29 redundant places. [2025-03-04 10:15:53,920 INFO L231 Difference]: Finished difference. Result has 497 places, 1076 transitions, 26319 flow [2025-03-04 10:15:53,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=21549, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=976, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=730, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=26319, PETRI_PLACES=497, PETRI_TRANSITIONS=1076} [2025-03-04 10:15:53,922 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 472 predicate places. [2025-03-04 10:15:53,922 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 1076 transitions, 26319 flow [2025-03-04 10:15:53,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.7272727272727275) internal successors, (189), 33 states have internal predecessors, (189), 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-04 10:15:53,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:53,922 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:15:53,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:15:54,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:15:54,123 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:15:54,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash 284040097, now seen corresponding path program 16 times [2025-03-04 10:15:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125141333] [2025-03-04 10:15:54,123 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:54,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:15:54,128 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:54,128 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:54,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:15:54,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125141333] [2025-03-04 10:15:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125141333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:54,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168213108] [2025-03-04 10:15:54,254 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:15:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:54,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:54,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:15:54,279 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:15:54,287 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:15:54,288 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:15:54,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:54,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:15:54,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:54,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:15:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168213108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:15:54,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:15:54,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 10:15:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295130689] [2025-03-04 10:15:54,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:15:54,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:15:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:54,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:15:54,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:15:54,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:15:54,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1076 transitions, 26319 flow. Second operand has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 states have internal predecessors, (188), 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-04 10:15:54,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:54,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:15:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:02,235 INFO L124 PetriNetUnfolderBase]: 3497/6247 cut-off events. [2025-03-04 10:16:02,235 INFO L125 PetriNetUnfolderBase]: For 262768/262768 co-relation queries the response was YES. [2025-03-04 10:16:02,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71613 conditions, 6247 events. 3497/6247 cut-off events. For 262768/262768 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 42302 event pairs, 54 based on Foata normal form. 21/6268 useless extension candidates. Maximal degree in co-relation 71487. Up to 1648 conditions per place. [2025-03-04 10:16:02,307 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 530 selfloop transitions, 1305 changer transitions 48/1884 dead transitions. [2025-03-04 10:16:02,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 1884 transitions, 48008 flow [2025-03-04 10:16:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2025-03-04 10:16:02,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2025-03-04 10:16:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 1452 transitions. [2025-03-04 10:16:02,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38030382399161866 [2025-03-04 10:16:02,309 INFO L175 Difference]: Start difference. First operand has 497 places, 1076 transitions, 26319 flow. Second operand 166 states and 1452 transitions. [2025-03-04 10:16:02,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 1884 transitions, 48008 flow [2025-03-04 10:16:04,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 1884 transitions, 46541 flow, removed 287 selfloop flow, removed 33 redundant places. [2025-03-04 10:16:04,834 INFO L231 Difference]: Finished difference. Result has 656 places, 1550 transitions, 42493 flow [2025-03-04 10:16:04,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=25514, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=880, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=166, PETRI_FLOW=42493, PETRI_PLACES=656, PETRI_TRANSITIONS=1550} [2025-03-04 10:16:04,837 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 631 predicate places. [2025-03-04 10:16:04,837 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 1550 transitions, 42493 flow [2025-03-04 10:16:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.696969696969697) internal successors, (188), 33 states have internal predecessors, (188), 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-04 10:16:04,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:04,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:04,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:16:05,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:16:05,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1645793775, now seen corresponding path program 17 times [2025-03-04 10:16:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275275771] [2025-03-04 10:16:05,043 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:05,046 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:05,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:05,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:05,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:05,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275275771] [2025-03-04 10:16:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275275771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834959510] [2025-03-04 10:16:05,234 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:16:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:05,237 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:05,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:16:05,263 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:05,272 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:05,273 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:05,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:05,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:16:05,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:05,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834959510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:05,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 10:16:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176043827] [2025-03-04 10:16:05,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:05,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:16:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:05,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:16:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:16:05,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:16:05,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 1550 transitions, 42493 flow. Second operand has 34 states, 34 states have (on average 5.676470588235294) internal successors, (193), 34 states have internal predecessors, (193), 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-04 10:16:05,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:16:05,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:09,678 INFO L124 PetriNetUnfolderBase]: 3870/6917 cut-off events. [2025-03-04 10:16:09,678 INFO L125 PetriNetUnfolderBase]: For 362063/362063 co-relation queries the response was YES. [2025-03-04 10:16:09,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86329 conditions, 6917 events. 3870/6917 cut-off events. For 362063/362063 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 47529 event pairs, 98 based on Foata normal form. 6/6923 useless extension candidates. Maximal degree in co-relation 86184. Up to 2436 conditions per place. [2025-03-04 10:16:09,755 INFO L140 encePairwiseOnDemand]: 12/23 looper letters, 494 selfloop transitions, 1458 changer transitions 16/1969 dead transitions. [2025-03-04 10:16:09,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 1969 transitions, 56604 flow [2025-03-04 10:16:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 10:16:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-03-04 10:16:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 665 transitions. [2025-03-04 10:16:09,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3960690887432996 [2025-03-04 10:16:09,756 INFO L175 Difference]: Start difference. First operand has 656 places, 1550 transitions, 42493 flow. Second operand 73 states and 665 transitions. [2025-03-04 10:16:09,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 1969 transitions, 56604 flow [2025-03-04 10:16:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 1969 transitions, 53662 flow, removed 1243 selfloop flow, removed 40 redundant places. [2025-03-04 10:16:14,332 INFO L231 Difference]: Finished difference. Result has 707 places, 1797 transitions, 52577 flow [2025-03-04 10:16:14,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=40195, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=52577, PETRI_PLACES=707, PETRI_TRANSITIONS=1797} [2025-03-04 10:16:14,335 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 682 predicate places. [2025-03-04 10:16:14,335 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 1797 transitions, 52577 flow [2025-03-04 10:16:14,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.676470588235294) internal successors, (193), 34 states have internal predecessors, (193), 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-04 10:16:14,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:14,335 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:14,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:16:14,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:14,536 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:16:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 322038493, now seen corresponding path program 18 times [2025-03-04 10:16:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-04 10:16:14,537 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:16:14,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:14,539 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:14,542 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:14,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:16:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:14,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-04 10:16:14,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823142964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:14,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74223275] [2025-03-04 10:16:14,693 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:16:14,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:14,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:14,695 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:14,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:16:14,720 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:14,731 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:14,731 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:16:14,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:14,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:16:14,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:14,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74223275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:15,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 10:16:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308798408] [2025-03-04 10:16:15,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:15,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:16:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:15,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:16:15,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:16:15,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:16:15,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 1797 transitions, 52577 flow. Second operand has 34 states, 34 states have (on average 5.676470588235294) internal successors, (193), 34 states have internal predecessors, (193), 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-04 10:16:15,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:15,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:16:15,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:21,014 INFO L124 PetriNetUnfolderBase]: 4449/7975 cut-off events. [2025-03-04 10:16:21,014 INFO L125 PetriNetUnfolderBase]: For 506021/506021 co-relation queries the response was YES. [2025-03-04 10:16:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105216 conditions, 7975 events. 4449/7975 cut-off events. For 506021/506021 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56867 event pairs, 121 based on Foata normal form. 6/7981 useless extension candidates. Maximal degree in co-relation 105062. Up to 3123 conditions per place. [2025-03-04 10:16:21,145 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 652 selfloop transitions, 1588 changer transitions 18/2259 dead transitions. [2025-03-04 10:16:21,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 784 places, 2259 transitions, 68771 flow [2025-03-04 10:16:21,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-04 10:16:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2025-03-04 10:16:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 722 transitions. [2025-03-04 10:16:21,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3923913043478261 [2025-03-04 10:16:21,147 INFO L175 Difference]: Start difference. First operand has 707 places, 1797 transitions, 52577 flow. Second operand 80 states and 722 transitions. [2025-03-04 10:16:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 784 places, 2259 transitions, 68771 flow [2025-03-04 10:16:28,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 768 places, 2259 transitions, 67729 flow, removed 379 selfloop flow, removed 16 redundant places. [2025-03-04 10:16:28,759 INFO L231 Difference]: Finished difference. Result has 797 places, 2084 transitions, 67498 flow [2025-03-04 10:16:28,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=51637, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=67498, PETRI_PLACES=797, PETRI_TRANSITIONS=2084} [2025-03-04 10:16:28,761 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 772 predicate places. [2025-03-04 10:16:28,761 INFO L471 AbstractCegarLoop]: Abstraction has has 797 places, 2084 transitions, 67498 flow [2025-03-04 10:16:28,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.676470588235294) internal successors, (193), 34 states have internal predecessors, (193), 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-04 10:16:28,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:28,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:28,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:16:28,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-04 10:16:28,963 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:16:28,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:28,963 INFO L85 PathProgramCache]: Analyzing trace with hash -683974227, now seen corresponding path program 19 times [2025-03-04 10:16:28,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:28,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-03-04 10:16:28,963 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:16:28,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:28,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:16:28,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:28,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:28,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:29,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-03-04 10:16:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502096608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636746568] [2025-03-04 10:16:29,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:16:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:29,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:29,127 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:29,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:16:29,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:16:29,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:29,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:16:29,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:29,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:16:29,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:29,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:29,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:29,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636746568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:29,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:29,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 10:16:29,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490528469] [2025-03-04 10:16:29,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:29,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:16:29,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:29,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:16:29,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:16:29,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:16:29,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 797 places, 2084 transitions, 67498 flow. Second operand has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 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-04 10:16:29,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:29,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:16:29,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:16:35,443 INFO L124 PetriNetUnfolderBase]: 4849/8697 cut-off events. [2025-03-04 10:16:35,443 INFO L125 PetriNetUnfolderBase]: For 613207/613207 co-relation queries the response was YES. [2025-03-04 10:16:35,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123720 conditions, 8697 events. 4849/8697 cut-off events. For 613207/613207 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 63034 event pairs, 136 based on Foata normal form. 5/8702 useless extension candidates. Maximal degree in co-relation 123538. Up to 4282 conditions per place. [2025-03-04 10:16:35,578 INFO L140 encePairwiseOnDemand]: 11/23 looper letters, 913 selfloop transitions, 1496 changer transitions 22/2432 dead transitions. [2025-03-04 10:16:35,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 862 places, 2432 transitions, 81843 flow [2025-03-04 10:16:35,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 10:16:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 10:16:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 620 transitions. [2025-03-04 10:16:35,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38509316770186336 [2025-03-04 10:16:35,580 INFO L175 Difference]: Start difference. First operand has 797 places, 2084 transitions, 67498 flow. Second operand 70 states and 620 transitions. [2025-03-04 10:16:35,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 862 places, 2432 transitions, 81843 flow [2025-03-04 10:16:47,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 830 places, 2432 transitions, 78431 flow, removed 1294 selfloop flow, removed 32 redundant places. [2025-03-04 10:16:47,642 INFO L231 Difference]: Finished difference. Result has 858 places, 2273 transitions, 77247 flow [2025-03-04 10:16:47,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=65130, PETRI_DIFFERENCE_MINUEND_PLACES=761, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=77247, PETRI_PLACES=858, PETRI_TRANSITIONS=2273} [2025-03-04 10:16:47,644 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 833 predicate places. [2025-03-04 10:16:47,644 INFO L471 AbstractCegarLoop]: Abstraction has has 858 places, 2273 transitions, 77247 flow [2025-03-04 10:16:47,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.705882352941177) internal successors, (194), 34 states have internal predecessors, (194), 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-04 10:16:47,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:16:47,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:16:47,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:16:47,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:47,845 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:16:47,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:16:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1991322175, now seen corresponding path program 20 times [2025-03-04 10:16:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:16:47,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757234131] [2025-03-04 10:16:47,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:47,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:16:47,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:47,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:47,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:16:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757234131] [2025-03-04 10:16:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757234131] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:16:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329584060] [2025-03-04 10:16:47,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:16:47,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:16:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:16:47,992 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:16:47,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:16:48,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:16:48,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:16:48,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:16:48,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:16:48,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:16:48,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:16:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:48,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:16:48,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:16:48,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329584060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:16:48,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:16:48,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33 [2025-03-04 10:16:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008873610] [2025-03-04 10:16:48,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:16:48,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:16:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:16:48,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:16:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=922, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:16:48,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-04 10:16:48,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 858 places, 2273 transitions, 77247 flow. Second operand has 34 states, 34 states have (on average 5.676470588235294) internal successors, (193), 34 states have internal predecessors, (193), 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-04 10:16:48,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:16:48,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-04 10:16:48,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand