./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e66d74cf738883d82d8ab680e594f84e8947532df35a185c16ed9746f38b197c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:11:45,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:11:45,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:11:45,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:11:45,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:11:45,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:11:45,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:11:45,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:11:45,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:11:45,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:11:45,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:11:45,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:11:45,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:11:45,757 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:11:45,757 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:11:45,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:11:45,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:11:45,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:45,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:11:45,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:11:45,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:11:45,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:11:45,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:11:45,763 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 -> e66d74cf738883d82d8ab680e594f84e8947532df35a185c16ed9746f38b197c [2025-03-04 10:11:45,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:45,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:45,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:45,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:45,970 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:45,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c [2025-03-04 10:11:47,100 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fab7d0b2/2311c5bd6dec463fbd68f5ab9ebc8efd/FLAGd8fae8bbc [2025-03-04 10:11:47,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:47,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c [2025-03-04 10:11:47,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fab7d0b2/2311c5bd6dec463fbd68f5ab9ebc8efd/FLAGd8fae8bbc [2025-03-04 10:11:47,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fab7d0b2/2311c5bd6dec463fbd68f5ab9ebc8efd [2025-03-04 10:11:47,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:47,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:47,664 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:47,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:47,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:47,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@670f7015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47, skipping insertion in model container [2025-03-04 10:11:47,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:47,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:47,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:47,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:47,815 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:47,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47 WrapperNode [2025-03-04 10:11:47,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:47,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:47,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:47,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:47,821 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:11:47" (1/1) ... [2025-03-04 10:11:47,825 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:11:47" (1/1) ... [2025-03-04 10:11:47,838 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 65 [2025-03-04 10:11:47,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:47,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:47,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:47,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:47,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,853 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:11:47,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:47,859 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:47,859 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:47,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:47,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (1/1) ... [2025-03-04 10:11:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:47,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:47,889 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:11:47,891 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:11:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:11:47,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:47,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:47,908 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:11:47,968 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:47,970 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:48,122 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:48,122 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:48,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:48,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:48,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:48 BoogieIcfgContainer [2025-03-04 10:11:48,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:48,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:48,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:48,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:48,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:47" (1/3) ... [2025-03-04 10:11:48,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:48, skipping insertion in model container [2025-03-04 10:11:48,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:47" (2/3) ... [2025-03-04 10:11:48,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3083c83b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:48, skipping insertion in model container [2025-03-04 10:11:48,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:48" (3/3) ... [2025-03-04 10:11:48,226 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2025-03-04 10:11:48,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:48,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-figure1-alt.wvr.c that has 3 procedures, 23 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 10:11:48,239 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:48,275 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:11:48,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2025-03-04 10:11:48,321 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-03-04 10:11:48,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:48,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-03-04 10:11:48,326 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2025-03-04 10:11:48,329 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-03-04 10:11:48,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:48,343 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;@5c7193e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:48,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:11:48,352 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:48,352 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2025-03-04 10:11:48,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:48,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:48,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:48,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:48,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:48,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1096739583, now seen corresponding path program 1 times [2025-03-04 10:11:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811889220] [2025-03-04 10:11:48,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:48,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:48,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:48,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:48,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:48,841 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:11:48,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811889220] [2025-03-04 10:11:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811889220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:48,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:48,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034070772] [2025-03-04 10:11:48,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:48,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:48,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:48,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:48,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:48,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:48,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:48,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:48,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,034 INFO L124 PetriNetUnfolderBase]: 88/176 cut-off events. [2025-03-04 10:11:49,034 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 10:11:49,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 176 events. 88/176 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 554 event pairs, 26 based on Foata normal form. 3/171 useless extension candidates. Maximal degree in co-relation 307. Up to 110 conditions per place. [2025-03-04 10:11:49,036 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 31 selfloop transitions, 8 changer transitions 4/45 dead transitions. [2025-03-04 10:11:49,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 45 transitions, 209 flow [2025-03-04 10:11:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-03-04 10:11:49,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-03-04 10:11:49,046 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 7 states and 82 transitions. [2025-03-04 10:11:49,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 45 transitions, 209 flow [2025-03-04 10:11:49,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 45 transitions, 187 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:49,050 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 97 flow [2025-03-04 10:11:49,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-03-04 10:11:49,055 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2025-03-04 10:11:49,055 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 97 flow [2025-03-04 10:11:49,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:49,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:49,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:11:49,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:49,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,058 INFO L85 PathProgramCache]: Analyzing trace with hash 442307849, now seen corresponding path program 2 times [2025-03-04 10:11:49,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:49,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219375274] [2025-03-04 10:11:49,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:49,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:49,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:49,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:49,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:49,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,263 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:11:49,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219375274] [2025-03-04 10:11:49,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219375274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:49,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:49,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391540494] [2025-03-04 10:11:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:49,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:49,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:49,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:49,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,436 INFO L124 PetriNetUnfolderBase]: 88/184 cut-off events. [2025-03-04 10:11:49,436 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-03-04 10:11:49,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 184 events. 88/184 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 641 event pairs, 22 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 473. Up to 110 conditions per place. [2025-03-04 10:11:49,437 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 30 selfloop transitions, 8 changer transitions 9/49 dead transitions. [2025-03-04 10:11:49,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 49 transitions, 269 flow [2025-03-04 10:11:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-03-04 10:11:49,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47023809523809523 [2025-03-04 10:11:49,439 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 97 flow. Second operand 7 states and 79 transitions. [2025-03-04 10:11:49,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 49 transitions, 269 flow [2025-03-04 10:11:49,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 265 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:49,440 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 131 flow [2025-03-04 10:11:49,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2025-03-04 10:11:49,441 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2025-03-04 10:11:49,441 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 131 flow [2025-03-04 10:11:49,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:49,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:49,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:11:49,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:49,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash -986836711, now seen corresponding path program 3 times [2025-03-04 10:11:49,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712605697] [2025-03-04 10:11:49,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:49,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:49,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:49,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:11:49,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,618 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:11:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712605697] [2025-03-04 10:11:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712605697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501214201] [2025-03-04 10:11:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:49,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:49,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:49,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 131 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:49,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:49,741 INFO L124 PetriNetUnfolderBase]: 91/185 cut-off events. [2025-03-04 10:11:49,741 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2025-03-04 10:11:49,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 185 events. 91/185 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 607 event pairs, 30 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 568. Up to 114 conditions per place. [2025-03-04 10:11:49,743 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 29 selfloop transitions, 12 changer transitions 4/47 dead transitions. [2025-03-04 10:11:49,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 310 flow [2025-03-04 10:11:49,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-03-04 10:11:49,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 10:11:49,745 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 131 flow. Second operand 7 states and 78 transitions. [2025-03-04 10:11:49,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 310 flow [2025-03-04 10:11:49,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 289 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:49,747 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 194 flow [2025-03-04 10:11:49,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=194, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2025-03-04 10:11:49,749 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2025-03-04 10:11:49,749 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 194 flow [2025-03-04 10:11:49,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:49,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:49,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:11:49,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1628008373, now seen corresponding path program 4 times [2025-03-04 10:11:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907957056] [2025-03-04 10:11:49,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:49,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:11:49,759 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:49,759 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:49,880 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:11:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907957056] [2025-03-04 10:11:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907957056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:49,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:49,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:49,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313491580] [2025-03-04 10:11:49,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:49,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:49,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:49,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:49,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:49,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:49,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,027 INFO L124 PetriNetUnfolderBase]: 90/196 cut-off events. [2025-03-04 10:11:50,028 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-04 10:11:50,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 196 events. 90/196 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 712 event pairs, 23 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 624. Up to 114 conditions per place. [2025-03-04 10:11:50,029 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 36 selfloop transitions, 12 changer transitions 5/55 dead transitions. [2025-03-04 10:11:50,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 402 flow [2025-03-04 10:11:50,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:50,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2025-03-04 10:11:50,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-03-04 10:11:50,032 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 194 flow. Second operand 7 states and 82 transitions. [2025-03-04 10:11:50,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 402 flow [2025-03-04 10:11:50,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 377 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:11:50,034 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 239 flow [2025-03-04 10:11:50,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2025-03-04 10:11:50,035 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-03-04 10:11:50,035 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 239 flow [2025-03-04 10:11:50,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:50,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:50,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:50,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:11:50,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:50,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1071181635, now seen corresponding path program 5 times [2025-03-04 10:11:50,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:50,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570278656] [2025-03-04 10:11:50,038 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:50,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:50,043 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:50,048 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:50,048 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:50,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:50,187 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:11:50,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570278656] [2025-03-04 10:11:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570278656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050952292] [2025-03-04 10:11:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:50,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:50,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:50,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:50,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:50,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:50,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:50,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,271 INFO L124 PetriNetUnfolderBase]: 89/189 cut-off events. [2025-03-04 10:11:50,271 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-03-04 10:11:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 189 events. 89/189 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 664 event pairs, 28 based on Foata normal form. 1/183 useless extension candidates. Maximal degree in co-relation 646. Up to 114 conditions per place. [2025-03-04 10:11:50,273 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 28 selfloop transitions, 13 changer transitions 8/51 dead transitions. [2025-03-04 10:11:50,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 402 flow [2025-03-04 10:11:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-03-04 10:11:50,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-04 10:11:50,274 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 239 flow. Second operand 7 states and 78 transitions. [2025-03-04 10:11:50,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 402 flow [2025-03-04 10:11:50,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 378 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:50,282 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 232 flow [2025-03-04 10:11:50,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2025-03-04 10:11:50,283 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2025-03-04 10:11:50,283 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 232 flow [2025-03-04 10:11:50,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:50,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:50,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:50,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:11:50,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:50,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:50,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1097659231, now seen corresponding path program 6 times [2025-03-04 10:11:50,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:50,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893977576] [2025-03-04 10:11:50,286 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:50,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:50,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:11:50,308 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:11:50,308 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:11:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:50,460 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:11:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:50,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893977576] [2025-03-04 10:11:50,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893977576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:50,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:50,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:50,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734597862] [2025-03-04 10:11:50,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:50,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:50,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:50,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:50,469 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 10:11:50,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:50,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:50,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 10:11:50,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,557 INFO L124 PetriNetUnfolderBase]: 83/166 cut-off events. [2025-03-04 10:11:50,558 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2025-03-04 10:11:50,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 166 events. 83/166 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 513 event pairs, 27 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 558. Up to 114 conditions per place. [2025-03-04 10:11:50,560 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 22 selfloop transitions, 13 changer transitions 7/44 dead transitions. [2025-03-04 10:11:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 349 flow [2025-03-04 10:11:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:50,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2025-03-04 10:11:50,562 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-03-04 10:11:50,562 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 232 flow. Second operand 7 states and 72 transitions. [2025-03-04 10:11:50,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 349 flow [2025-03-04 10:11:50,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 307 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-04 10:11:50,564 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 210 flow [2025-03-04 10:11:50,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2025-03-04 10:11:50,566 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2025-03-04 10:11:50,566 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 210 flow [2025-03-04 10:11:50,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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:11:50,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:50,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:50,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:11:50,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:50,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:50,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1178779024, now seen corresponding path program 1 times [2025-03-04 10:11:50,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:50,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523300190] [2025-03-04 10:11:50,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:50,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:50,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:50,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:50,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:50,740 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:11:50,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:50,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523300190] [2025-03-04 10:11:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523300190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:50,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811309889] [2025-03-04 10:11:50,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:50,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:50,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:50,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:50,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:50,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 210 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:50,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:50,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:50,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:50,903 INFO L124 PetriNetUnfolderBase]: 177/327 cut-off events. [2025-03-04 10:11:50,903 INFO L125 PetriNetUnfolderBase]: For 307/307 co-relation queries the response was YES. [2025-03-04 10:11:50,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 327 events. 177/327 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1195 event pairs, 2 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 948. Up to 151 conditions per place. [2025-03-04 10:11:50,905 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 57 selfloop transitions, 19 changer transitions 4/81 dead transitions. [2025-03-04 10:11:50,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 537 flow [2025-03-04 10:11:50,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:50,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2025-03-04 10:11:50,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2025-03-04 10:11:50,907 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 210 flow. Second operand 10 states and 112 transitions. [2025-03-04 10:11:50,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 537 flow [2025-03-04 10:11:50,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 489 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:50,909 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 271 flow [2025-03-04 10:11:50,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=271, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2025-03-04 10:11:50,909 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2025-03-04 10:11:50,909 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 271 flow [2025-03-04 10:11:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:50,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:50,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:50,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:11:50,911 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:50,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:50,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1507177970, now seen corresponding path program 2 times [2025-03-04 10:11:50,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:50,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163347324] [2025-03-04 10:11:50,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:50,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:50,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:50,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:50,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:50,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:51,093 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:11:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163347324] [2025-03-04 10:11:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163347324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:51,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:51,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530102522] [2025-03-04 10:11:51,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:51,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:51,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:51,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:51,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:51,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:51,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:51,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:51,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:51,252 INFO L124 PetriNetUnfolderBase]: 187/347 cut-off events. [2025-03-04 10:11:51,253 INFO L125 PetriNetUnfolderBase]: For 491/491 co-relation queries the response was YES. [2025-03-04 10:11:51,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 347 events. 187/347 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1265 event pairs, 40 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 1217. Up to 241 conditions per place. [2025-03-04 10:11:51,255 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 49 selfloop transitions, 19 changer transitions 4/73 dead transitions. [2025-03-04 10:11:51,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 547 flow [2025-03-04 10:11:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:51,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2025-03-04 10:11:51,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2025-03-04 10:11:51,257 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 271 flow. Second operand 10 states and 98 transitions. [2025-03-04 10:11:51,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 547 flow [2025-03-04 10:11:51,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 531 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:51,259 INFO L231 Difference]: Finished difference. Result has 62 places, 47 transitions, 356 flow [2025-03-04 10:11:51,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=356, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2025-03-04 10:11:51,260 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2025-03-04 10:11:51,260 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 356 flow [2025-03-04 10:11:51,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:51,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:51,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:51,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:11:51,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:51,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:51,261 INFO L85 PathProgramCache]: Analyzing trace with hash 103911092, now seen corresponding path program 3 times [2025-03-04 10:11:51,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:51,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934673311] [2025-03-04 10:11:51,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:51,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:51,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:51,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:51,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:51,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:51,448 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:11:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934673311] [2025-03-04 10:11:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934673311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544061343] [2025-03-04 10:11:51,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:51,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:51,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:51,450 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:11:51,452 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:11:51,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:51,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:51,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:51,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:51,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:51,693 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:11:51,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:51,875 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:11:51,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544061343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:51,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:51,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-03-04 10:11:51,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212328080] [2025-03-04 10:11:51,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:51,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:11:51,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:51,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:11:51,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:11:51,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:51,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 47 transitions, 356 flow. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 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:11:51,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:51,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:51,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:53,479 INFO L124 PetriNetUnfolderBase]: 518/974 cut-off events. [2025-03-04 10:11:53,479 INFO L125 PetriNetUnfolderBase]: For 1360/1360 co-relation queries the response was YES. [2025-03-04 10:11:53,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 974 events. 518/974 cut-off events. For 1360/1360 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4775 event pairs, 14 based on Foata normal form. 24/998 useless extension candidates. Maximal degree in co-relation 3252. Up to 184 conditions per place. [2025-03-04 10:11:53,487 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 168 selfloop transitions, 144 changer transitions 8/321 dead transitions. [2025-03-04 10:11:53,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 321 transitions, 2135 flow [2025-03-04 10:11:53,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-04 10:11:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-04 10:11:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 551 transitions. [2025-03-04 10:11:53,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3891242937853107 [2025-03-04 10:11:53,491 INFO L175 Difference]: Start difference. First operand has 62 places, 47 transitions, 356 flow. Second operand 59 states and 551 transitions. [2025-03-04 10:11:53,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 321 transitions, 2135 flow [2025-03-04 10:11:53,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 321 transitions, 2059 flow, removed 15 selfloop flow, removed 6 redundant places. [2025-03-04 10:11:53,504 INFO L231 Difference]: Finished difference. Result has 133 places, 174 transitions, 1405 flow [2025-03-04 10:11:53,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=1405, PETRI_PLACES=133, PETRI_TRANSITIONS=174} [2025-03-04 10:11:53,505 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 107 predicate places. [2025-03-04 10:11:53,506 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 174 transitions, 1405 flow [2025-03-04 10:11:53,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 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:11:53,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:53,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:53,513 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:11:53,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:53,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:53,708 INFO L85 PathProgramCache]: Analyzing trace with hash 214733612, now seen corresponding path program 4 times [2025-03-04 10:11:53,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:53,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594833942] [2025-03-04 10:11:53,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:53,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:53,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:53,715 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:53,715 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:53,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,857 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:11:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594833942] [2025-03-04 10:11:53,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594833942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:53,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696611344] [2025-03-04 10:11:53,858 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:53,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:53,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:53,860 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:11:53,861 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:11:53,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:53,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:53,896 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:53,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:53,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:53,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:54,045 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:11:54,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:54,188 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:11:54,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696611344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:54,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:54,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:11:54,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229102052] [2025-03-04 10:11:54,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:54,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:11:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:54,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:11:54,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:11:54,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:54,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 174 transitions, 1405 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:54,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:54,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:54,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:55,069 INFO L124 PetriNetUnfolderBase]: 639/1201 cut-off events. [2025-03-04 10:11:55,069 INFO L125 PetriNetUnfolderBase]: For 5895/5895 co-relation queries the response was YES. [2025-03-04 10:11:55,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 1201 events. 639/1201 cut-off events. For 5895/5895 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6114 event pairs, 32 based on Foata normal form. 2/1203 useless extension candidates. Maximal degree in co-relation 5592. Up to 361 conditions per place. [2025-03-04 10:11:55,078 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 158 selfloop transitions, 178 changer transitions 8/345 dead transitions. [2025-03-04 10:11:55,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 345 transitions, 3249 flow [2025-03-04 10:11:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:11:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-04 10:11:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 355 transitions. [2025-03-04 10:11:55,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3997747747747748 [2025-03-04 10:11:55,080 INFO L175 Difference]: Start difference. First operand has 133 places, 174 transitions, 1405 flow. Second operand 37 states and 355 transitions. [2025-03-04 10:11:55,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 345 transitions, 3249 flow [2025-03-04 10:11:55,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 345 transitions, 2619 flow, removed 217 selfloop flow, removed 16 redundant places. [2025-03-04 10:11:55,104 INFO L231 Difference]: Finished difference. Result has 163 places, 245 transitions, 1941 flow [2025-03-04 10:11:55,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1941, PETRI_PLACES=163, PETRI_TRANSITIONS=245} [2025-03-04 10:11:55,105 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 137 predicate places. [2025-03-04 10:11:55,105 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 245 transitions, 1941 flow [2025-03-04 10:11:55,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:55,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:55,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:55,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:55,305 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,SelfDestructingSolverStorable9 [2025-03-04 10:11:55,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:55,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1746820308, now seen corresponding path program 5 times [2025-03-04 10:11:55,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:55,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582349668] [2025-03-04 10:11:55,306 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:55,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:55,309 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:55,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:55,311 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:55,419 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:11:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582349668] [2025-03-04 10:11:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582349668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:55,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:55,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:55,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116898015] [2025-03-04 10:11:55,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:55,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:55,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:55,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:55,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 245 transitions, 1941 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:55,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:55,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:55,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:55,621 INFO L124 PetriNetUnfolderBase]: 645/1213 cut-off events. [2025-03-04 10:11:55,621 INFO L125 PetriNetUnfolderBase]: For 6948/6948 co-relation queries the response was YES. [2025-03-04 10:11:55,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5846 conditions, 1213 events. 645/1213 cut-off events. For 6948/6948 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6189 event pairs, 77 based on Foata normal form. 1/1212 useless extension candidates. Maximal degree in co-relation 5520. Up to 1122 conditions per place. [2025-03-04 10:11:55,629 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 245 selfloop transitions, 19 changer transitions 4/269 dead transitions. [2025-03-04 10:11:55,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 269 transitions, 2615 flow [2025-03-04 10:11:55,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2025-03-04 10:11:55,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-04 10:11:55,630 INFO L175 Difference]: Start difference. First operand has 163 places, 245 transitions, 1941 flow. Second operand 10 states and 90 transitions. [2025-03-04 10:11:55,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 269 transitions, 2615 flow [2025-03-04 10:11:55,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 269 transitions, 2541 flow, removed 18 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:55,656 INFO L231 Difference]: Finished difference. Result has 167 places, 250 transitions, 1981 flow [2025-03-04 10:11:55,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1981, PETRI_PLACES=167, PETRI_TRANSITIONS=250} [2025-03-04 10:11:55,660 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 141 predicate places. [2025-03-04 10:11:55,660 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 250 transitions, 1981 flow [2025-03-04 10:11:55,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:55,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:55,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:11:55,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:55,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:55,660 INFO L85 PathProgramCache]: Analyzing trace with hash -17772974, now seen corresponding path program 6 times [2025-03-04 10:11:55,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:55,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875582992] [2025-03-04 10:11:55,660 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:11:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:55,663 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:55,669 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:55,669 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 10:11:55,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:55,784 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:11:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875582992] [2025-03-04 10:11:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875582992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334493629] [2025-03-04 10:11:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:55,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 250 transitions, 1981 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:55,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:55,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:55,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:56,019 INFO L124 PetriNetUnfolderBase]: 656/1234 cut-off events. [2025-03-04 10:11:56,020 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2025-03-04 10:11:56,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 1234 events. 656/1234 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6307 event pairs, 77 based on Foata normal form. 1/1233 useless extension candidates. Maximal degree in co-relation 5869. Up to 1137 conditions per place. [2025-03-04 10:11:56,026 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 249 selfloop transitions, 23 changer transitions 4/277 dead transitions. [2025-03-04 10:11:56,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 277 transitions, 2670 flow [2025-03-04 10:11:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:11:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:11:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 99 transitions. [2025-03-04 10:11:56,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-04 10:11:56,028 INFO L175 Difference]: Start difference. First operand has 167 places, 250 transitions, 1981 flow. Second operand 11 states and 99 transitions. [2025-03-04 10:11:56,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 277 transitions, 2670 flow [2025-03-04 10:11:56,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 277 transitions, 2638 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 10:11:56,050 INFO L231 Difference]: Finished difference. Result has 175 places, 256 transitions, 2069 flow [2025-03-04 10:11:56,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=1949, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2069, PETRI_PLACES=175, PETRI_TRANSITIONS=256} [2025-03-04 10:11:56,051 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 149 predicate places. [2025-03-04 10:11:56,051 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 256 transitions, 2069 flow [2025-03-04 10:11:56,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:56,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:56,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:11:56,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:56,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1735522034, now seen corresponding path program 7 times [2025-03-04 10:11:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:56,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693041876] [2025-03-04 10:11:56,052 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:11:56,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:56,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:56,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:56,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:56,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,183 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:11:56,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:56,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693041876] [2025-03-04 10:11:56,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693041876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:56,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:56,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:56,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962075730] [2025-03-04 10:11:56,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:56,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:56,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:56,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:56,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:56,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:56,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 256 transitions, 2069 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:56,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:56,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:56,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:56,413 INFO L124 PetriNetUnfolderBase]: 689/1290 cut-off events. [2025-03-04 10:11:56,413 INFO L125 PetriNetUnfolderBase]: For 7015/7015 co-relation queries the response was YES. [2025-03-04 10:11:56,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6223 conditions, 1290 events. 689/1290 cut-off events. For 7015/7015 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6652 event pairs, 77 based on Foata normal form. 1/1287 useless extension candidates. Maximal degree in co-relation 6166. Up to 1157 conditions per place. [2025-03-04 10:11:56,423 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 260 selfloop transitions, 32 changer transitions 4/297 dead transitions. [2025-03-04 10:11:56,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 297 transitions, 2897 flow [2025-03-04 10:11:56,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:11:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:11:56,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 106 transitions. [2025-03-04 10:11:56,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-04 10:11:56,425 INFO L175 Difference]: Start difference. First operand has 175 places, 256 transitions, 2069 flow. Second operand 11 states and 106 transitions. [2025-03-04 10:11:56,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 297 transitions, 2897 flow [2025-03-04 10:11:56,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 297 transitions, 2852 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:56,454 INFO L231 Difference]: Finished difference. Result has 180 places, 266 transitions, 2208 flow [2025-03-04 10:11:56,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2024, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2208, PETRI_PLACES=180, PETRI_TRANSITIONS=266} [2025-03-04 10:11:56,456 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 154 predicate places. [2025-03-04 10:11:56,456 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 266 transitions, 2208 flow [2025-03-04 10:11:56,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:56,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:56,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:56,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:11:56,457 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:56,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2131023562, now seen corresponding path program 8 times [2025-03-04 10:11:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378955507] [2025-03-04 10:11:56,457 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:56,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:56,460 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:11:56,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:56,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:56,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,616 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:11:56,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:56,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378955507] [2025-03-04 10:11:56,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378955507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:56,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:56,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:56,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939966326] [2025-03-04 10:11:56,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:56,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:56,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:56,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:56,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:56,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:56,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 266 transitions, 2208 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:56,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:56,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:56,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:56,832 INFO L124 PetriNetUnfolderBase]: 693/1302 cut-off events. [2025-03-04 10:11:56,832 INFO L125 PetriNetUnfolderBase]: For 7203/7203 co-relation queries the response was YES. [2025-03-04 10:11:56,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 1302 events. 693/1302 cut-off events. For 7203/7203 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6731 event pairs, 79 based on Foata normal form. 1/1299 useless extension candidates. Maximal degree in co-relation 6302. Up to 1204 conditions per place. [2025-03-04 10:11:56,841 INFO L140 encePairwiseOnDemand]: 14/24 looper letters, 257 selfloop transitions, 25 changer transitions 4/287 dead transitions. [2025-03-04 10:11:56,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 287 transitions, 2888 flow [2025-03-04 10:11:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:11:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:11:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2025-03-04 10:11:56,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2025-03-04 10:11:56,842 INFO L175 Difference]: Start difference. First operand has 180 places, 266 transitions, 2208 flow. Second operand 11 states and 98 transitions. [2025-03-04 10:11:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 287 transitions, 2888 flow [2025-03-04 10:11:56,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 287 transitions, 2828 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 10:11:56,867 INFO L231 Difference]: Finished difference. Result has 184 places, 269 transitions, 2246 flow [2025-03-04 10:11:56,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2246, PETRI_PLACES=184, PETRI_TRANSITIONS=269} [2025-03-04 10:11:56,867 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 158 predicate places. [2025-03-04 10:11:56,867 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 269 transitions, 2246 flow [2025-03-04 10:11:56,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:56,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:56,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:11:56,868 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:56,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash -169478578, now seen corresponding path program 9 times [2025-03-04 10:11:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:56,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527431181] [2025-03-04 10:11:56,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:56,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:56,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:56,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:56,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:56,978 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:11:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527431181] [2025-03-04 10:11:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527431181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006865329] [2025-03-04 10:11:56,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:56,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:56,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:56,981 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:11:56,983 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:11:57,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:57,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:57,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:57,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:57,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:57,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:57,159 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:11:57,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:57,281 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:11:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006865329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:57,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:57,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:11:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085162691] [2025-03-04 10:11:57,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:57,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:11:57,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:57,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:11:57,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:11:57,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:57,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 269 transitions, 2246 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:57,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:57,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:57,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:57,691 INFO L124 PetriNetUnfolderBase]: 752/1425 cut-off events. [2025-03-04 10:11:57,691 INFO L125 PetriNetUnfolderBase]: For 7636/7636 co-relation queries the response was YES. [2025-03-04 10:11:57,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 1425 events. 752/1425 cut-off events. For 7636/7636 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7663 event pairs, 59 based on Foata normal form. 2/1423 useless extension candidates. Maximal degree in co-relation 6831. Up to 970 conditions per place. [2025-03-04 10:11:57,701 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 154 selfloop transitions, 176 changer transitions 8/339 dead transitions. [2025-03-04 10:11:57,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 339 transitions, 3361 flow [2025-03-04 10:11:57,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:11:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:11:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 156 transitions. [2025-03-04 10:11:57,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2025-03-04 10:11:57,702 INFO L175 Difference]: Start difference. First operand has 184 places, 269 transitions, 2246 flow. Second operand 18 states and 156 transitions. [2025-03-04 10:11:57,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 339 transitions, 3361 flow [2025-03-04 10:11:57,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 339 transitions, 3300 flow, removed 12 selfloop flow, removed 7 redundant places. [2025-03-04 10:11:57,732 INFO L231 Difference]: Finished difference. Result has 201 places, 305 transitions, 3172 flow [2025-03-04 10:11:57,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3172, PETRI_PLACES=201, PETRI_TRANSITIONS=305} [2025-03-04 10:11:57,733 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 175 predicate places. [2025-03-04 10:11:57,733 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 305 transitions, 3172 flow [2025-03-04 10:11:57,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:57,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:57,733 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:57,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:11:57,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:57,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:57,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash 401976228, now seen corresponding path program 10 times [2025-03-04 10:11:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:57,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319746384] [2025-03-04 10:11:57,934 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:57,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:57,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:57,939 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:58,059 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:11:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319746384] [2025-03-04 10:11:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319746384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:58,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:58,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:11:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755024796] [2025-03-04 10:11:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:11:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:58,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:11:58,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:11:58,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:58,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 305 transitions, 3172 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:58,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:58,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:58,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:58,304 INFO L124 PetriNetUnfolderBase]: 754/1429 cut-off events. [2025-03-04 10:11:58,304 INFO L125 PetriNetUnfolderBase]: For 9045/9045 co-relation queries the response was YES. [2025-03-04 10:11:58,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7908 conditions, 1429 events. 754/1429 cut-off events. For 9045/9045 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7700 event pairs, 82 based on Foata normal form. 1/1430 useless extension candidates. Maximal degree in co-relation 7843. Up to 1337 conditions per place. [2025-03-04 10:11:58,319 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 297 selfloop transitions, 21 changer transitions 4/323 dead transitions. [2025-03-04 10:11:58,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 323 transitions, 3924 flow [2025-03-04 10:11:58,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2025-03-04 10:11:58,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37083333333333335 [2025-03-04 10:11:58,320 INFO L175 Difference]: Start difference. First operand has 201 places, 305 transitions, 3172 flow. Second operand 10 states and 89 transitions. [2025-03-04 10:11:58,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 323 transitions, 3924 flow [2025-03-04 10:11:58,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 323 transitions, 3774 flow, removed 12 selfloop flow, removed 12 redundant places. [2025-03-04 10:11:58,363 INFO L231 Difference]: Finished difference. Result has 199 places, 307 transitions, 3111 flow [2025-03-04 10:11:58,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3022, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3111, PETRI_PLACES=199, PETRI_TRANSITIONS=307} [2025-03-04 10:11:58,364 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 173 predicate places. [2025-03-04 10:11:58,364 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 307 transitions, 3111 flow [2025-03-04 10:11:58,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:11:58,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:58,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:58,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:11:58,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:11:58,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:58,365 INFO L85 PathProgramCache]: Analyzing trace with hash 413274502, now seen corresponding path program 11 times [2025-03-04 10:11:58,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:58,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658964998] [2025-03-04 10:11:58,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:58,368 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:58,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:58,370 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:58,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:58,489 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:11:58,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658964998] [2025-03-04 10:11:58,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658964998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:58,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318022997] [2025-03-04 10:11:58,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:58,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:58,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:58,492 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:11:58,494 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:11:58,518 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:11:58,526 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:11:58,526 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:58,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:58,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:11:58,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:58,708 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:11:58,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:58,850 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:11:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318022997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:58,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:11:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442484] [2025-03-04 10:11:58,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:58,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:11:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:58,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:11:58,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:11:58,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:11:58,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 307 transitions, 3111 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:11:58,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:58,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:11:58,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:00,252 INFO L124 PetriNetUnfolderBase]: 1036/1978 cut-off events. [2025-03-04 10:12:00,252 INFO L125 PetriNetUnfolderBase]: For 12918/12918 co-relation queries the response was YES. [2025-03-04 10:12:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10652 conditions, 1978 events. 1036/1978 cut-off events. For 12918/12918 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11862 event pairs, 49 based on Foata normal form. 3/1981 useless extension candidates. Maximal degree in co-relation 10585. Up to 809 conditions per place. [2025-03-04 10:12:00,265 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 233 selfloop transitions, 307 changer transitions 13/554 dead transitions. [2025-03-04 10:12:00,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 554 transitions, 5992 flow [2025-03-04 10:12:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-04 10:12:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-04 10:12:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 478 transitions. [2025-03-04 10:12:00,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34941520467836257 [2025-03-04 10:12:00,267 INFO L175 Difference]: Start difference. First operand has 199 places, 307 transitions, 3111 flow. Second operand 57 states and 478 transitions. [2025-03-04 10:12:00,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 554 transitions, 5992 flow [2025-03-04 10:12:00,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 554 transitions, 5936 flow, removed 9 selfloop flow, removed 7 redundant places. [2025-03-04 10:12:00,322 INFO L231 Difference]: Finished difference. Result has 267 places, 441 transitions, 5406 flow [2025-03-04 10:12:00,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=3047, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=5406, PETRI_PLACES=267, PETRI_TRANSITIONS=441} [2025-03-04 10:12:00,323 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 241 predicate places. [2025-03-04 10:12:00,323 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 441 transitions, 5406 flow [2025-03-04 10:12:00,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:00,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:00,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:00,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:12:00,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:12:00,524 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:00,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1493977900, now seen corresponding path program 12 times [2025-03-04 10:12:00,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:00,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478675802] [2025-03-04 10:12:00,525 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:00,527 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:00,529 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:00,529 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:12:00,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:00,622 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:12:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478675802] [2025-03-04 10:12:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478675802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119166697] [2025-03-04 10:12:00,623 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:00,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:00,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:00,625 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:12:00,632 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:12:00,660 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:00,667 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:00,667 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 10:12:00,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:00,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:00,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:00,792 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:12:00,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:00,887 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:12:00,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119166697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:00,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:00,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:12:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277739976] [2025-03-04 10:12:00,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:12:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:00,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:12:00,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:12:00,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:00,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 441 transitions, 5406 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:00,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:00,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:00,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:01,383 INFO L124 PetriNetUnfolderBase]: 1041/1991 cut-off events. [2025-03-04 10:12:01,384 INFO L125 PetriNetUnfolderBase]: For 23109/23109 co-relation queries the response was YES. [2025-03-04 10:12:01,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13047 conditions, 1991 events. 1041/1991 cut-off events. For 23109/23109 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12006 event pairs, 62 based on Foata normal form. 2/1993 useless extension candidates. Maximal degree in co-relation 12900. Up to 1328 conditions per place. [2025-03-04 10:12:01,394 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 234 selfloop transitions, 242 changer transitions 8/485 dead transitions. [2025-03-04 10:12:01,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 485 transitions, 6679 flow [2025-03-04 10:12:01,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:12:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:12:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 158 transitions. [2025-03-04 10:12:01,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34649122807017546 [2025-03-04 10:12:01,396 INFO L175 Difference]: Start difference. First operand has 267 places, 441 transitions, 5406 flow. Second operand 19 states and 158 transitions. [2025-03-04 10:12:01,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 485 transitions, 6679 flow [2025-03-04 10:12:01,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 485 transitions, 6284 flow, removed 137 selfloop flow, removed 16 redundant places. [2025-03-04 10:12:01,517 INFO L231 Difference]: Finished difference. Result has 273 places, 452 transitions, 5941 flow [2025-03-04 10:12:01,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5017, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5941, PETRI_PLACES=273, PETRI_TRANSITIONS=452} [2025-03-04 10:12:01,518 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 247 predicate places. [2025-03-04 10:12:01,518 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 452 transitions, 5941 flow [2025-03-04 10:12:01,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:01,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:01,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:01,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:12:01,718 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,SelfDestructingSolverStorable17 [2025-03-04 10:12:01,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:01,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:01,719 INFO L85 PathProgramCache]: Analyzing trace with hash 418266744, now seen corresponding path program 13 times [2025-03-04 10:12:01,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:01,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297524590] [2025-03-04 10:12:01,719 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:01,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:12:01,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:01,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:01,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:01,820 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:12:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297524590] [2025-03-04 10:12:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297524590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371946167] [2025-03-04 10:12:01,821 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:01,824 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:12:01,825 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:12:01,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:12:01,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:01,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:01,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:01,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:01,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:01,971 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:12:01,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:02,064 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:12:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371946167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:02,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:12:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034704422] [2025-03-04 10:12:02,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:02,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:12:02,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:02,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:12:02,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:12:02,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:02,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 452 transitions, 5941 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:02,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:02,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:02,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:02,638 INFO L124 PetriNetUnfolderBase]: 1047/2009 cut-off events. [2025-03-04 10:12:02,639 INFO L125 PetriNetUnfolderBase]: For 23329/23329 co-relation queries the response was YES. [2025-03-04 10:12:02,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13500 conditions, 2009 events. 1047/2009 cut-off events. For 23329/23329 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12180 event pairs, 62 based on Foata normal form. 2/2011 useless extension candidates. Maximal degree in co-relation 13413. Up to 1340 conditions per place. [2025-03-04 10:12:02,652 INFO L140 encePairwiseOnDemand]: 13/24 looper letters, 222 selfloop transitions, 267 changer transitions 8/498 dead transitions. [2025-03-04 10:12:02,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 498 transitions, 7235 flow [2025-03-04 10:12:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 10:12:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 10:12:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 201 transitions. [2025-03-04 10:12:02,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.335 [2025-03-04 10:12:02,654 INFO L175 Difference]: Start difference. First operand has 273 places, 452 transitions, 5941 flow. Second operand 25 states and 201 transitions. [2025-03-04 10:12:02,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 498 transitions, 7235 flow [2025-03-04 10:12:02,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 498 transitions, 7188 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-04 10:12:02,769 INFO L231 Difference]: Finished difference. Result has 297 places, 458 transitions, 6857 flow [2025-03-04 10:12:02,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=5895, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=6857, PETRI_PLACES=297, PETRI_TRANSITIONS=458} [2025-03-04 10:12:02,770 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 271 predicate places. [2025-03-04 10:12:02,770 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 458 transitions, 6857 flow [2025-03-04 10:12:02,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:02,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:02,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:02,777 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:12:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:02,975 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash 989721550, now seen corresponding path program 14 times [2025-03-04 10:12:02,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:02,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549625246] [2025-03-04 10:12:02,975 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:02,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:12:02,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:02,979 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:12:02,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:03,096 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:12:03,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:03,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549625246] [2025-03-04 10:12:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549625246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:12:03,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032749367] [2025-03-04 10:12:03,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:03,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:12:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:03,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:12:03,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:12:03,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:03,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 458 transitions, 6857 flow. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:12:03,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:03,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:03,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:03,389 INFO L124 PetriNetUnfolderBase]: 1049/2013 cut-off events. [2025-03-04 10:12:03,389 INFO L125 PetriNetUnfolderBase]: For 27956/27956 co-relation queries the response was YES. [2025-03-04 10:12:03,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14655 conditions, 2013 events. 1049/2013 cut-off events. For 27956/27956 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12170 event pairs, 109 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 14563. Up to 1914 conditions per place. [2025-03-04 10:12:03,403 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 445 selfloop transitions, 24 changer transitions 4/474 dead transitions. [2025-03-04 10:12:03,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 474 transitions, 7936 flow [2025-03-04 10:12:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:12:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:12:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2025-03-04 10:12:03,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3625 [2025-03-04 10:12:03,404 INFO L175 Difference]: Start difference. First operand has 297 places, 458 transitions, 6857 flow. Second operand 10 states and 87 transitions. [2025-03-04 10:12:03,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 474 transitions, 7936 flow [2025-03-04 10:12:03,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 474 transitions, 7502 flow, removed 24 selfloop flow, removed 17 redundant places. [2025-03-04 10:12:03,561 INFO L231 Difference]: Finished difference. Result has 290 places, 460 transitions, 6537 flow [2025-03-04 10:12:03,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6423, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6537, PETRI_PLACES=290, PETRI_TRANSITIONS=460} [2025-03-04 10:12:03,562 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 264 predicate places. [2025-03-04 10:12:03,562 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 460 transitions, 6537 flow [2025-03-04 10:12:03,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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:12:03,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:03,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:03,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:12:03,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:03,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash 890197304, now seen corresponding path program 15 times [2025-03-04 10:12:03,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:03,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155759676] [2025-03-04 10:12:03,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:03,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:03,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:03,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:03,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:03,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:03,676 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:12:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155759676] [2025-03-04 10:12:03,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155759676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:03,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49770298] [2025-03-04 10:12:03,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:03,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:03,679 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:12:03,680 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:12:03,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:03,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:03,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:03,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:03,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:03,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:03,824 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:12:03,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:03,930 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:12:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49770298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:03,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:12:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239230128] [2025-03-04 10:12:03,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:12:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:12:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:12:03,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:03,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 460 transitions, 6537 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:03,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:03,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:03,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:05,162 INFO L124 PetriNetUnfolderBase]: 1282/2452 cut-off events. [2025-03-04 10:12:05,162 INFO L125 PetriNetUnfolderBase]: For 33757/33757 co-relation queries the response was YES. [2025-03-04 10:12:05,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17353 conditions, 2452 events. 1282/2452 cut-off events. For 33757/33757 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15418 event pairs, 66 based on Foata normal form. 6/2458 useless extension candidates. Maximal degree in co-relation 17260. Up to 996 conditions per place. [2025-03-04 10:12:05,177 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 251 selfloop transitions, 426 changer transitions 12/690 dead transitions. [2025-03-04 10:12:05,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 690 transitions, 10609 flow [2025-03-04 10:12:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:12:05,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 10:12:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 426 transitions. [2025-03-04 10:12:05,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2025-03-04 10:12:05,179 INFO L175 Difference]: Start difference. First operand has 290 places, 460 transitions, 6537 flow. Second operand 48 states and 426 transitions. [2025-03-04 10:12:05,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 690 transitions, 10609 flow [2025-03-04 10:12:05,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 690 transitions, 10481 flow, removed 13 selfloop flow, removed 9 redundant places. [2025-03-04 10:12:05,325 INFO L231 Difference]: Finished difference. Result has 347 places, 588 transitions, 9840 flow [2025-03-04 10:12:05,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=6422, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=9840, PETRI_PLACES=347, PETRI_TRANSITIONS=588} [2025-03-04 10:12:05,325 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 321 predicate places. [2025-03-04 10:12:05,325 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 588 transitions, 9840 flow [2025-03-04 10:12:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:05,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:05,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:05,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:12:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:05,526 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:05,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:05,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1001019824, now seen corresponding path program 16 times [2025-03-04 10:12:05,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598182445] [2025-03-04 10:12:05,530 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:05,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:05,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:05,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:12:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:05,633 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:12:05,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598182445] [2025-03-04 10:12:05,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598182445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:05,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767618666] [2025-03-04 10:12:05,634 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:05,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:05,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:05,636 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:12:05,638 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:12:05,661 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:12:05,669 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:12:05,669 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:12:05,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:05,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:12:05,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:05,804 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:12:05,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:05,911 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:12:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767618666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:05,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-04 10:12:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640997057] [2025-03-04 10:12:05,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:05,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:12:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:05,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:12:05,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:12:05,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:05,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 588 transitions, 9840 flow. Second operand has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:05,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:05,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:05,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:07,141 INFO L124 PetriNetUnfolderBase]: 1278/2446 cut-off events. [2025-03-04 10:12:07,141 INFO L125 PetriNetUnfolderBase]: For 53236/53236 co-relation queries the response was YES. [2025-03-04 10:12:07,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20061 conditions, 2446 events. 1278/2446 cut-off events. For 53236/53236 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15356 event pairs, 65 based on Foata normal form. 3/2449 useless extension candidates. Maximal degree in co-relation 19948. Up to 1123 conditions per place. [2025-03-04 10:12:07,158 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 229 selfloop transitions, 439 changer transitions 9/678 dead transitions. [2025-03-04 10:12:07,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 678 transitions, 11942 flow [2025-03-04 10:12:07,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-04 10:12:07,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-04 10:12:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 404 transitions. [2025-03-04 10:12:07,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3435374149659864 [2025-03-04 10:12:07,160 INFO L175 Difference]: Start difference. First operand has 347 places, 588 transitions, 9840 flow. Second operand 49 states and 404 transitions. [2025-03-04 10:12:07,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 678 transitions, 11942 flow [2025-03-04 10:12:07,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 678 transitions, 11379 flow, removed 237 selfloop flow, removed 16 redundant places. [2025-03-04 10:12:07,418 INFO L231 Difference]: Finished difference. Result has 380 places, 604 transitions, 10715 flow [2025-03-04 10:12:07,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9295, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=10715, PETRI_PLACES=380, PETRI_TRANSITIONS=604} [2025-03-04 10:12:07,419 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 354 predicate places. [2025-03-04 10:12:07,419 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 604 transitions, 10715 flow [2025-03-04 10:12:07,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.68) internal successors, (142), 25 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:07,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:07,419 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:07,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:12:07,620 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,SelfDestructingSolverStorable21 [2025-03-04 10:12:07,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:07,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:07,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1440820973, now seen corresponding path program 17 times [2025-03-04 10:12:07,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:07,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606048054] [2025-03-04 10:12:07,621 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:07,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:07,623 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:07,625 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:07,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:07,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:07,757 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:12:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606048054] [2025-03-04 10:12:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606048054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20454836] [2025-03-04 10:12:07,757 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:07,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:07,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:07,759 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:12:07,760 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:12:07,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:07,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:07,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:07,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:07,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:07,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:07,968 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:12:07,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:08,161 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:12:08,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20454836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:08,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:12:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184346631] [2025-03-04 10:12:08,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:08,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:12:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:08,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:12:08,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:12:08,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:08,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 604 transitions, 10715 flow. Second operand has 31 states, 31 states have (on average 5.67741935483871) internal successors, (176), 31 states have internal predecessors, (176), 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:12:08,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:08,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:08,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:11,815 INFO L124 PetriNetUnfolderBase]: 2784/5110 cut-off events. [2025-03-04 10:12:11,815 INFO L125 PetriNetUnfolderBase]: For 150363/150363 co-relation queries the response was YES. [2025-03-04 10:12:11,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45612 conditions, 5110 events. 2784/5110 cut-off events. For 150363/150363 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 34754 event pairs, 92 based on Foata normal form. 45/5155 useless extension candidates. Maximal degree in co-relation 45376. Up to 1038 conditions per place. [2025-03-04 10:12:11,859 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 446 selfloop transitions, 1046 changer transitions 23/1516 dead transitions. [2025-03-04 10:12:11,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 489 places, 1516 transitions, 28857 flow [2025-03-04 10:12:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-04 10:12:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2025-03-04 10:12:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 1026 transitions. [2025-03-04 10:12:11,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37831858407079644 [2025-03-04 10:12:11,860 INFO L175 Difference]: Start difference. First operand has 380 places, 604 transitions, 10715 flow. Second operand 113 states and 1026 transitions. [2025-03-04 10:12:11,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 489 places, 1516 transitions, 28857 flow [2025-03-04 10:12:12,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 1516 transitions, 28316 flow, removed 107 selfloop flow, removed 30 redundant places. [2025-03-04 10:12:12,718 INFO L231 Difference]: Finished difference. Result has 503 places, 1236 transitions, 25372 flow [2025-03-04 10:12:12,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=10313, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=480, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=25372, PETRI_PLACES=503, PETRI_TRANSITIONS=1236} [2025-03-04 10:12:12,719 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 477 predicate places. [2025-03-04 10:12:12,719 INFO L471 AbstractCegarLoop]: Abstraction has has 503 places, 1236 transitions, 25372 flow [2025-03-04 10:12:12,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.67741935483871) internal successors, (176), 31 states have internal predecessors, (176), 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:12:12,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:12,719 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:12:12,725 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:12:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:12,920 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1750356471, now seen corresponding path program 1 times [2025-03-04 10:12:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045300814] [2025-03-04 10:12:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:12,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:12:12,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:12,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:12,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:13,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045300814] [2025-03-04 10:12:13,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045300814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:13,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879867272] [2025-03-04 10:12:13,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:13,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:13,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:13,038 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:12:13,039 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:12:13,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:12:13,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:13,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:12:13,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:13,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879867272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:13,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-03-04 10:12:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443377652] [2025-03-04 10:12:13,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:13,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:12:13,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:13,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:12:13,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:12:13,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:13,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 1236 transitions, 25372 flow. Second operand has 33 states, 33 states have (on average 5.424242424242424) internal successors, (179), 33 states have internal predecessors, (179), 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:12:13,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:13,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:13,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:15,087 INFO L124 PetriNetUnfolderBase]: 2752/5068 cut-off events. [2025-03-04 10:12:15,088 INFO L125 PetriNetUnfolderBase]: For 295933/295933 co-relation queries the response was YES. [2025-03-04 10:12:15,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54280 conditions, 5068 events. 2752/5068 cut-off events. For 295933/295933 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 34558 event pairs, 98 based on Foata normal form. 33/5101 useless extension candidates. Maximal degree in co-relation 54115. Up to 2572 conditions per place. [2025-03-04 10:12:15,138 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 611 selfloop transitions, 660 changer transitions 19/1291 dead transitions. [2025-03-04 10:12:15,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 1291 transitions, 28693 flow [2025-03-04 10:12:15,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:12:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:12:15,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 227 transitions. [2025-03-04 10:12:15,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.411231884057971 [2025-03-04 10:12:15,139 INFO L175 Difference]: Start difference. First operand has 503 places, 1236 transitions, 25372 flow. Second operand 23 states and 227 transitions. [2025-03-04 10:12:15,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 1291 transitions, 28693 flow [2025-03-04 10:12:16,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 1291 transitions, 27473 flow, removed 533 selfloop flow, removed 22 redundant places. [2025-03-04 10:12:16,718 INFO L231 Difference]: Finished difference. Result has 502 places, 1221 transitions, 25865 flow [2025-03-04 10:12:16,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=23580, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=642, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=25865, PETRI_PLACES=502, PETRI_TRANSITIONS=1221} [2025-03-04 10:12:16,718 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 476 predicate places. [2025-03-04 10:12:16,719 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 1221 transitions, 25865 flow [2025-03-04 10:12:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.424242424242424) internal successors, (179), 33 states have internal predecessors, (179), 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:12:16,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:16,719 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:16,724 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:12:16,919 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,SelfDestructingSolverStorable23 [2025-03-04 10:12:16,919 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -152875977, now seen corresponding path program 18 times [2025-03-04 10:12:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026057448] [2025-03-04 10:12:16,920 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:16,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:16,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-03-04 10:12:16,924 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:16,924 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:12:16,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026057448] [2025-03-04 10:12:17,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026057448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:17,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708725385] [2025-03-04 10:12:17,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:12:17,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:17,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:17,061 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:12:17,063 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:12:17,088 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 3 equivalence classes. [2025-03-04 10:12:17,098 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:17,098 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:12:17,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:17,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:17,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:17,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708725385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:17,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:17,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:12:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978299170] [2025-03-04 10:12:17,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:17,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:12:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:17,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:12:17,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:12:17,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:17,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 1221 transitions, 25865 flow. Second operand has 31 states, 31 states have (on average 5.67741935483871) internal successors, (176), 31 states have internal predecessors, (176), 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:12:17,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:17,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:17,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:20,740 INFO L124 PetriNetUnfolderBase]: 3358/6214 cut-off events. [2025-03-04 10:12:20,740 INFO L125 PetriNetUnfolderBase]: For 371689/371689 co-relation queries the response was YES. [2025-03-04 10:12:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66569 conditions, 6214 events. 3358/6214 cut-off events. For 371689/371689 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 43826 event pairs, 163 based on Foata normal form. 3/6217 useless extension candidates. Maximal degree in co-relation 66282. Up to 2318 conditions per place. [2025-03-04 10:12:20,799 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 674 selfloop transitions, 1004 changer transitions 12/1691 dead transitions. [2025-03-04 10:12:20,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 1691 transitions, 37921 flow [2025-03-04 10:12:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 10:12:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-03-04 10:12:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 586 transitions. [2025-03-04 10:12:20,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39381720430107525 [2025-03-04 10:12:20,800 INFO L175 Difference]: Start difference. First operand has 502 places, 1221 transitions, 25865 flow. Second operand 62 states and 586 transitions. [2025-03-04 10:12:20,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 1691 transitions, 37921 flow [2025-03-04 10:12:22,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 1691 transitions, 37492 flow, removed 92 selfloop flow, removed 15 redundant places. [2025-03-04 10:12:22,406 INFO L231 Difference]: Finished difference. Result has 547 places, 1466 transitions, 33164 flow [2025-03-04 10:12:22,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=25571, PETRI_DIFFERENCE_MINUEND_PLACES=478, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=820, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=33164, PETRI_PLACES=547, PETRI_TRANSITIONS=1466} [2025-03-04 10:12:22,407 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 521 predicate places. [2025-03-04 10:12:22,407 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 1466 transitions, 33164 flow [2025-03-04 10:12:22,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.67741935483871) internal successors, (176), 31 states have internal predecessors, (176), 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:12:22,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:22,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:22,416 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:12:22,607 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,SelfDestructingSolverStorable24 [2025-03-04 10:12:22,608 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:22,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 804614981, now seen corresponding path program 19 times [2025-03-04 10:12:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:22,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513532717] [2025-03-04 10:12:22,608 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:22,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:12:22,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:22,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:22,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:22,787 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:12:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513532717] [2025-03-04 10:12:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513532717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049313745] [2025-03-04 10:12:22,788 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:12:22,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:22,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:22,790 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:12:22,791 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:12:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:12:22,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:22,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:22,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:22,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:22,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:23,010 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:12:23,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:23,170 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:12:23,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049313745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:23,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:23,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:12:23,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205457543] [2025-03-04 10:12:23,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:23,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:12:23,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:23,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:12:23,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:12:23,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:23,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 1466 transitions, 33164 flow. Second operand has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:23,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:23,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:23,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:27,400 INFO L124 PetriNetUnfolderBase]: 4237/7810 cut-off events. [2025-03-04 10:12:27,401 INFO L125 PetriNetUnfolderBase]: For 499487/499487 co-relation queries the response was YES. [2025-03-04 10:12:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88561 conditions, 7810 events. 4237/7810 cut-off events. For 499487/499487 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 57529 event pairs, 228 based on Foata normal form. 4/7814 useless extension candidates. Maximal degree in co-relation 88144. Up to 3450 conditions per place. [2025-03-04 10:12:27,489 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 800 selfloop transitions, 1254 changer transitions 13/2068 dead transitions. [2025-03-04 10:12:27,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 2068 transitions, 49576 flow [2025-03-04 10:12:27,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-04 10:12:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2025-03-04 10:12:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 822 transitions. [2025-03-04 10:12:27,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3682795698924731 [2025-03-04 10:12:27,491 INFO L175 Difference]: Start difference. First operand has 547 places, 1466 transitions, 33164 flow. Second operand 93 states and 822 transitions. [2025-03-04 10:12:27,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 2068 transitions, 49576 flow [2025-03-04 10:12:30,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 2068 transitions, 49192 flow, removed 111 selfloop flow, removed 8 redundant places. [2025-03-04 10:12:30,366 INFO L231 Difference]: Finished difference. Result has 647 places, 1777 transitions, 44365 flow [2025-03-04 10:12:30,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=32857, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=950, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=44365, PETRI_PLACES=647, PETRI_TRANSITIONS=1777} [2025-03-04 10:12:30,367 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 621 predicate places. [2025-03-04 10:12:30,367 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 1777 transitions, 44365 flow [2025-03-04 10:12:30,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:30,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:30,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:30,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:12:30,568 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,SelfDestructingSolverStorable25 [2025-03-04 10:12:30,568 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash -913134079, now seen corresponding path program 20 times [2025-03-04 10:12:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:30,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672690715] [2025-03-04 10:12:30,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:30,571 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:30,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:30,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:30,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:30,738 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:12:30,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672690715] [2025-03-04 10:12:30,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672690715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:30,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011122466] [2025-03-04 10:12:30,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:30,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:30,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:30,740 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:12:30,742 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:12:30,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:30,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:30,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:30,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:30,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:30,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:31,071 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:12:31,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:31,252 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:12:31,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011122466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:31,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:31,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:12:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479710842] [2025-03-04 10:12:31,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:12:31,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:31,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:12:31,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=796, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:12:31,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:31,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 1777 transitions, 44365 flow. Second operand has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:31,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:31,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:31,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:39,099 INFO L124 PetriNetUnfolderBase]: 5652/10366 cut-off events. [2025-03-04 10:12:39,099 INFO L125 PetriNetUnfolderBase]: For 741104/741104 co-relation queries the response was YES. [2025-03-04 10:12:39,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125926 conditions, 10366 events. 5652/10366 cut-off events. For 741104/741104 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 80128 event pairs, 161 based on Foata normal form. 13/10379 useless extension candidates. Maximal degree in co-relation 125755. Up to 2812 conditions per place. [2025-03-04 10:12:39,231 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 714 selfloop transitions, 1955 changer transitions 32/2702 dead transitions. [2025-03-04 10:12:39,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 2702 transitions, 70073 flow [2025-03-04 10:12:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2025-03-04 10:12:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2025-03-04 10:12:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 1308 transitions. [2025-03-04 10:12:39,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36824324324324326 [2025-03-04 10:12:39,233 INFO L175 Difference]: Start difference. First operand has 647 places, 1777 transitions, 44365 flow. Second operand 148 states and 1308 transitions. [2025-03-04 10:12:39,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 791 places, 2702 transitions, 70073 flow [2025-03-04 10:12:43,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 775 places, 2702 transitions, 69508 flow, removed 70 selfloop flow, removed 16 redundant places. [2025-03-04 10:12:43,969 INFO L231 Difference]: Finished difference. Result has 811 places, 2327 transitions, 65318 flow [2025-03-04 10:12:43,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=43868, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1439, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=148, PETRI_FLOW=65318, PETRI_PLACES=811, PETRI_TRANSITIONS=2327} [2025-03-04 10:12:43,971 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 785 predicate places. [2025-03-04 10:12:43,971 INFO L471 AbstractCegarLoop]: Abstraction has has 811 places, 2327 transitions, 65318 flow [2025-03-04 10:12:43,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:43,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:43,972 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:43,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:12:44,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:12:44,176 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:44,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:44,177 INFO L85 PathProgramCache]: Analyzing trace with hash 564972643, now seen corresponding path program 21 times [2025-03-04 10:12:44,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:44,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852728704] [2025-03-04 10:12:44,177 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:44,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:44,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:44,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:44,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:44,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852728704] [2025-03-04 10:12:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852728704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743884290] [2025-03-04 10:12:44,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:12:44,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:44,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:44,307 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:12:44,310 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:12:44,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:44,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:12:44,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:12:44,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:44,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:44,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:44,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:44,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:44,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743884290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:44,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:12:44,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505079885] [2025-03-04 10:12:44,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:12:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:12:44,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:12:44,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:12:44,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 811 places, 2327 transitions, 65318 flow. Second operand has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:44,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:44,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:12:44,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:51,052 INFO L124 PetriNetUnfolderBase]: 5930/10797 cut-off events. [2025-03-04 10:12:51,052 INFO L125 PetriNetUnfolderBase]: For 975290/975290 co-relation queries the response was YES. [2025-03-04 10:12:51,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145003 conditions, 10797 events. 5930/10797 cut-off events. For 975290/975290 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 83483 event pairs, 309 based on Foata normal form. 3/10800 useless extension candidates. Maximal degree in co-relation 144787. Up to 6610 conditions per place. [2025-03-04 10:12:51,228 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 977 selfloop transitions, 1574 changer transitions 12/2564 dead transitions. [2025-03-04 10:12:51,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 857 places, 2564 transitions, 75940 flow [2025-03-04 10:12:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-04 10:12:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2025-03-04 10:12:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 451 transitions. [2025-03-04 10:12:51,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35455974842767296 [2025-03-04 10:12:51,229 INFO L175 Difference]: Start difference. First operand has 811 places, 2327 transitions, 65318 flow. Second operand 53 states and 451 transitions. [2025-03-04 10:12:51,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 857 places, 2564 transitions, 75940 flow [2025-03-04 10:12:59,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 816 places, 2564 transitions, 73946 flow, removed 433 selfloop flow, removed 41 redundant places. [2025-03-04 10:12:59,313 INFO L231 Difference]: Finished difference. Result has 827 places, 2453 transitions, 71270 flow [2025-03-04 10:12:59,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=63491, PETRI_DIFFERENCE_MINUEND_PLACES=764, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1450, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=846, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=71270, PETRI_PLACES=827, PETRI_TRANSITIONS=2453} [2025-03-04 10:12:59,315 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 801 predicate places. [2025-03-04 10:12:59,315 INFO L471 AbstractCegarLoop]: Abstraction has has 827 places, 2453 transitions, 71270 flow [2025-03-04 10:12:59,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:12:59,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:59,315 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:59,320 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:12:59,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:59,516 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:12:59,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:59,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1581198117, now seen corresponding path program 22 times [2025-03-04 10:12:59,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:59,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-03-04 10:12:59,516 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:59,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:59,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:59,520 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:12:59,520 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:12:59,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,626 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:12:59,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142682627] [2025-03-04 10:12:59,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142682627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:59,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578620358] [2025-03-04 10:12:59,627 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:12:59,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:59,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:59,629 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:12:59,630 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:12:59,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:12:59,672 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:12:59,673 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:12:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:59,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:59,855 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:12:59,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:00,007 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:13:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578620358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:00,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:13:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255563802] [2025-03-04 10:13:00,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:13:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:13:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:13:00,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:13:00,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 2453 transitions, 71270 flow. Second operand has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:13:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:00,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:13:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:07,521 INFO L124 PetriNetUnfolderBase]: 6144/11163 cut-off events. [2025-03-04 10:13:07,521 INFO L125 PetriNetUnfolderBase]: For 1008600/1008600 co-relation queries the response was YES. [2025-03-04 10:13:07,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152736 conditions, 11163 events. 6144/11163 cut-off events. For 1008600/1008600 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 86511 event pairs, 310 based on Foata normal form. 5/11168 useless extension candidates. Maximal degree in co-relation 152532. Up to 6283 conditions per place. [2025-03-04 10:13:07,707 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 846 selfloop transitions, 1818 changer transitions 14/2679 dead transitions. [2025-03-04 10:13:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 882 places, 2679 transitions, 81755 flow [2025-03-04 10:13:07,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-04 10:13:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-04 10:13:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 498 transitions. [2025-03-04 10:13:07,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3516949152542373 [2025-03-04 10:13:07,708 INFO L175 Difference]: Start difference. First operand has 827 places, 2453 transitions, 71270 flow. Second operand 59 states and 498 transitions. [2025-03-04 10:13:07,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 882 places, 2679 transitions, 81755 flow [2025-03-04 10:13:17,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 864 places, 2679 transitions, 81467 flow, removed 24 selfloop flow, removed 18 redundant places. [2025-03-04 10:13:17,050 INFO L231 Difference]: Finished difference. Result has 874 places, 2578 transitions, 79567 flow [2025-03-04 10:13:17,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70984, PETRI_DIFFERENCE_MINUEND_PLACES=806, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1702, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=79567, PETRI_PLACES=874, PETRI_TRANSITIONS=2578} [2025-03-04 10:13:17,052 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 848 predicate places. [2025-03-04 10:13:17,053 INFO L471 AbstractCegarLoop]: Abstraction has has 874 places, 2578 transitions, 79567 flow [2025-03-04 10:13:17,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:13:17,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:17,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:17,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:13:17,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:13:17,253 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 10:13:17,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:17,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2142314373, now seen corresponding path program 23 times [2025-03-04 10:13:17,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:17,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894281187] [2025-03-04 10:13:17,254 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:17,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:13:17,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:17,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:17,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:17,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894281187] [2025-03-04 10:13:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894281187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088755699] [2025-03-04 10:13:17,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:13:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:17,367 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:13:17,367 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:13:17,391 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:13:17,398 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:17,398 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:17,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:17,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:13:17,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:13:17,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088755699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:17,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:17,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-04 10:13:17,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900299456] [2025-03-04 10:13:17,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:17,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:13:17,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:17,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:13:17,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=782, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:13:17,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-03-04 10:13:17,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 2578 transitions, 79567 flow. Second operand has 31 states, 31 states have (on average 5.645161290322581) internal successors, (175), 31 states have internal predecessors, (175), 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:13:17,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:17,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-03-04 10:13:17,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand