./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.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-bad-threaded-sum-2.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 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:11:05,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:11:05,794 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:05,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:11:05,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:11:05,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:11:05,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:11:05,819 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:11:05,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:11:05,819 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:11:05,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:11:05,820 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:11:05,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:11:05,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:11:05,821 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:05,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:11:05,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:11:05,821 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 -> 6b30bad195dde021066febd52c7985271e0448c265b66e6efcbd9c3306420e73 [2025-03-04 10:11:06,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:11:06,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:11:06,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:11:06,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:11:06,026 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:11:06,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-04 10:11:07,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5b07300/6d7225194622467991a6dd44f83f1768/FLAG44ff5a960 [2025-03-04 10:11:07,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:11:07,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-03-04 10:11:07,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5b07300/6d7225194622467991a6dd44f83f1768/FLAG44ff5a960 [2025-03-04 10:11:07,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f5b07300/6d7225194622467991a6dd44f83f1768 [2025-03-04 10:11:07,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:11:07,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:11:07,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:07,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:11:07,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:11:07,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ec20d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07, skipping insertion in model container [2025-03-04 10:11:07,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:11:07,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:07,815 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:11:07,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:11:07,842 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:11:07,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07 WrapperNode [2025-03-04 10:11:07,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:11:07,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:07,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:11:07,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:11:07,848 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:07" (1/1) ... [2025-03-04 10:11:07,854 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:07" (1/1) ... [2025-03-04 10:11:07,868 INFO L138 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 50 [2025-03-04 10:11:07,869 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:11:07,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:11:07,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:11:07,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:11:07,875 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:07" (1/1) ... [2025-03-04 10:11:07,875 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:07" (1/1) ... [2025-03-04 10:11:07,878 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:07" (1/1) ... [2025-03-04 10:11:07,891 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:07,891 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:07" (1/1) ... [2025-03-04 10:11:07,891 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:07" (1/1) ... [2025-03-04 10:11:07,897 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:07" (1/1) ... [2025-03-04 10:11:07,898 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:07" (1/1) ... [2025-03-04 10:11:07,899 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:07" (1/1) ... [2025-03-04 10:11:07,899 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:07" (1/1) ... [2025-03-04 10:11:07,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:11:07,905 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:11:07,905 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:11:07,905 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:11:07,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07" (1/1) ... [2025-03-04 10:11:07,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:11:07,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:07,935 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:07,938 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:07,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:11:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:11:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:11:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:11:07,956 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:11:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:11:07,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 10:11:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 10:11:07,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:11:07,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:11:07,958 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:08,024 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:11:08,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:11:08,138 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:11:08,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:11:08,256 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:11:08,256 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:11:08,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:08 BoogieIcfgContainer [2025-03-04 10:11:08,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:11:08,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:11:08,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:11:08,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:11:08,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:11:07" (1/3) ... [2025-03-04 10:11:08,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e4c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:08, skipping insertion in model container [2025-03-04 10:11:08,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:11:07" (2/3) ... [2025-03-04 10:11:08,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625e4c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:11:08, skipping insertion in model container [2025-03-04 10:11:08,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:11:08" (3/3) ... [2025-03-04 10:11:08,267 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-03-04 10:11:08,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:11:08,280 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 10:11:08,281 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:11:08,325 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:11:08,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 68 flow [2025-03-04 10:11:08,369 INFO L124 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-03-04 10:11:08,371 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:08,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-03-04 10:11:08,378 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 27 transitions, 68 flow [2025-03-04 10:11:08,382 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2025-03-04 10:11:08,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:11:08,398 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;@3457d12f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:11:08,398 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:11:08,406 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:11:08,406 INFO L124 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-03-04 10:11:08,407 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:11:08,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:08,407 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:08,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash 428630572, now seen corresponding path program 1 times [2025-03-04 10:11:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541349272] [2025-03-04 10:11:08,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:08,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:11:08,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:11:08,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:08,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:08,803 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:08,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:08,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541349272] [2025-03-04 10:11:08,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541349272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:08,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:08,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401205056] [2025-03-04 10:11:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:08,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:08,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:08,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:08,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:08,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:11:08,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:08,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:08,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:11:08,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:08,959 INFO L124 PetriNetUnfolderBase]: 120/234 cut-off events. [2025-03-04 10:11:08,960 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 10:11:08,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 234 events. 120/234 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 867 event pairs, 9 based on Foata normal form. 17/249 useless extension candidates. Maximal degree in co-relation 425. Up to 134 conditions per place. [2025-03-04 10:11:08,965 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 35 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2025-03-04 10:11:08,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 46 transitions, 195 flow [2025-03-04 10:11:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-04 10:11:08,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2025-03-04 10:11:08,978 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 60 flow. Second operand 5 states and 84 transitions. [2025-03-04 10:11:08,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 46 transitions, 195 flow [2025-03-04 10:11:08,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 46 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:08,985 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 93 flow [2025-03-04 10:11:08,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-03-04 10:11:08,993 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2025-03-04 10:11:08,993 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 93 flow [2025-03-04 10:11:08,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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:08,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:08,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:08,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:11:08,994 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:08,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1733383060, now seen corresponding path program 1 times [2025-03-04 10:11:08,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:08,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394612014] [2025-03-04 10:11:08,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:08,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:11:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:11:09,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:09,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:11:09,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394612014] [2025-03-04 10:11:09,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394612014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:09,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:09,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:09,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738073620] [2025-03-04 10:11:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:09,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:09,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:09,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:09,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:11:09,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:09,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:11:09,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:09,343 INFO L124 PetriNetUnfolderBase]: 146/290 cut-off events. [2025-03-04 10:11:09,343 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-04 10:11:09,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 290 events. 146/290 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1176 event pairs, 15 based on Foata normal form. 13/299 useless extension candidates. Maximal degree in co-relation 251. Up to 144 conditions per place. [2025-03-04 10:11:09,348 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-04 10:11:09,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 44 transitions, 243 flow [2025-03-04 10:11:09,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:11:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:11:09,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-03-04 10:11:09,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2025-03-04 10:11:09,349 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 93 flow. Second operand 4 states and 64 transitions. [2025-03-04 10:11:09,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 44 transitions, 243 flow [2025-03-04 10:11:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:09,351 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 104 flow [2025-03-04 10:11:09,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-03-04 10:11:09,354 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-03-04 10:11:09,354 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 104 flow [2025-03-04 10:11:09,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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:09,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:09,354 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:11:09,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:11:09,354 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:09,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 921824657, now seen corresponding path program 1 times [2025-03-04 10:11:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:09,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716066177] [2025-03-04 10:11:09,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:09,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:09,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:09,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:09,542 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:09,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:09,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716066177] [2025-03-04 10:11:09,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716066177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:09,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:09,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:11:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019860748] [2025-03-04 10:11:09,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:09,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:11:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:09,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:11:09,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:11:09,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:11:09,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:09,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:09,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:11:09,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:09,659 INFO L124 PetriNetUnfolderBase]: 156/301 cut-off events. [2025-03-04 10:11:09,659 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-04 10:11:09,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 301 events. 156/301 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1198 event pairs, 23 based on Foata normal form. 16/315 useless extension candidates. Maximal degree in co-relation 364. Up to 109 conditions per place. [2025-03-04 10:11:09,664 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 34 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2025-03-04 10:11:09,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 253 flow [2025-03-04 10:11:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:11:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:11:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-04 10:11:09,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2025-03-04 10:11:09,666 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 104 flow. Second operand 5 states and 78 transitions. [2025-03-04 10:11:09,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 253 flow [2025-03-04 10:11:09,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:09,668 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 150 flow [2025-03-04 10:11:09,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2025-03-04 10:11:09,671 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2025-03-04 10:11:09,671 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 150 flow [2025-03-04 10:11:09,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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:09,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:09,671 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:11:09,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:11:09,672 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:09,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2135320083, now seen corresponding path program 2 times [2025-03-04 10:11:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307735357] [2025-03-04 10:11:09,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:09,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:11:09,708 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:11:09,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:11:09,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,192 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:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:10,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307735357] [2025-03-04 10:11:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307735357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:10,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815399742] [2025-03-04 10:11:10,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:11:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:10,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:11:10,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:11:10,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:11:10,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:10,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:10,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:11:10,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:10,453 INFO L124 PetriNetUnfolderBase]: 241/457 cut-off events. [2025-03-04 10:11:10,453 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2025-03-04 10:11:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 457 events. 241/457 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1922 event pairs, 14 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 557. Up to 262 conditions per place. [2025-03-04 10:11:10,457 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 41 selfloop transitions, 14 changer transitions 9/69 dead transitions. [2025-03-04 10:11:10,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 420 flow [2025-03-04 10:11:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:11:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:11:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2025-03-04 10:11:10,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2025-03-04 10:11:10,458 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 150 flow. Second operand 10 states and 141 transitions. [2025-03-04 10:11:10,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 420 flow [2025-03-04 10:11:10,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 69 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:11:10,462 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 241 flow [2025-03-04 10:11:10,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=241, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2025-03-04 10:11:10,462 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2025-03-04 10:11:10,462 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 241 flow [2025-03-04 10:11:10,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:10,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:10,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:10,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:11:10,463 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:10,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:10,463 INFO L85 PathProgramCache]: Analyzing trace with hash -430790379, now seen corresponding path program 1 times [2025-03-04 10:11:10,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945357106] [2025-03-04 10:11:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:10,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:10,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:10,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:10,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,635 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:11:10,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945357106] [2025-03-04 10:11:10,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945357106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:10,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637175819] [2025-03-04 10:11:10,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:11:10,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:10,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:10,638 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:10,639 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:10,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:11:10,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:10,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:11:10,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:10,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:11:10,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:10,806 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:11:10,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:10,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637175819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:10,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 12 [2025-03-04 10:11:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045093659] [2025-03-04 10:11:10,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:11:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:10,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:11:10,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:11:10,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:11:10,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 241 flow. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 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:10,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:10,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:11:10,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:11,758 INFO L124 PetriNetUnfolderBase]: 1054/1780 cut-off events. [2025-03-04 10:11:11,759 INFO L125 PetriNetUnfolderBase]: For 3276/3276 co-relation queries the response was YES. [2025-03-04 10:11:11,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5813 conditions, 1780 events. 1054/1780 cut-off events. For 3276/3276 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8609 event pairs, 47 based on Foata normal form. 22/1801 useless extension candidates. Maximal degree in co-relation 5786. Up to 380 conditions per place. [2025-03-04 10:11:11,778 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 149 selfloop transitions, 89 changer transitions 0/241 dead transitions. [2025-03-04 10:11:11,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 241 transitions, 1699 flow [2025-03-04 10:11:11,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:11:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:11:11,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 380 transitions. [2025-03-04 10:11:11,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-03-04 10:11:11,783 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 241 flow. Second operand 30 states and 380 transitions. [2025-03-04 10:11:11,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 241 transitions, 1699 flow [2025-03-04 10:11:11,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 241 transitions, 1643 flow, removed 21 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:11,800 INFO L231 Difference]: Finished difference. Result has 93 places, 126 transitions, 1088 flow [2025-03-04 10:11:11,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1088, PETRI_PLACES=93, PETRI_TRANSITIONS=126} [2025-03-04 10:11:11,802 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2025-03-04 10:11:11,802 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 126 transitions, 1088 flow [2025-03-04 10:11:11,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 12 states have internal predecessors, (119), 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:11,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:11,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:11,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:11:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:12,004 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:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1790389053, now seen corresponding path program 2 times [2025-03-04 10:11:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913853923] [2025-03-04 10:11:12,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:12,012 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:12,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:12,037 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:12,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,608 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:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913853923] [2025-03-04 10:11:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913853923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598667085] [2025-03-04 10:11:12,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:11:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:12,610 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:12,612 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:12,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:11:12,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:11:12,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:11:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:12,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:11:12,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:13,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:13,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:13,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598667085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:13,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:13,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-03-04 10:11:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561938932] [2025-03-04 10:11:13,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:13,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:11:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:13,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:11:13,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:11:13,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:11:13,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 126 transitions, 1088 flow. Second operand has 22 states, 22 states have (on average 9.454545454545455) internal successors, (208), 22 states have internal predecessors, (208), 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:13,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:13,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:11:13,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:17,116 INFO L124 PetriNetUnfolderBase]: 1926/3543 cut-off events. [2025-03-04 10:11:17,116 INFO L125 PetriNetUnfolderBase]: For 25298/25298 co-relation queries the response was YES. [2025-03-04 10:11:17,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17527 conditions, 3543 events. 1926/3543 cut-off events. For 25298/25298 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22317 event pairs, 21 based on Foata normal form. 15/3556 useless extension candidates. Maximal degree in co-relation 13395. Up to 923 conditions per place. [2025-03-04 10:11:17,150 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 271 selfloop transitions, 178 changer transitions 103/556 dead transitions. [2025-03-04 10:11:17,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 556 transitions, 5737 flow [2025-03-04 10:11:17,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:11:17,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 10:11:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 619 transitions. [2025-03-04 10:11:17,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49838969404186795 [2025-03-04 10:11:17,156 INFO L175 Difference]: Start difference. First operand has 93 places, 126 transitions, 1088 flow. Second operand 46 states and 619 transitions. [2025-03-04 10:11:17,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 556 transitions, 5737 flow [2025-03-04 10:11:17,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 556 transitions, 5071 flow, removed 325 selfloop flow, removed 4 redundant places. [2025-03-04 10:11:17,209 INFO L231 Difference]: Finished difference. Result has 157 places, 273 transitions, 2737 flow [2025-03-04 10:11:17,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2737, PETRI_PLACES=157, PETRI_TRANSITIONS=273} [2025-03-04 10:11:17,211 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 128 predicate places. [2025-03-04 10:11:17,211 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 273 transitions, 2737 flow [2025-03-04 10:11:17,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.454545454545455) internal successors, (208), 22 states have internal predecessors, (208), 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:17,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:17,212 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:17,218 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:17,416 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,SelfDestructingSolverStorable5 [2025-03-04 10:11:17,416 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:17,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1216854636, now seen corresponding path program 3 times [2025-03-04 10:11:17,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:17,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005207994] [2025-03-04 10:11:17,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:17,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:11:17,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-03-04 10:11:17,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:11:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:11:17,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005207994] [2025-03-04 10:11:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005207994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:17,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700982911] [2025-03-04 10:11:17,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:17,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:17,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:17,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:17,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:17,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-03-04 10:11:17,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 273 transitions, 2737 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:17,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:17,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-03-04 10:11:17,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:18,096 INFO L124 PetriNetUnfolderBase]: 1991/3798 cut-off events. [2025-03-04 10:11:18,096 INFO L125 PetriNetUnfolderBase]: For 29514/29697 co-relation queries the response was YES. [2025-03-04 10:11:18,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19526 conditions, 3798 events. 1991/3798 cut-off events. For 29514/29697 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 25814 event pairs, 255 based on Foata normal form. 58/3785 useless extension candidates. Maximal degree in co-relation 19275. Up to 1051 conditions per place. [2025-03-04 10:11:18,131 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 284 selfloop transitions, 175 changer transitions 0/484 dead transitions. [2025-03-04 10:11:18,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 484 transitions, 5777 flow [2025-03-04 10:11:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:11:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:11:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2025-03-04 10:11:18,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-04 10:11:18,133 INFO L175 Difference]: Start difference. First operand has 157 places, 273 transitions, 2737 flow. Second operand 7 states and 114 transitions. [2025-03-04 10:11:18,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 484 transitions, 5777 flow [2025-03-04 10:11:18,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 484 transitions, 5331 flow, removed 199 selfloop flow, removed 19 redundant places. [2025-03-04 10:11:18,221 INFO L231 Difference]: Finished difference. Result has 134 places, 378 transitions, 4229 flow [2025-03-04 10:11:18,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4229, PETRI_PLACES=134, PETRI_TRANSITIONS=378} [2025-03-04 10:11:18,222 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2025-03-04 10:11:18,222 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 378 transitions, 4229 flow [2025-03-04 10:11:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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:18,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:18,222 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:11:18,222 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:18,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 965931024, now seen corresponding path program 4 times [2025-03-04 10:11:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278995916] [2025-03-04 10:11:18,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:18,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:18,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:11:18,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:11:18,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:18,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278995916] [2025-03-04 10:11:18,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278995916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:11:18,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:11:18,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:11:18,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061882373] [2025-03-04 10:11:18,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:11:18,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:11:18,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:18,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:11:18,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:11:18,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:11:18,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 378 transitions, 4229 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:18,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:18,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:11:18,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:19,017 INFO L124 PetriNetUnfolderBase]: 3008/5316 cut-off events. [2025-03-04 10:11:19,018 INFO L125 PetriNetUnfolderBase]: For 46548/46808 co-relation queries the response was YES. [2025-03-04 10:11:19,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28920 conditions, 5316 events. 3008/5316 cut-off events. For 46548/46808 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 34344 event pairs, 54 based on Foata normal form. 148/5433 useless extension candidates. Maximal degree in co-relation 26418. Up to 1377 conditions per place. [2025-03-04 10:11:19,056 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 473 selfloop transitions, 232 changer transitions 0/729 dead transitions. [2025-03-04 10:11:19,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 729 transitions, 9407 flow [2025-03-04 10:11:19,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:11:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:11:19,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2025-03-04 10:11:19,057 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2025-03-04 10:11:19,057 INFO L175 Difference]: Start difference. First operand has 134 places, 378 transitions, 4229 flow. Second operand 9 states and 120 transitions. [2025-03-04 10:11:19,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 729 transitions, 9407 flow [2025-03-04 10:11:19,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 729 transitions, 9323 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-03-04 10:11:19,200 INFO L231 Difference]: Finished difference. Result has 145 places, 504 transitions, 6897 flow [2025-03-04 10:11:19,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=4143, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6897, PETRI_PLACES=145, PETRI_TRANSITIONS=504} [2025-03-04 10:11:19,202 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 116 predicate places. [2025-03-04 10:11:19,203 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 504 transitions, 6897 flow [2025-03-04 10:11:19,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:19,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:19,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:19,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:11:19,203 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:19,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1911763935, now seen corresponding path program 3 times [2025-03-04 10:11:19,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:19,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174115598] [2025-03-04 10:11:19,204 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:19,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:19,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:19,230 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:19,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:19,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:19,794 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:11:19,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174115598] [2025-03-04 10:11:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174115598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:19,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546691141] [2025-03-04 10:11:19,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:11:19,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:19,796 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:19,798 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:19,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:19,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:19,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:11:19,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:19,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:11:19,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:20,216 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:11:20,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:21,007 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:11:21,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546691141] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:21,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:21,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2025-03-04 10:11:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946200180] [2025-03-04 10:11:21,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:21,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:11:21,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:21,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:11:21,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:11:21,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:11:21,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 504 transitions, 6897 flow. Second operand has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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:21,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:21,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:11:21,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:28,872 INFO L124 PetriNetUnfolderBase]: 6052/10317 cut-off events. [2025-03-04 10:11:28,872 INFO L125 PetriNetUnfolderBase]: For 114572/114572 co-relation queries the response was YES. [2025-03-04 10:11:28,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63776 conditions, 10317 events. 6052/10317 cut-off events. For 114572/114572 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 70188 event pairs, 131 based on Foata normal form. 14/10330 useless extension candidates. Maximal degree in co-relation 56831. Up to 3562 conditions per place. [2025-03-04 10:11:28,950 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 782 selfloop transitions, 530 changer transitions 81/1396 dead transitions. [2025-03-04 10:11:28,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1396 transitions, 19912 flow [2025-03-04 10:11:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 10:11:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-03-04 10:11:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 745 transitions. [2025-03-04 10:11:28,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44504181600955794 [2025-03-04 10:11:28,956 INFO L175 Difference]: Start difference. First operand has 145 places, 504 transitions, 6897 flow. Second operand 62 states and 745 transitions. [2025-03-04 10:11:28,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 1396 transitions, 19912 flow [2025-03-04 10:11:29,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1396 transitions, 19832 flow, removed 37 selfloop flow, removed 2 redundant places. [2025-03-04 10:11:29,373 INFO L231 Difference]: Finished difference. Result has 246 places, 927 transitions, 14206 flow [2025-03-04 10:11:29,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=6879, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=14206, PETRI_PLACES=246, PETRI_TRANSITIONS=927} [2025-03-04 10:11:29,374 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 217 predicate places. [2025-03-04 10:11:29,374 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 927 transitions, 14206 flow [2025-03-04 10:11:29,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.64) internal successors, (216), 25 states have internal predecessors, (216), 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:29,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:29,374 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:29,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:11:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:29,575 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:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 385040969, now seen corresponding path program 4 times [2025-03-04 10:11:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792189053] [2025-03-04 10:11:29,576 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:29,579 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:29,593 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:29,593 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:29,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:30,388 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:11:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792189053] [2025-03-04 10:11:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792189053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038728441] [2025-03-04 10:11:30,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:11:30,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:30,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:30,391 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:30,392 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:30,415 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:11:30,505 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:11:30,506 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:11:30,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:30,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:11:30,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:31,151 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:11:31,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:40,830 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:11:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038728441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:40,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2025-03-04 10:11:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625184741] [2025-03-04 10:11:40,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:11:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:40,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:11:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=434, Unknown=1, NotChecked=0, Total=552 [2025-03-04 10:11:40,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:11:40,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 927 transitions, 14206 flow. Second operand has 24 states, 24 states have (on average 9.458333333333334) internal successors, (227), 24 states have internal predecessors, (227), 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:40,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:40,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:11:40,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:11:46,340 INFO L124 PetriNetUnfolderBase]: 6240/11114 cut-off events. [2025-03-04 10:11:46,340 INFO L125 PetriNetUnfolderBase]: For 188615/188663 co-relation queries the response was YES. [2025-03-04 10:11:46,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81024 conditions, 11114 events. 6240/11114 cut-off events. For 188615/188663 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 81585 event pairs, 63 based on Foata normal form. 60/11172 useless extension candidates. Maximal degree in co-relation 80845. Up to 4838 conditions per place. [2025-03-04 10:11:46,447 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 947 selfloop transitions, 491 changer transitions 76/1520 dead transitions. [2025-03-04 10:11:46,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1520 transitions, 25510 flow [2025-03-04 10:11:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 10:11:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-04 10:11:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 531 transitions. [2025-03-04 10:11:46,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46825396825396826 [2025-03-04 10:11:46,449 INFO L175 Difference]: Start difference. First operand has 246 places, 927 transitions, 14206 flow. Second operand 42 states and 531 transitions. [2025-03-04 10:11:46,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1520 transitions, 25510 flow [2025-03-04 10:11:47,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 1520 transitions, 24926 flow, removed 275 selfloop flow, removed 10 redundant places. [2025-03-04 10:11:47,783 INFO L231 Difference]: Finished difference. Result has 287 places, 1143 transitions, 18839 flow [2025-03-04 10:11:47,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=13755, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=18839, PETRI_PLACES=287, PETRI_TRANSITIONS=1143} [2025-03-04 10:11:47,784 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 258 predicate places. [2025-03-04 10:11:47,784 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 1143 transitions, 18839 flow [2025-03-04 10:11:47,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.458333333333334) internal successors, (227), 24 states have internal predecessors, (227), 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:47,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:11:47,785 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:11:47,791 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:11:47,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:47,985 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:47,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:11:47,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2075229111, now seen corresponding path program 5 times [2025-03-04 10:11:47,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:11:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022794709] [2025-03-04 10:11:47,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:47,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:11:47,990 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:11:48,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:11:48,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:48,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:48,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:11:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022794709] [2025-03-04 10:11:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022794709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:11:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635289852] [2025-03-04 10:11:48,806 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:11:48,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:11:48,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:11:48,808 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:11:48,809 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:11:48,837 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:11:48,855 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:11:48,856 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:11:48,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:11:48,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:11:48,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:11:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:49,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:11:49,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:11:49,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635289852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:11:49,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:11:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 35 [2025-03-04 10:11:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189708489] [2025-03-04 10:11:49,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:11:49,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:11:49,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:11:49,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:11:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:11:49,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-03-04 10:11:49,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 1143 transitions, 18839 flow. Second operand has 36 states, 36 states have (on average 8.0) internal successors, (288), 36 states have internal predecessors, (288), 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,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:11:49,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-03-04 10:11:49,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:02,660 INFO L124 PetriNetUnfolderBase]: 11101/18791 cut-off events. [2025-03-04 10:12:02,661 INFO L125 PetriNetUnfolderBase]: For 360964/360964 co-relation queries the response was YES. [2025-03-04 10:12:02,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144230 conditions, 18791 events. 11101/18791 cut-off events. For 360964/360964 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 137163 event pairs, 156 based on Foata normal form. 27/18817 useless extension candidates. Maximal degree in co-relation 144012. Up to 3986 conditions per place. [2025-03-04 10:12:02,880 INFO L140 encePairwiseOnDemand]: 14/27 looper letters, 920 selfloop transitions, 1586 changer transitions 109/2618 dead transitions. [2025-03-04 10:12:02,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 2618 transitions, 47753 flow [2025-03-04 10:12:02,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-04 10:12:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2025-03-04 10:12:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 1159 transitions. [2025-03-04 10:12:02,883 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4011768778123918 [2025-03-04 10:12:02,883 INFO L175 Difference]: Start difference. First operand has 287 places, 1143 transitions, 18839 flow. Second operand 107 states and 1159 transitions. [2025-03-04 10:12:02,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 2618 transitions, 47753 flow [2025-03-04 10:12:05,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 2618 transitions, 46906 flow, removed 365 selfloop flow, removed 17 redundant places. [2025-03-04 10:12:05,911 INFO L231 Difference]: Finished difference. Result has 438 places, 2023 transitions, 39399 flow [2025-03-04 10:12:05,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=18483, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=798, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=39399, PETRI_PLACES=438, PETRI_TRANSITIONS=2023} [2025-03-04 10:12:05,912 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 409 predicate places. [2025-03-04 10:12:05,912 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 2023 transitions, 39399 flow [2025-03-04 10:12:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 8.0) internal successors, (288), 36 states have internal predecessors, (288), 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,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:05,913 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:05,918 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:06,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:12:06,117 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:12:06,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:06,117 INFO L85 PathProgramCache]: Analyzing trace with hash -286042525, now seen corresponding path program 5 times [2025-03-04 10:12:06,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:06,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070381116] [2025-03-04 10:12:06,118 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:06,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:06,121 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 10:12:06,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:06,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:12:06,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:06,763 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:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070381116] [2025-03-04 10:12:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070381116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716939056] [2025-03-04 10:12:06,763 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:12:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:06,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:06,765 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:06,766 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:06,792 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-04 10:12:06,813 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:12:06,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-04 10:12:06,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:06,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:06,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:23,753 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:23,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:24,928 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:24,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716939056] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:24,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:24,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2025-03-04 10:12:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304025129] [2025-03-04 10:12:24,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:24,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 10:12:24,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:24,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 10:12:24,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=551, Unknown=4, NotChecked=0, Total=702 [2025-03-04 10:12:24,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-03-04 10:12:24,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 2023 transitions, 39399 flow. Second operand has 27 states, 27 states have (on average 9.555555555555555) internal successors, (258), 27 states have internal predecessors, (258), 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:24,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:24,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-03-04 10:12:24,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand