./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/mult-flipped-dist.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/mult-flipped-dist.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 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:08:37,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:08:37,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:08:37,101 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:08:37,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:08:37,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:08:37,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:08:37,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:08:37,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:08:37,118 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:08:37,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:08:37,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:08:37,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:08:37,119 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:08:37,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:37,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:08:37,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:08:37,120 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 -> 7cfd33ca5f647adf12592c5e71401ab9da35a49d8f2ec6d0757ea2cc237974cc [2025-03-04 10:08:37,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:08:37,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:08:37,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:08:37,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:08:37,361 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:08:37,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-04 10:08:38,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86aa19f51/f23c2b2e5d944a809f20f6cfbaa0e251/FLAG7f7a81fee [2025-03-04 10:08:38,666 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:08:38,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/mult-flipped-dist.wvr.c [2025-03-04 10:08:38,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86aa19f51/f23c2b2e5d944a809f20f6cfbaa0e251/FLAG7f7a81fee [2025-03-04 10:08:39,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86aa19f51/f23c2b2e5d944a809f20f6cfbaa0e251 [2025-03-04 10:08:39,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:08:39,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:08:39,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:39,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:08:39,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:08:39,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c74649a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39, skipping insertion in model container [2025-03-04 10:08:39,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:08:39,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:39,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:08:39,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:08:39,204 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:08:39,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39 WrapperNode [2025-03-04 10:08:39,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:08:39,206 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:39,206 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:08:39,206 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:08:39,211 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:08:39" (1/1) ... [2025-03-04 10:08:39,216 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:08:39" (1/1) ... [2025-03-04 10:08:39,228 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-03-04 10:08:39,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:08:39,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:08:39,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:08:39,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:08:39,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,254 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:08:39,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,266 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:08:39,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:08:39,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:08:39,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:08:39,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (1/1) ... [2025-03-04 10:08:39,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:08:39,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:39,295 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:08:39,300 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:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:08:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:08:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:08:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:08:39,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:08:39,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:08:39,315 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:08:39,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:08:39,376 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:08:39,502 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:08:39,502 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:08:39,571 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:08:39,571 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:08:39,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:39 BoogieIcfgContainer [2025-03-04 10:08:39,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:08:39,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:08:39,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:08:39,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:08:39,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:08:39" (1/3) ... [2025-03-04 10:08:39,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f64c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:39, skipping insertion in model container [2025-03-04 10:08:39,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:08:39" (2/3) ... [2025-03-04 10:08:39,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f64c8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:08:39, skipping insertion in model container [2025-03-04 10:08:39,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:08:39" (3/3) ... [2025-03-04 10:08:39,578 INFO L128 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2025-03-04 10:08:39,587 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:08:39,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mult-flipped-dist.wvr.c that has 4 procedures, 25 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-04 10:08:39,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:08:39,631 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:08:39,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 27 transitions, 75 flow [2025-03-04 10:08:39,681 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2025-03-04 10:08:39,682 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:08:39,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 3/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 14 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-04 10:08:39,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 27 transitions, 75 flow [2025-03-04 10:08:39,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-03-04 10:08:39,693 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:08:39,702 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;@9c8db44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:08:39,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 10:08:39,711 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:08:39,711 INFO L124 PetriNetUnfolderBase]: 3/20 cut-off events. [2025-03-04 10:08:39,711 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:08:39,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:39,712 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:08:39,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:39,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:39,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1149651452, now seen corresponding path program 1 times [2025-03-04 10:08:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215900329] [2025-03-04 10:08:39,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:39,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:08:39,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:08:39,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:39,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:40,168 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:08:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215900329] [2025-03-04 10:08:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215900329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:40,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:40,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:08:40,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850866203] [2025-03-04 10:08:40,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:08:40,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:40,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:08:40,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:08:40,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:40,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:08:40,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:40,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:40,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:40,337 INFO L124 PetriNetUnfolderBase]: 386/565 cut-off events. [2025-03-04 10:08:40,337 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-04 10:08:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1206 conditions, 565 events. 386/565 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1789 event pairs, 124 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 1030. Up to 349 conditions per place. [2025-03-04 10:08:40,345 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 32 selfloop transitions, 4 changer transitions 1/38 dead transitions. [2025-03-04 10:08:40,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 183 flow [2025-03-04 10:08:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:08:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:08:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 10:08:40,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:08:40,356 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 64 flow. Second operand 3 states and 54 transitions. [2025-03-04 10:08:40,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 183 flow [2025-03-04 10:08:40,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 161 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:08:40,363 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 74 flow [2025-03-04 10:08:40,365 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2025-03-04 10:08:40,368 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2025-03-04 10:08:40,368 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 74 flow [2025-03-04 10:08:40,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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:08:40,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:40,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:40,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:08:40,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:40,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:40,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1003563306, now seen corresponding path program 1 times [2025-03-04 10:08:40,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:40,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288749408] [2025-03-04 10:08:40,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:40,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:40,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:08:40,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:40,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:40,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288749408] [2025-03-04 10:08:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288749408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:40,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865367690] [2025-03-04 10:08:40,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:40,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:40,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:40,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:40,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:08:40,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:40,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:40,684 INFO L124 PetriNetUnfolderBase]: 520/743 cut-off events. [2025-03-04 10:08:40,685 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-04 10:08:40,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 743 events. 520/743 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2438 event pairs, 203 based on Foata normal form. 16/759 useless extension candidates. Maximal degree in co-relation 529. Up to 536 conditions per place. [2025-03-04 10:08:40,690 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 45 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2025-03-04 10:08:40,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 58 transitions, 287 flow [2025-03-04 10:08:40,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-04 10:08:40,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2025-03-04 10:08:40,692 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 74 flow. Second operand 5 states and 76 transitions. [2025-03-04 10:08:40,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 58 transitions, 287 flow [2025-03-04 10:08:40,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 58 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:40,693 INFO L231 Difference]: Finished difference. Result has 31 places, 34 transitions, 156 flow [2025-03-04 10:08:40,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=31, PETRI_TRANSITIONS=34} [2025-03-04 10:08:40,693 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-03-04 10:08:40,693 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 34 transitions, 156 flow [2025-03-04 10:08:40,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:08:40,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:40,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:40,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:08:40,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:40,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1922554400, now seen corresponding path program 1 times [2025-03-04 10:08:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760777401] [2025-03-04 10:08:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:40,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:08:40,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:40,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:40,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:40,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:40,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760777401] [2025-03-04 10:08:40,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760777401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:40,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:40,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:08:40,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948652478] [2025-03-04 10:08:40,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:40,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:08:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:40,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:08:40,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:08:40,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:40,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 34 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:08:40,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:40,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:40,977 INFO L124 PetriNetUnfolderBase]: 546/820 cut-off events. [2025-03-04 10:08:40,977 INFO L125 PetriNetUnfolderBase]: For 740/740 co-relation queries the response was YES. [2025-03-04 10:08:40,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2528 conditions, 820 events. 546/820 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3146 event pairs, 144 based on Foata normal form. 65/885 useless extension candidates. Maximal degree in co-relation 2002. Up to 373 conditions per place. [2025-03-04 10:08:40,982 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 50 selfloop transitions, 10 changer transitions 5/66 dead transitions. [2025-03-04 10:08:40,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 385 flow [2025-03-04 10:08:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:08:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:08:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-03-04 10:08:40,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6074074074074074 [2025-03-04 10:08:40,983 INFO L175 Difference]: Start difference. First operand has 31 places, 34 transitions, 156 flow. Second operand 5 states and 82 transitions. [2025-03-04 10:08:40,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 385 flow [2025-03-04 10:08:40,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 66 transitions, 373 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 10:08:40,987 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 199 flow [2025-03-04 10:08:40,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2025-03-04 10:08:40,988 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-03-04 10:08:40,988 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 199 flow [2025-03-04 10:08:40,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:08:40,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:40,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:08:40,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:40,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash 354896178, now seen corresponding path program 2 times [2025-03-04 10:08:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869041836] [2025-03-04 10:08:40,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:40,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:41,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:41,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:41,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:41,123 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:08:41,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869041836] [2025-03-04 10:08:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869041836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33947545] [2025-03-04 10:08:41,124 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:41,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:41,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:41,126 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:08:41,128 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:08:41,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:41,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:41,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:41,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:41,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:08:41,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:41,205 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:08:41,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:41,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33947545] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:08:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2025-03-04 10:08:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068287678] [2025-03-04 10:08:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:41,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:08:41,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:41,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 199 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:08:41,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:41,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:41,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:41,388 INFO L124 PetriNetUnfolderBase]: 608/913 cut-off events. [2025-03-04 10:08:41,388 INFO L125 PetriNetUnfolderBase]: For 2143/2143 co-relation queries the response was YES. [2025-03-04 10:08:41,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 913 events. 608/913 cut-off events. For 2143/2143 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3433 event pairs, 158 based on Foata normal form. 31/944 useless extension candidates. Maximal degree in co-relation 2590. Up to 528 conditions per place. [2025-03-04 10:08:41,393 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 50 selfloop transitions, 7 changer transitions 10/68 dead transitions. [2025-03-04 10:08:41,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 68 transitions, 501 flow [2025-03-04 10:08:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-04 10:08:41,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-03-04 10:08:41,395 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 199 flow. Second operand 4 states and 68 transitions. [2025-03-04 10:08:41,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 68 transitions, 501 flow [2025-03-04 10:08:41,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 68 transitions, 470 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:41,400 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 223 flow [2025-03-04 10:08:41,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-04 10:08:41,401 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-03-04 10:08:41,401 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 223 flow [2025-03-04 10:08:41,401 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:08:41,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:41,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:41,408 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:08:41,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:41,602 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:41,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:41,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2078148164, now seen corresponding path program 2 times [2025-03-04 10:08:41,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:41,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800263060] [2025-03-04 10:08:41,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:41,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:41,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:41,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:41,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:41,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:41,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800263060] [2025-03-04 10:08:41,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800263060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345927280] [2025-03-04 10:08:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:41,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:41,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:41,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:41,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:41,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:41,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 223 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:08:41,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:41,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:41,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:41,837 INFO L124 PetriNetUnfolderBase]: 739/1132 cut-off events. [2025-03-04 10:08:41,837 INFO L125 PetriNetUnfolderBase]: For 3098/3098 co-relation queries the response was YES. [2025-03-04 10:08:41,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4375 conditions, 1132 events. 739/1132 cut-off events. For 3098/3098 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4697 event pairs, 225 based on Foata normal form. 42/1174 useless extension candidates. Maximal degree in co-relation 3132. Up to 610 conditions per place. [2025-03-04 10:08:41,846 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 54 selfloop transitions, 10 changer transitions 4/69 dead transitions. [2025-03-04 10:08:41,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 523 flow [2025-03-04 10:08:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:41,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-04 10:08:41,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2025-03-04 10:08:41,849 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 223 flow. Second operand 4 states and 65 transitions. [2025-03-04 10:08:41,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 523 flow [2025-03-04 10:08:41,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 508 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:41,858 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 279 flow [2025-03-04 10:08:41,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-03-04 10:08:41,860 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-03-04 10:08:41,860 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 279 flow [2025-03-04 10:08:41,860 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:08:41,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:41,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:41,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:08:41,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash 240884068, now seen corresponding path program 3 times [2025-03-04 10:08:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824947547] [2025-03-04 10:08:41,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:41,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:41,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:41,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:41,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:41,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:41,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824947547] [2025-03-04 10:08:41,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824947547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:41,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:41,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:41,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20811796] [2025-03-04 10:08:41,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:41,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:41,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:41,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:41,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:41,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 279 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:08:41,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:41,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:41,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:42,098 INFO L124 PetriNetUnfolderBase]: 825/1258 cut-off events. [2025-03-04 10:08:42,099 INFO L125 PetriNetUnfolderBase]: For 4730/4730 co-relation queries the response was YES. [2025-03-04 10:08:42,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5572 conditions, 1258 events. 825/1258 cut-off events. For 4730/4730 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5222 event pairs, 254 based on Foata normal form. 40/1298 useless extension candidates. Maximal degree in co-relation 4090. Up to 845 conditions per place. [2025-03-04 10:08:42,109 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 54 selfloop transitions, 8 changer transitions 12/75 dead transitions. [2025-03-04 10:08:42,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 661 flow [2025-03-04 10:08:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-03-04 10:08:42,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2025-03-04 10:08:42,110 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 279 flow. Second operand 4 states and 68 transitions. [2025-03-04 10:08:42,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 661 flow [2025-03-04 10:08:42,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 75 transitions, 623 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:42,117 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 314 flow [2025-03-04 10:08:42,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-03-04 10:08:42,119 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-03-04 10:08:42,119 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 314 flow [2025-03-04 10:08:42,119 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:08:42,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:42,120 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:42,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:08:42,120 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:42,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:42,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1515645236, now seen corresponding path program 3 times [2025-03-04 10:08:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:42,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785522721] [2025-03-04 10:08:42,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:42,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:42,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:42,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:42,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:42,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:42,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785522721] [2025-03-04 10:08:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785522721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:08:42,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:08:42,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:08:42,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979673724] [2025-03-04 10:08:42,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:08:42,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:08:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:42,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:08:42,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:08:42,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:42,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 314 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:08:42,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:42,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:42,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:42,337 INFO L124 PetriNetUnfolderBase]: 972/1506 cut-off events. [2025-03-04 10:08:42,337 INFO L125 PetriNetUnfolderBase]: For 5933/5933 co-relation queries the response was YES. [2025-03-04 10:08:42,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 1506 events. 972/1506 cut-off events. For 5933/5933 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6562 event pairs, 372 based on Foata normal form. 44/1550 useless extension candidates. Maximal degree in co-relation 4105. Up to 953 conditions per place. [2025-03-04 10:08:42,344 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 68 selfloop transitions, 6 changer transitions 13/88 dead transitions. [2025-03-04 10:08:42,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 88 transitions, 835 flow [2025-03-04 10:08:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-04 10:08:42,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2025-03-04 10:08:42,345 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 314 flow. Second operand 4 states and 62 transitions. [2025-03-04 10:08:42,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 88 transitions, 835 flow [2025-03-04 10:08:42,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 88 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:42,350 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 366 flow [2025-03-04 10:08:42,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2025-03-04 10:08:42,351 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-04 10:08:42,351 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 366 flow [2025-03-04 10:08:42,351 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:08:42,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:42,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:42,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:08:42,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:42,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:42,352 INFO L85 PathProgramCache]: Analyzing trace with hash -191794454, now seen corresponding path program 1 times [2025-03-04 10:08:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351007594] [2025-03-04 10:08:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:42,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:42,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:08:42,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:42,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:42,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:42,406 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:08:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351007594] [2025-03-04 10:08:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351007594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916299545] [2025-03-04 10:08:42,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:42,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:42,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:42,408 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:08:42,410 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:08:42,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:08:42,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:42,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:42,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:42,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:08:42,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:42,485 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:08:42,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:42,537 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:08:42,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916299545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:42,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:42,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:08:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068698890] [2025-03-04 10:08:42,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:42,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:42,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:42,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:42,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:42,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:42,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 366 flow. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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:08:42,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:42,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:42,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:42,927 INFO L124 PetriNetUnfolderBase]: 1166/1734 cut-off events. [2025-03-04 10:08:42,927 INFO L125 PetriNetUnfolderBase]: For 9184/9184 co-relation queries the response was YES. [2025-03-04 10:08:42,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8979 conditions, 1734 events. 1166/1734 cut-off events. For 9184/9184 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 7527 event pairs, 275 based on Foata normal form. 117/1851 useless extension candidates. Maximal degree in co-relation 5917. Up to 830 conditions per place. [2025-03-04 10:08:42,937 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 76 selfloop transitions, 73 changer transitions 23/173 dead transitions. [2025-03-04 10:08:42,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 173 transitions, 1872 flow [2025-03-04 10:08:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:08:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:08:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2025-03-04 10:08:42,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-03-04 10:08:42,939 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 366 flow. Second operand 13 states and 189 transitions. [2025-03-04 10:08:42,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 173 transitions, 1872 flow [2025-03-04 10:08:42,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 173 transitions, 1784 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:42,949 INFO L231 Difference]: Finished difference. Result has 70 places, 101 transitions, 1288 flow [2025-03-04 10:08:42,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1288, PETRI_PLACES=70, PETRI_TRANSITIONS=101} [2025-03-04 10:08:42,950 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2025-03-04 10:08:42,950 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 101 transitions, 1288 flow [2025-03-04 10:08:42,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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:08:42,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:42,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:42,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:08:43,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 10:08:43,151 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:43,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:43,152 INFO L85 PathProgramCache]: Analyzing trace with hash 250726278, now seen corresponding path program 4 times [2025-03-04 10:08:43,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:43,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383319540] [2025-03-04 10:08:43,152 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:43,158 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:43,161 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:43,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:43,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:43,217 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:08:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383319540] [2025-03-04 10:08:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383319540] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171343519] [2025-03-04 10:08:43,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:43,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:43,219 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:08:43,221 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:08:43,250 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:08:43,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:08:43,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:43,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:43,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:08:43,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:43,307 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:08:43,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:43,358 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:08:43,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171343519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:43,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:08:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537490289] [2025-03-04 10:08:43,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:43,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:43,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:43,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:43,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:43,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 101 transitions, 1288 flow. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:08:43,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:43,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:43,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:43,720 INFO L124 PetriNetUnfolderBase]: 990/1430 cut-off events. [2025-03-04 10:08:43,720 INFO L125 PetriNetUnfolderBase]: For 12202/12202 co-relation queries the response was YES. [2025-03-04 10:08:43,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9006 conditions, 1430 events. 990/1430 cut-off events. For 12202/12202 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5606 event pairs, 78 based on Foata normal form. 80/1510 useless extension candidates. Maximal degree in co-relation 8074. Up to 705 conditions per place. [2025-03-04 10:08:43,729 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 80 selfloop transitions, 94 changer transitions 4/179 dead transitions. [2025-03-04 10:08:43,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 179 transitions, 2359 flow [2025-03-04 10:08:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:08:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:08:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 164 transitions. [2025-03-04 10:08:43,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2025-03-04 10:08:43,731 INFO L175 Difference]: Start difference. First operand has 70 places, 101 transitions, 1288 flow. Second operand 12 states and 164 transitions. [2025-03-04 10:08:43,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 179 transitions, 2359 flow [2025-03-04 10:08:43,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 179 transitions, 1934 flow, removed 175 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:43,755 INFO L231 Difference]: Finished difference. Result has 82 places, 126 transitions, 1584 flow [2025-03-04 10:08:43,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1584, PETRI_PLACES=82, PETRI_TRANSITIONS=126} [2025-03-04 10:08:43,756 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 52 predicate places. [2025-03-04 10:08:43,756 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 126 transitions, 1584 flow [2025-03-04 10:08:43,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 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:08:43,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:43,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:43,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:43,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:43,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:43,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:43,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1406695884, now seen corresponding path program 1 times [2025-03-04 10:08:43,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:43,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914603514] [2025-03-04 10:08:43,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:43,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:43,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:08:43,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:43,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:43,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:44,128 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:08:44,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914603514] [2025-03-04 10:08:44,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914603514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:44,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153672133] [2025-03-04 10:08:44,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:44,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:44,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:44,130 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:08:44,132 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:08:44,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:08:44,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:44,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:44,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:44,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:44,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:44,299 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:08:44,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:44,750 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:08:44,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153672133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:44,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:44,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-04 10:08:44,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142893907] [2025-03-04 10:08:44,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:44,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:44,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:44,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:44,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:44,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 126 transitions, 1584 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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:08:44,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:44,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:44,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:45,035 INFO L124 PetriNetUnfolderBase]: 1411/2031 cut-off events. [2025-03-04 10:08:45,035 INFO L125 PetriNetUnfolderBase]: For 13570/13570 co-relation queries the response was YES. [2025-03-04 10:08:45,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11713 conditions, 2031 events. 1411/2031 cut-off events. For 13570/13570 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8076 event pairs, 160 based on Foata normal form. 2/2033 useless extension candidates. Maximal degree in co-relation 10974. Up to 1460 conditions per place. [2025-03-04 10:08:45,051 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 152 selfloop transitions, 58 changer transitions 2/213 dead transitions. [2025-03-04 10:08:45,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 213 transitions, 2668 flow [2025-03-04 10:08:45,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2025-03-04 10:08:45,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.588477366255144 [2025-03-04 10:08:45,054 INFO L175 Difference]: Start difference. First operand has 82 places, 126 transitions, 1584 flow. Second operand 9 states and 143 transitions. [2025-03-04 10:08:45,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 213 transitions, 2668 flow [2025-03-04 10:08:45,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 213 transitions, 2334 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-04 10:08:45,088 INFO L231 Difference]: Finished difference. Result has 81 places, 158 transitions, 1872 flow [2025-03-04 10:08:45,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1872, PETRI_PLACES=81, PETRI_TRANSITIONS=158} [2025-03-04 10:08:45,089 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-03-04 10:08:45,089 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 158 transitions, 1872 flow [2025-03-04 10:08:45,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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:08:45,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:45,089 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:45,095 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:08:45,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:45,293 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:45,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1654730824, now seen corresponding path program 2 times [2025-03-04 10:08:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939192660] [2025-03-04 10:08:45,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:45,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:45,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:45,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:45,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:45,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:45,420 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:08:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939192660] [2025-03-04 10:08:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939192660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645279552] [2025-03-04 10:08:45,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:45,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:45,422 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:08:45,423 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:08:45,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:45,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:45,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:45,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:45,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:45,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:45,551 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:08:45,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:45,953 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:08:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645279552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:45,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 10:08:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734970626] [2025-03-04 10:08:45,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:45,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:08:45,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:45,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:08:45,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:08:45,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:45,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 158 transitions, 1872 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:08:45,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:45,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:45,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:46,252 INFO L124 PetriNetUnfolderBase]: 1707/2463 cut-off events. [2025-03-04 10:08:46,252 INFO L125 PetriNetUnfolderBase]: For 15685/15685 co-relation queries the response was YES. [2025-03-04 10:08:46,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14183 conditions, 2463 events. 1707/2463 cut-off events. For 15685/15685 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10103 event pairs, 279 based on Foata normal form. 2/2465 useless extension candidates. Maximal degree in co-relation 13608. Up to 1895 conditions per place. [2025-03-04 10:08:46,266 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 165 selfloop transitions, 61 changer transitions 2/229 dead transitions. [2025-03-04 10:08:46,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 229 transitions, 2829 flow [2025-03-04 10:08:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:46,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-03-04 10:08:46,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761316872427984 [2025-03-04 10:08:46,267 INFO L175 Difference]: Start difference. First operand has 81 places, 158 transitions, 1872 flow. Second operand 9 states and 140 transitions. [2025-03-04 10:08:46,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 229 transitions, 2829 flow [2025-03-04 10:08:46,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 229 transitions, 2645 flow, removed 79 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:46,300 INFO L231 Difference]: Finished difference. Result has 91 places, 177 transitions, 2129 flow [2025-03-04 10:08:46,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1688, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2129, PETRI_PLACES=91, PETRI_TRANSITIONS=177} [2025-03-04 10:08:46,301 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-03-04 10:08:46,301 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 177 transitions, 2129 flow [2025-03-04 10:08:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:08:46,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:46,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:46,307 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:08:46,501 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:08:46,502 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 544554414, now seen corresponding path program 3 times [2025-03-04 10:08:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349197662] [2025-03-04 10:08:46,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:46,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:46,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:46,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:46,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:46,654 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:08:46,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349197662] [2025-03-04 10:08:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349197662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:46,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132567308] [2025-03-04 10:08:46,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:46,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:46,657 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:08:46,658 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:08:46,686 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:46,701 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:46,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:46,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:46,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:46,767 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:08:46,767 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:47,204 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:08:47,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132567308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:47,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:47,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 10 [2025-03-04 10:08:47,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268163530] [2025-03-04 10:08:47,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:47,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:47,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:47,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:47,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:47,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:47,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 177 transitions, 2129 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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:08:47,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:47,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:47,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:47,588 INFO L124 PetriNetUnfolderBase]: 2132/3081 cut-off events. [2025-03-04 10:08:47,588 INFO L125 PetriNetUnfolderBase]: For 21084/21084 co-relation queries the response was YES. [2025-03-04 10:08:47,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17810 conditions, 3081 events. 2132/3081 cut-off events. For 21084/21084 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 13175 event pairs, 430 based on Foata normal form. 2/3083 useless extension candidates. Maximal degree in co-relation 17381. Up to 2537 conditions per place. [2025-03-04 10:08:47,606 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 200 selfloop transitions, 59 changer transitions 2/262 dead transitions. [2025-03-04 10:08:47,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 262 transitions, 3388 flow [2025-03-04 10:08:47,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2025-03-04 10:08:47,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5761316872427984 [2025-03-04 10:08:47,608 INFO L175 Difference]: Start difference. First operand has 91 places, 177 transitions, 2129 flow. Second operand 9 states and 140 transitions. [2025-03-04 10:08:47,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 262 transitions, 3388 flow [2025-03-04 10:08:47,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 262 transitions, 3179 flow, removed 79 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:47,657 INFO L231 Difference]: Finished difference. Result has 100 places, 210 transitions, 2615 flow [2025-03-04 10:08:47,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2615, PETRI_PLACES=100, PETRI_TRANSITIONS=210} [2025-03-04 10:08:47,657 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 70 predicate places. [2025-03-04 10:08:47,657 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 210 transitions, 2615 flow [2025-03-04 10:08:47,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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:08:47,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:47,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:47,664 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:08:47,862 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:08:47,862 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1152019026, now seen corresponding path program 4 times [2025-03-04 10:08:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21823798] [2025-03-04 10:08:47,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:47,866 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:47,870 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:08:47,870 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,014 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:08:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21823798] [2025-03-04 10:08:48,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21823798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:48,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42884405] [2025-03-04 10:08:48,015 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:48,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:48,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:48,017 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:08:48,019 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:08:48,048 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:48,064 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:08:48,064 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:48,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:48,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:48,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:48,124 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:08:48,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:48,620 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:08:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42884405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:48,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 10:08:48,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569706508] [2025-03-04 10:08:48,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:48,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:08:48,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:48,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:08:48,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:08:48,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:48,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 210 transitions, 2615 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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:08:48,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:48,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:48,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:49,085 INFO L124 PetriNetUnfolderBase]: 2412/3489 cut-off events. [2025-03-04 10:08:49,085 INFO L125 PetriNetUnfolderBase]: For 24886/24886 co-relation queries the response was YES. [2025-03-04 10:08:49,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20360 conditions, 3489 events. 2412/3489 cut-off events. For 24886/24886 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15350 event pairs, 544 based on Foata normal form. 2/3491 useless extension candidates. Maximal degree in co-relation 19900. Up to 2968 conditions per place. [2025-03-04 10:08:49,104 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 212 selfloop transitions, 62 changer transitions 2/277 dead transitions. [2025-03-04 10:08:49,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 277 transitions, 3742 flow [2025-03-04 10:08:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:49,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2025-03-04 10:08:49,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5596707818930041 [2025-03-04 10:08:49,105 INFO L175 Difference]: Start difference. First operand has 100 places, 210 transitions, 2615 flow. Second operand 9 states and 136 transitions. [2025-03-04 10:08:49,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 277 transitions, 3742 flow [2025-03-04 10:08:49,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 277 transitions, 3484 flow, removed 116 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:49,162 INFO L231 Difference]: Finished difference. Result has 110 places, 229 transitions, 2865 flow [2025-03-04 10:08:49,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2357, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2865, PETRI_PLACES=110, PETRI_TRANSITIONS=229} [2025-03-04 10:08:49,163 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2025-03-04 10:08:49,163 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 229 transitions, 2865 flow [2025-03-04 10:08:49,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 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:08:49,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:49,164 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:49,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:49,364 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:08:49,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:49,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash -261220434, now seen corresponding path program 5 times [2025-03-04 10:08:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859030235] [2025-03-04 10:08:49,369 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:49,373 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:49,382 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:49,382 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:49,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:49,484 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:08:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859030235] [2025-03-04 10:08:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859030235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306299906] [2025-03-04 10:08:49,484 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:49,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:49,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:49,486 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:08:49,488 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:08:49,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:49,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:49,533 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:49,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:49,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:49,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:49,612 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:08:49,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:50,518 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:08:50,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306299906] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:50,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2025-03-04 10:08:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139064312] [2025-03-04 10:08:50,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:50,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:08:50,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:50,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:08:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:08:50,519 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:50,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 229 transitions, 2865 flow. Second operand has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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:08:50,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:50,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:50,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:50,939 INFO L124 PetriNetUnfolderBase]: 2768/4002 cut-off events. [2025-03-04 10:08:50,939 INFO L125 PetriNetUnfolderBase]: For 29913/29913 co-relation queries the response was YES. [2025-03-04 10:08:50,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23311 conditions, 4002 events. 2768/4002 cut-off events. For 29913/29913 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 18224 event pairs, 672 based on Foata normal form. 1/4003 useless extension candidates. Maximal degree in co-relation 22807. Up to 3541 conditions per place. [2025-03-04 10:08:50,960 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 242 selfloop transitions, 61 changer transitions 1/305 dead transitions. [2025-03-04 10:08:50,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 305 transitions, 4266 flow [2025-03-04 10:08:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:08:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:08:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-03-04 10:08:50,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5509259259259259 [2025-03-04 10:08:50,961 INFO L175 Difference]: Start difference. First operand has 110 places, 229 transitions, 2865 flow. Second operand 8 states and 119 transitions. [2025-03-04 10:08:50,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 305 transitions, 4266 flow [2025-03-04 10:08:51,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 305 transitions, 4004 flow, removed 105 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:51,030 INFO L231 Difference]: Finished difference. Result has 118 places, 264 transitions, 3383 flow [2025-03-04 10:08:51,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3383, PETRI_PLACES=118, PETRI_TRANSITIONS=264} [2025-03-04 10:08:51,030 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2025-03-04 10:08:51,031 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 264 transitions, 3383 flow [2025-03-04 10:08:51,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.0) internal successors, (120), 12 states have internal predecessors, (120), 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:08:51,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:51,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:51,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:51,235 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,SelfDestructingSolverStorable13 [2025-03-04 10:08:51,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash 977243950, now seen corresponding path program 6 times [2025-03-04 10:08:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985511696] [2025-03-04 10:08:51,235 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:08:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:51,239 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:51,243 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:51,243 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:08:51,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,352 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:08:51,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:51,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985511696] [2025-03-04 10:08:51,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985511696] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:51,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479465698] [2025-03-04 10:08:51,353 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:08:51,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:51,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:51,355 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:08:51,356 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:08:51,383 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:08:51,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:08:51,398 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:08:51,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:51,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:08:51,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:51,456 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:08:51,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:52,593 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:08:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479465698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:52,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 9 [2025-03-04 10:08:52,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793613177] [2025-03-04 10:08:52,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:52,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:08:52,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:52,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:08:52,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:08:52,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 264 transitions, 3383 flow. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:08:52,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:52,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:52,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:53,079 INFO L124 PetriNetUnfolderBase]: 3048/4410 cut-off events. [2025-03-04 10:08:53,079 INFO L125 PetriNetUnfolderBase]: For 34542/34542 co-relation queries the response was YES. [2025-03-04 10:08:53,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25996 conditions, 4410 events. 3048/4410 cut-off events. For 34542/34542 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 20411 event pairs, 771 based on Foata normal form. 2/4412 useless extension candidates. Maximal degree in co-relation 25471. Up to 3912 conditions per place. [2025-03-04 10:08:53,107 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 263 selfloop transitions, 64 changer transitions 2/330 dead transitions. [2025-03-04 10:08:53,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 330 transitions, 4712 flow [2025-03-04 10:08:53,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:08:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:08:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-03-04 10:08:53,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551440329218107 [2025-03-04 10:08:53,109 INFO L175 Difference]: Start difference. First operand has 118 places, 264 transitions, 3383 flow. Second operand 9 states and 134 transitions. [2025-03-04 10:08:53,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 330 transitions, 4712 flow [2025-03-04 10:08:53,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 330 transitions, 4406 flow, removed 140 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:53,263 INFO L231 Difference]: Finished difference. Result has 128 places, 283 transitions, 3660 flow [2025-03-04 10:08:53,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3077, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3660, PETRI_PLACES=128, PETRI_TRANSITIONS=283} [2025-03-04 10:08:53,264 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2025-03-04 10:08:53,264 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 283 transitions, 3660 flow [2025-03-04 10:08:53,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 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:08:53,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:53,264 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:53,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:53,464 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,SelfDestructingSolverStorable14 [2025-03-04 10:08:53,464 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:53,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash 805081396, now seen corresponding path program 7 times [2025-03-04 10:08:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:53,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613038810] [2025-03-04 10:08:53,466 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:08:53,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:53,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:53,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:53,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:53,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:53,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613038810] [2025-03-04 10:08:53,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613038810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:53,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234747075] [2025-03-04 10:08:53,576 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:08:53,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:53,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:53,578 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:08:53,580 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:08:53,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:53,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:53,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:53,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:53,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234747075] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:53,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-04 10:08:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42912646] [2025-03-04 10:08:53,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:08:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:53,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:08:53,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:08:53,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:53,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 283 transitions, 3660 flow. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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:08:53,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:53,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:53,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:54,591 INFO L124 PetriNetUnfolderBase]: 4613/6557 cut-off events. [2025-03-04 10:08:54,592 INFO L125 PetriNetUnfolderBase]: For 57505/57505 co-relation queries the response was YES. [2025-03-04 10:08:54,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38035 conditions, 6557 events. 4613/6557 cut-off events. For 57505/57505 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 31136 event pairs, 436 based on Foata normal form. 41/6598 useless extension candidates. Maximal degree in co-relation 36952. Up to 2111 conditions per place. [2025-03-04 10:08:54,629 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 515 selfloop transitions, 134 changer transitions 0/650 dead transitions. [2025-03-04 10:08:54,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 650 transitions, 9275 flow [2025-03-04 10:08:54,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:08:54,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:08:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2025-03-04 10:08:54,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5811965811965812 [2025-03-04 10:08:54,631 INFO L175 Difference]: Start difference. First operand has 128 places, 283 transitions, 3660 flow. Second operand 13 states and 204 transitions. [2025-03-04 10:08:54,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 650 transitions, 9275 flow [2025-03-04 10:08:54,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 650 transitions, 8408 flow, removed 407 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:54,740 INFO L231 Difference]: Finished difference. Result has 145 places, 349 transitions, 4512 flow [2025-03-04 10:08:54,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=3326, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4512, PETRI_PLACES=145, PETRI_TRANSITIONS=349} [2025-03-04 10:08:54,740 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2025-03-04 10:08:54,741 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 349 transitions, 4512 flow [2025-03-04 10:08:54,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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:08:54,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:54,741 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:54,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:08:54,945 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,SelfDestructingSolverStorable15 [2025-03-04 10:08:54,945 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:54,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:54,946 INFO L85 PathProgramCache]: Analyzing trace with hash -471621144, now seen corresponding path program 8 times [2025-03-04 10:08:54,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:54,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932511163] [2025-03-04 10:08:54,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:54,949 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:54,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:54,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:54,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932511163] [2025-03-04 10:08:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932511163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827702929] [2025-03-04 10:08:55,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:55,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:55,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:55,058 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:08:55,060 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:08:55,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:55,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:55,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:55,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:55,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:55,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:55,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:55,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827702929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:55,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:55,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 10:08:55,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256989203] [2025-03-04 10:08:55,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:55,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:08:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:55,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:08:55,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:08:55,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:55,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 349 transitions, 4512 flow. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:08:55,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:56,425 INFO L124 PetriNetUnfolderBase]: 6612/9219 cut-off events. [2025-03-04 10:08:56,425 INFO L125 PetriNetUnfolderBase]: For 102397/102397 co-relation queries the response was YES. [2025-03-04 10:08:56,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63751 conditions, 9219 events. 6612/9219 cut-off events. For 102397/102397 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 43926 event pairs, 746 based on Foata normal form. 166/9385 useless extension candidates. Maximal degree in co-relation 61980. Up to 3683 conditions per place. [2025-03-04 10:08:56,482 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 692 selfloop transitions, 231 changer transitions 0/924 dead transitions. [2025-03-04 10:08:56,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 924 transitions, 14114 flow [2025-03-04 10:08:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:08:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:08:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 318 transitions. [2025-03-04 10:08:56,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5120772946859904 [2025-03-04 10:08:56,483 INFO L175 Difference]: Start difference. First operand has 145 places, 349 transitions, 4512 flow. Second operand 23 states and 318 transitions. [2025-03-04 10:08:56,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 924 transitions, 14114 flow [2025-03-04 10:08:56,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 924 transitions, 13181 flow, removed 386 selfloop flow, removed 1 redundant places. [2025-03-04 10:08:56,830 INFO L231 Difference]: Finished difference. Result has 176 places, 507 transitions, 7608 flow [2025-03-04 10:08:56,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7608, PETRI_PLACES=176, PETRI_TRANSITIONS=507} [2025-03-04 10:08:56,831 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 146 predicate places. [2025-03-04 10:08:56,831 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 507 transitions, 7608 flow [2025-03-04 10:08:56,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 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:08:56,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:56,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:56,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:08:57,031 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,SelfDestructingSolverStorable16 [2025-03-04 10:08:57,031 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2146370104, now seen corresponding path program 9 times [2025-03-04 10:08:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430596699] [2025-03-04 10:08:57,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:57,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:57,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:57,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:57,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:57,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430596699] [2025-03-04 10:08:57,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430596699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:57,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127901668] [2025-03-04 10:08:57,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:57,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:57,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:57,121 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:08:57,123 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:08:57,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:57,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:57,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:57,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:57,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:57,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:57,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127901668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:57,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-04 10:08:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906232178] [2025-03-04 10:08:57,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:57,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:08:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:57,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:08:57,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:08:57,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:08:57,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 507 transitions, 7608 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:57,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:57,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:08:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:58,789 INFO L124 PetriNetUnfolderBase]: 7009/9875 cut-off events. [2025-03-04 10:08:58,789 INFO L125 PetriNetUnfolderBase]: For 173178/173178 co-relation queries the response was YES. [2025-03-04 10:08:58,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77704 conditions, 9875 events. 7009/9875 cut-off events. For 173178/173178 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 49533 event pairs, 1493 based on Foata normal form. 197/10072 useless extension candidates. Maximal degree in co-relation 75528. Up to 5343 conditions per place. [2025-03-04 10:08:58,850 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 655 selfloop transitions, 153 changer transitions 64/873 dead transitions. [2025-03-04 10:08:58,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 873 transitions, 16313 flow [2025-03-04 10:08:58,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:08:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:08:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-03-04 10:08:58,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2025-03-04 10:08:58,851 INFO L175 Difference]: Start difference. First operand has 176 places, 507 transitions, 7608 flow. Second operand 8 states and 123 transitions. [2025-03-04 10:08:58,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 873 transitions, 16313 flow [2025-03-04 10:08:59,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 873 transitions, 13409 flow, removed 1452 selfloop flow, removed 0 redundant places. [2025-03-04 10:08:59,590 INFO L231 Difference]: Finished difference. Result has 187 places, 575 transitions, 8387 flow [2025-03-04 10:08:59,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=6634, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8387, PETRI_PLACES=187, PETRI_TRANSITIONS=575} [2025-03-04 10:08:59,590 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2025-03-04 10:08:59,590 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 575 transitions, 8387 flow [2025-03-04 10:08:59,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:59,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:59,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:59,597 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:08:59,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:08:59,791 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:08:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:59,792 INFO L85 PathProgramCache]: Analyzing trace with hash -209328124, now seen corresponding path program 10 times [2025-03-04 10:08:59,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:59,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577854578] [2025-03-04 10:08:59,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:59,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:59,795 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:59,800 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:59,800 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:59,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:08:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577854578] [2025-03-04 10:08:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577854578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817410089] [2025-03-04 10:08:59,895 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:59,898 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:08:59,898 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:08:59,927 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:08:59,940 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:59,940 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:59,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:08:59,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:08:59,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:00,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817410089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:00,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:00,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-03-04 10:09:00,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85805116] [2025-03-04 10:09:00,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:00,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:09:00,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:09:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:09:00,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:09:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 575 transitions, 8387 flow. Second operand has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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:09:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:09:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:07,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:09:08,069 INFO L124 PetriNetUnfolderBase]: 9713/13625 cut-off events. [2025-03-04 10:09:08,069 INFO L125 PetriNetUnfolderBase]: For 254719/254719 co-relation queries the response was YES. [2025-03-04 10:09:08,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104319 conditions, 13625 events. 9713/13625 cut-off events. For 254719/254719 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 71740 event pairs, 742 based on Foata normal form. 627/14252 useless extension candidates. Maximal degree in co-relation 101894. Up to 5073 conditions per place. [2025-03-04 10:09:08,203 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 835 selfloop transitions, 747 changer transitions 104/1687 dead transitions. [2025-03-04 10:09:08,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 1687 transitions, 28757 flow [2025-03-04 10:09:08,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 10:09:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-03-04 10:09:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 877 transitions. [2025-03-04 10:09:08,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44495180111618465 [2025-03-04 10:09:08,207 INFO L175 Difference]: Start difference. First operand has 187 places, 575 transitions, 8387 flow. Second operand 73 states and 877 transitions. [2025-03-04 10:09:08,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 1687 transitions, 28757 flow [2025-03-04 10:09:10,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1687 transitions, 28213 flow, removed 183 selfloop flow, removed 2 redundant places. [2025-03-04 10:09:10,361 INFO L231 Difference]: Finished difference. Result has 290 places, 1139 transitions, 21687 flow [2025-03-04 10:09:10,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=8089, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=21687, PETRI_PLACES=290, PETRI_TRANSITIONS=1139} [2025-03-04 10:09:10,362 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2025-03-04 10:09:10,362 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 1139 transitions, 21687 flow [2025-03-04 10:09:10,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.222222222222222) internal successors, (130), 18 states have internal predecessors, (130), 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:09:10,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:10,362 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:10,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:10,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:10,563 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:09:10,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:10,563 INFO L85 PathProgramCache]: Analyzing trace with hash -757641854, now seen corresponding path program 11 times [2025-03-04 10:09:10,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:10,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747467964] [2025-03-04 10:09:10,563 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:10,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:09:10,574 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:10,576 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:10,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747467964] [2025-03-04 10:09:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747467964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:10,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487018044] [2025-03-04 10:09:10,638 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:09:10,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:10,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:10,642 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:09:10,642 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:09:10,668 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:09:10,679 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:10,680 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:09:10,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:10,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:09:10,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:10,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:10,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487018044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:10,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:10,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 10:09:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850675246] [2025-03-04 10:09:10,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:10,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:09:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:10,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:09:10,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:09:10,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:09:10,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 1139 transitions, 21687 flow. Second operand has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 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:09:10,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:10,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:09:10,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:16,146 INFO L124 PetriNetUnfolderBase]: 13826/19134 cut-off events. [2025-03-04 10:09:16,146 INFO L125 PetriNetUnfolderBase]: For 633187/633187 co-relation queries the response was YES. [2025-03-04 10:09:16,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180011 conditions, 19134 events. 13826/19134 cut-off events. For 633187/633187 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 103877 event pairs, 597 based on Foata normal form. 738/19872 useless extension candidates. Maximal degree in co-relation 179486. Up to 6157 conditions per place. [2025-03-04 10:09:16,384 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 1636 selfloop transitions, 1254 changer transitions 37/2928 dead transitions. [2025-03-04 10:09:16,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 2928 transitions, 61890 flow [2025-03-04 10:09:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 10:09:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-04 10:09:16,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 729 transitions. [2025-03-04 10:09:16,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2025-03-04 10:09:16,387 INFO L175 Difference]: Start difference. First operand has 290 places, 1139 transitions, 21687 flow. Second operand 57 states and 729 transitions. [2025-03-04 10:09:16,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 2928 transitions, 61890 flow [2025-03-04 10:09:24,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 2928 transitions, 52845 flow, removed 4248 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:24,673 INFO L231 Difference]: Finished difference. Result has 375 places, 2003 transitions, 38941 flow [2025-03-04 10:09:24,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=16568, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=468, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=38941, PETRI_PLACES=375, PETRI_TRANSITIONS=2003} [2025-03-04 10:09:24,674 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 345 predicate places. [2025-03-04 10:09:24,674 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 2003 transitions, 38941 flow [2025-03-04 10:09:24,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.5) internal successors, (120), 16 states have internal predecessors, (120), 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:09:24,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:24,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:24,680 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:09:24,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:24,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:09:24,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2130498310, now seen corresponding path program 12 times [2025-03-04 10:09:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:24,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132796288] [2025-03-04 10:09:24,876 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:24,878 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:09:24,883 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:24,883 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:24,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132796288] [2025-03-04 10:09:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132796288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626809436] [2025-03-04 10:09:24,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:09:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:24,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:24,985 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:09:24,987 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:09:25,017 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:09:25,029 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:25,030 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:09:25,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:25,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:09:25,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:25,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626809436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:25,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:25,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-04 10:09:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923404724] [2025-03-04 10:09:25,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:09:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:25,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:09:25,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:09:25,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:09:25,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 2003 transitions, 38941 flow. Second operand has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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:09:25,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:25,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:09:25,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:09:34,023 INFO L124 PetriNetUnfolderBase]: 18119/24918 cut-off events. [2025-03-04 10:09:34,023 INFO L125 PetriNetUnfolderBase]: For 1257887/1257887 co-relation queries the response was YES. [2025-03-04 10:09:34,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277600 conditions, 24918 events. 18119/24918 cut-off events. For 1257887/1257887 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 138145 event pairs, 1095 based on Foata normal form. 446/25362 useless extension candidates. Maximal degree in co-relation 277215. Up to 8279 conditions per place. [2025-03-04 10:09:34,347 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 2008 selfloop transitions, 1607 changer transitions 21/3637 dead transitions. [2025-03-04 10:09:34,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 3637 transitions, 85714 flow [2025-03-04 10:09:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:09:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:09:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 321 transitions. [2025-03-04 10:09:34,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49537037037037035 [2025-03-04 10:09:34,348 INFO L175 Difference]: Start difference. First operand has 375 places, 2003 transitions, 38941 flow. Second operand 24 states and 321 transitions. [2025-03-04 10:09:34,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 3637 transitions, 85714 flow [2025-03-04 10:09:50,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 3637 transitions, 76923 flow, removed 4250 selfloop flow, removed 7 redundant places. [2025-03-04 10:09:51,007 INFO L231 Difference]: Finished difference. Result has 407 places, 2719 transitions, 55410 flow [2025-03-04 10:09:51,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=33749, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=975, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=862, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=55410, PETRI_PLACES=407, PETRI_TRANSITIONS=2719} [2025-03-04 10:09:51,008 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 377 predicate places. [2025-03-04 10:09:51,008 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 2719 transitions, 55410 flow [2025-03-04 10:09:51,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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:09:51,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:09:51,009 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:09:51,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:09:51,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:51,209 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-04 10:09:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:09:51,210 INFO L85 PathProgramCache]: Analyzing trace with hash -51057426, now seen corresponding path program 13 times [2025-03-04 10:09:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:09:51,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855313628] [2025-03-04 10:09:51,210 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:09:51,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:09:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:09:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855313628] [2025-03-04 10:09:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855313628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:09:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617445278] [2025-03-04 10:09:51,278 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:09:51,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:09:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:09:51,280 INFO L229 MonitoredProcess]: Starting monitored process 17 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:09:51,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:09:51,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:09:51,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:09:51,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:09:51,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:09:51,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:09:51,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:09:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:51,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:09:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:09:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617445278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:09:51,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:09:51,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2025-03-04 10:09:51,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265031587] [2025-03-04 10:09:51,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:09:51,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:09:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:09:51,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:09:51,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:09:51,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-03-04 10:09:51,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 2719 transitions, 55410 flow. Second operand has 15 states, 15 states have (on average 8.0) internal successors, (120), 15 states have internal predecessors, (120), 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:09:51,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:09:51,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-03-04 10:09:51,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:10:04,555 INFO L124 PetriNetUnfolderBase]: 21835/30046 cut-off events. [2025-03-04 10:10:04,555 INFO L125 PetriNetUnfolderBase]: For 1496540/1496540 co-relation queries the response was YES. [2025-03-04 10:10:04,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347745 conditions, 30046 events. 21835/30046 cut-off events. For 1496540/1496540 co-relation queries the response was YES. Maximal size of possible extension queue 1471. Compared 172588 event pairs, 1515 based on Foata normal form. 365/30411 useless extension candidates. Maximal degree in co-relation 347341. Up to 10353 conditions per place. [2025-03-04 10:10:04,996 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 2436 selfloop transitions, 1942 changer transitions 1/4380 dead transitions. [2025-03-04 10:10:04,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 476 places, 4380 transitions, 102275 flow [2025-03-04 10:10:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-04 10:10:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2025-03-04 10:10:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 883 transitions. [2025-03-04 10:10:04,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4419419419419419 [2025-03-04 10:10:04,998 INFO L175 Difference]: Start difference. First operand has 407 places, 2719 transitions, 55410 flow. Second operand 74 states and 883 transitions. [2025-03-04 10:10:04,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 476 places, 4380 transitions, 102275 flow