./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:17:56,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:17:57,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:17:57,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:17:57,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:17:57,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:17:57,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:17:57,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:17:57,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:17:57,048 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:17:57,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:17:57,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:17:57,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:17:57,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:17:57,049 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:17:57,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:17:57,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:17:57,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:17:57,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:17:57,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:17:57,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:17:57,052 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-03-09 01:17:57,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:17:57,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:17:57,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:17:57,282 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:17:57,282 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:17:57,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-03-09 01:17:58,480 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6977c04/58423d821ade422da910e66380bcceb9/FLAG7cfe4d45f [2025-03-09 01:17:58,718 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:17:58,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-03-09 01:17:58,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6977c04/58423d821ade422da910e66380bcceb9/FLAG7cfe4d45f [2025-03-09 01:17:58,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a6977c04/58423d821ade422da910e66380bcceb9 [2025-03-09 01:17:58,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:17:58,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:17:58,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:17:58,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:17:58,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:17:58,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd9dd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58, skipping insertion in model container [2025-03-09 01:17:58,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:17:58,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:17:58,882 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:17:58,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:17:58,918 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:17:58,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58 WrapperNode [2025-03-09 01:17:58,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:17:58,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:17:58,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:17:58,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:17:58,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,940 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2025-03-09 01:17:58,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:17:58,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:17:58,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:17:58,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:17:58,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,958 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:17:58,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,963 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:17:58,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:17:58,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:17:58,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:17:58,967 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (1/1) ... [2025-03-09 01:17:58,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:17:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:17:58,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:17:58,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:17:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:17:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:17:59,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:17:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:17:59,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:17:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:17:59,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:17:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-09 01:17:59,017 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-09 01:17:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:17:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:17:59,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:17:59,018 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:17:59,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:17:59,080 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:17:59,311 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:17:59,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:17:59,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:17:59,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:17:59,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:17:59 BoogieIcfgContainer [2025-03-09 01:17:59,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:17:59,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:17:59,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:17:59,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:17:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:17:58" (1/3) ... [2025-03-09 01:17:59,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67324332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:17:59, skipping insertion in model container [2025-03-09 01:17:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:17:58" (2/3) ... [2025-03-09 01:17:59,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67324332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:17:59, skipping insertion in model container [2025-03-09 01:17:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:17:59" (3/3) ... [2025-03-09 01:17:59,432 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-03-09 01:17:59,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:17:59,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 31 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-03-09 01:17:59,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:17:59,497 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:17:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 96 flow [2025-03-09 01:17:59,549 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-09 01:17:59,554 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:17:59,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-09 01:17:59,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 34 transitions, 96 flow [2025-03-09 01:17:59,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-03-09 01:17:59,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:17:59,579 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;@5301c823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:17:59,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 01:17:59,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:17:59,592 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-03-09 01:17:59,592 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:17:59,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:17:59,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:17:59,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:17:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:17:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 668827, now seen corresponding path program 1 times [2025-03-09 01:17:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:17:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244176194] [2025-03-09 01:17:59,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:17:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:17:59,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:17:59,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:17:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:17:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:00,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:00,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244176194] [2025-03-09 01:18:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244176194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:00,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:00,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:18:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422235072] [2025-03-09 01:18:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:00,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:18:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:18:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:18:00,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:00,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:00,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:00,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:00,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:00,291 INFO L124 PetriNetUnfolderBase]: 1367/1732 cut-off events. [2025-03-09 01:18:00,291 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2025-03-09 01:18:00,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3611 conditions, 1732 events. 1367/1732 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5590 event pairs, 123 based on Foata normal form. 2/994 useless extension candidates. Maximal degree in co-relation 3091. Up to 1541 conditions per place. [2025-03-09 01:18:00,310 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 35 selfloop transitions, 5 changer transitions 1/46 dead transitions. [2025-03-09 01:18:00,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 219 flow [2025-03-09 01:18:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:18:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:18:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 01:18:00,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7156862745098039 [2025-03-09 01:18:00,323 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-03-09 01:18:00,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 219 flow [2025-03-09 01:18:00,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 189 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:18:00,332 INFO L231 Difference]: Finished difference. Result has 31 places, 31 transitions, 95 flow [2025-03-09 01:18:00,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=31, PETRI_TRANSITIONS=31} [2025-03-09 01:18:00,338 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -7 predicate places. [2025-03-09 01:18:00,338 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 31 transitions, 95 flow [2025-03-09 01:18:00,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:00,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:00,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:00,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:18:00,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:00,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1167515123, now seen corresponding path program 1 times [2025-03-09 01:18:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:00,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613166693] [2025-03-09 01:18:00,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:00,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:00,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:00,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:00,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:00,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:00,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:00,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613166693] [2025-03-09 01:18:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613166693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:00,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:00,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35577241] [2025-03-09 01:18:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:00,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:00,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:00,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:00,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:00,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 31 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:00,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:00,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:00,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:00,738 INFO L124 PetriNetUnfolderBase]: 1562/2019 cut-off events. [2025-03-09 01:18:00,738 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2025-03-09 01:18:00,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 2019 events. 1562/2019 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6974 event pairs, 89 based on Foata normal form. 31/2022 useless extension candidates. Maximal degree in co-relation 1791. Up to 828 conditions per place. [2025-03-09 01:18:00,753 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 58 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2025-03-09 01:18:00,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 73 transitions, 357 flow [2025-03-09 01:18:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-03-09 01:18:00,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6588235294117647 [2025-03-09 01:18:00,755 INFO L175 Difference]: Start difference. First operand has 31 places, 31 transitions, 95 flow. Second operand 5 states and 112 transitions. [2025-03-09 01:18:00,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 73 transitions, 357 flow [2025-03-09 01:18:00,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 73 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:00,757 INFO L231 Difference]: Finished difference. Result has 36 places, 38 transitions, 155 flow [2025-03-09 01:18:00,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=36, PETRI_TRANSITIONS=38} [2025-03-09 01:18:00,757 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-03-09 01:18:00,757 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 38 transitions, 155 flow [2025-03-09 01:18:00,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:00,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:00,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:00,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:18:00,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:00,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:00,761 INFO L85 PathProgramCache]: Analyzing trace with hash -326057384, now seen corresponding path program 1 times [2025-03-09 01:18:00,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:00,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673857914] [2025-03-09 01:18:00,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:00,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:00,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:00,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:00,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:00,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:00,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:00,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:00,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673857914] [2025-03-09 01:18:00,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673857914] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:00,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225918151] [2025-03-09 01:18:00,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:00,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:00,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:00,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:18:00,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:18:00,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:00,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:00,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:00,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:00,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:00,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:01,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225918151] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:01,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:01,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:01,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855811239] [2025-03-09 01:18:01,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:01,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:01,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:01,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:01,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:01,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:01,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 38 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:01,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:01,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:01,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:01,348 INFO L124 PetriNetUnfolderBase]: 1958/2597 cut-off events. [2025-03-09 01:18:01,348 INFO L125 PetriNetUnfolderBase]: For 2751/2751 co-relation queries the response was YES. [2025-03-09 01:18:01,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8095 conditions, 2597 events. 1958/2597 cut-off events. For 2751/2751 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10560 event pairs, 312 based on Foata normal form. 80/2643 useless extension candidates. Maximal degree in co-relation 3569. Up to 1295 conditions per place. [2025-03-09 01:18:01,368 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 89 selfloop transitions, 8 changer transitions 0/102 dead transitions. [2025-03-09 01:18:01,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 102 transitions, 615 flow [2025-03-09 01:18:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-03-09 01:18:01,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235294117647059 [2025-03-09 01:18:01,370 INFO L175 Difference]: Start difference. First operand has 36 places, 38 transitions, 155 flow. Second operand 5 states and 123 transitions. [2025-03-09 01:18:01,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 102 transitions, 615 flow [2025-03-09 01:18:01,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 102 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:18:01,377 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 210 flow [2025-03-09 01:18:01,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2025-03-09 01:18:01,378 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2025-03-09 01:18:01,378 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 210 flow [2025-03-09 01:18:01,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:01,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:01,379 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:01,386 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-09 01:18:01,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:01,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:01,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1207442281, now seen corresponding path program 2 times [2025-03-09 01:18:01,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:01,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390174106] [2025-03-09 01:18:01,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:01,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:01,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:01,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:01,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:01,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:01,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:01,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390174106] [2025-03-09 01:18:01,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390174106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:01,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938585488] [2025-03-09 01:18:01,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:01,685 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-09 01:18:01,689 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-09 01:18:01,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:01,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:01,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:01,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:01,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:01,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:01,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938585488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:01,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786415792] [2025-03-09 01:18:01,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:01,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:01,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:01,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:01,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:01,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:01,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:01,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:02,221 INFO L124 PetriNetUnfolderBase]: 1905/2575 cut-off events. [2025-03-09 01:18:02,222 INFO L125 PetriNetUnfolderBase]: For 4028/4028 co-relation queries the response was YES. [2025-03-09 01:18:02,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 2575 events. 1905/2575 cut-off events. For 4028/4028 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 10797 event pairs, 329 based on Foata normal form. 77/2594 useless extension candidates. Maximal degree in co-relation 3967. Up to 1195 conditions per place. [2025-03-09 01:18:02,243 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 75 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-03-09 01:18:02,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 90 transitions, 615 flow [2025-03-09 01:18:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-09 01:18:02,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6529411764705882 [2025-03-09 01:18:02,247 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 210 flow. Second operand 5 states and 111 transitions. [2025-03-09 01:18:02,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 90 transitions, 615 flow [2025-03-09 01:18:02,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 615 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:18:02,255 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 264 flow [2025-03-09 01:18:02,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-03-09 01:18:02,256 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-03-09 01:18:02,256 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 264 flow [2025-03-09 01:18:02,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:02,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:02,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:02,262 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-09 01:18:02,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:18:02,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:02,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1618647633, now seen corresponding path program 1 times [2025-03-09 01:18:02,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:02,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102385874] [2025-03-09 01:18:02,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:02,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:02,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:02,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:02,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102385874] [2025-03-09 01:18:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102385874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:02,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:02,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307375134] [2025-03-09 01:18:02,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:02,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:02,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:02,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:02,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:02,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:02,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:02,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:02,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:02,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:02,798 INFO L124 PetriNetUnfolderBase]: 1859/2489 cut-off events. [2025-03-09 01:18:02,799 INFO L125 PetriNetUnfolderBase]: For 6539/6545 co-relation queries the response was YES. [2025-03-09 01:18:02,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10232 conditions, 2489 events. 1859/2489 cut-off events. For 6539/6545 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10272 event pairs, 143 based on Foata normal form. 47/2529 useless extension candidates. Maximal degree in co-relation 6459. Up to 1056 conditions per place. [2025-03-09 01:18:02,822 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 101 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2025-03-09 01:18:02,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 116 transitions, 893 flow [2025-03-09 01:18:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-09 01:18:02,824 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:18:02,824 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 264 flow. Second operand 5 states and 119 transitions. [2025-03-09 01:18:02,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 116 transitions, 893 flow [2025-03-09 01:18:02,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 864 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:02,842 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 316 flow [2025-03-09 01:18:02,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2025-03-09 01:18:02,845 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2025-03-09 01:18:02,845 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 316 flow [2025-03-09 01:18:02,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:02,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:02,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:02,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:18:02,846 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:02,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1468669116, now seen corresponding path program 1 times [2025-03-09 01:18:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:02,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64815114] [2025-03-09 01:18:02,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:18:02,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64815114] [2025-03-09 01:18:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64815114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:02,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809096020] [2025-03-09 01:18:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:02,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:02,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:02,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:02,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:02,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:02,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 316 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:02,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:02,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:02,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:03,161 INFO L124 PetriNetUnfolderBase]: 1819/2469 cut-off events. [2025-03-09 01:18:03,161 INFO L125 PetriNetUnfolderBase]: For 5980/5980 co-relation queries the response was YES. [2025-03-09 01:18:03,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10578 conditions, 2469 events. 1819/2469 cut-off events. For 5980/5980 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 10018 event pairs, 82 based on Foata normal form. 40/2475 useless extension candidates. Maximal degree in co-relation 6657. Up to 1147 conditions per place. [2025-03-09 01:18:03,176 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 90 selfloop transitions, 8 changer transitions 2/105 dead transitions. [2025-03-09 01:18:03,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 841 flow [2025-03-09 01:18:03,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 01:18:03,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2025-03-09 01:18:03,177 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 316 flow. Second operand 5 states and 110 transitions. [2025-03-09 01:18:03,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 841 flow [2025-03-09 01:18:03,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 105 transitions, 796 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:03,184 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 317 flow [2025-03-09 01:18:03,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-09 01:18:03,184 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2025-03-09 01:18:03,184 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 317 flow [2025-03-09 01:18:03,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:03,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:03,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:03,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:18:03,185 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:03,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:03,185 INFO L85 PathProgramCache]: Analyzing trace with hash 87085574, now seen corresponding path program 2 times [2025-03-09 01:18:03,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041217441] [2025-03-09 01:18:03,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:03,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:03,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:03,195 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:03,195 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:03,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041217441] [2025-03-09 01:18:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041217441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559018518] [2025-03-09 01:18:03,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:03,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:03,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:03,243 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-09 01:18:03,244 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-09 01:18:03,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:03,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:03,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:03,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:03,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:03,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:03,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:03,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559018518] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:03,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:03,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:03,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422764847] [2025-03-09 01:18:03,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:03,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:03,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:03,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:03,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:03,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:03,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:03,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:03,732 INFO L124 PetriNetUnfolderBase]: 1745/2409 cut-off events. [2025-03-09 01:18:03,732 INFO L125 PetriNetUnfolderBase]: For 6151/6151 co-relation queries the response was YES. [2025-03-09 01:18:03,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 2409 events. 1745/2409 cut-off events. For 6151/6151 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 10225 event pairs, 303 based on Foata normal form. 74/2435 useless extension candidates. Maximal degree in co-relation 6457. Up to 1314 conditions per place. [2025-03-09 01:18:03,744 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 91 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2025-03-09 01:18:03,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 104 transitions, 833 flow [2025-03-09 01:18:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-09 01:18:03,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2025-03-09 01:18:03,746 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 317 flow. Second operand 5 states and 108 transitions. [2025-03-09 01:18:03,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 104 transitions, 833 flow [2025-03-09 01:18:03,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 824 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:03,753 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 365 flow [2025-03-09 01:18:03,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2025-03-09 01:18:03,753 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 24 predicate places. [2025-03-09 01:18:03,753 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 365 flow [2025-03-09 01:18:03,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:03,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:03,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:03,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:18:03,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:03,958 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:03,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash 541806612, now seen corresponding path program 2 times [2025-03-09 01:18:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:03,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993594826] [2025-03-09 01:18:03,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:03,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:03,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:03,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:03,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:04,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:04,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993594826] [2025-03-09 01:18:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993594826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:18:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:18:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:18:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946384792] [2025-03-09 01:18:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:18:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:18:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:04,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:18:04,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:18:04,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:04,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:04,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:04,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:04,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:04,194 INFO L124 PetriNetUnfolderBase]: 1515/2042 cut-off events. [2025-03-09 01:18:04,195 INFO L125 PetriNetUnfolderBase]: For 7760/7766 co-relation queries the response was YES. [2025-03-09 01:18:04,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9645 conditions, 2042 events. 1515/2042 cut-off events. For 7760/7766 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8074 event pairs, 89 based on Foata normal form. 35/2071 useless extension candidates. Maximal degree in co-relation 8488. Up to 864 conditions per place. [2025-03-09 01:18:04,207 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 108 selfloop transitions, 9 changer transitions 4/126 dead transitions. [2025-03-09 01:18:04,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 126 transitions, 1124 flow [2025-03-09 01:18:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:04,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-09 01:18:04,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-09 01:18:04,208 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 365 flow. Second operand 5 states and 119 transitions. [2025-03-09 01:18:04,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 126 transitions, 1124 flow [2025-03-09 01:18:04,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 126 transitions, 1083 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:04,215 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 367 flow [2025-03-09 01:18:04,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-09 01:18:04,216 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2025-03-09 01:18:04,216 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 367 flow [2025-03-09 01:18:04,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:04,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:04,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:04,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:18:04,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:04,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:04,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1314894271, now seen corresponding path program 2 times [2025-03-09 01:18:04,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:04,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001325560] [2025-03-09 01:18:04,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:04,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:04,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:04,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:04,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:04,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001325560] [2025-03-09 01:18:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001325560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984749495] [2025-03-09 01:18:04,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:18:04,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:04,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:04,274 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-09 01:18:04,276 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-09 01:18:04,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:18:04,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:18:04,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:18:04,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:04,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:18:04,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:18:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:04,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:18:04,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:18:04,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984749495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:18:04,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:18:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 01:18:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120395821] [2025-03-09 01:18:04,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:18:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:18:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:18:04,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:18:04,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:18:04,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-03-09 01:18:04,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:04,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:18:04,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-03-09 01:18:04,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:18:04,682 INFO L124 PetriNetUnfolderBase]: 1447/1987 cut-off events. [2025-03-09 01:18:04,682 INFO L125 PetriNetUnfolderBase]: For 6941/6965 co-relation queries the response was YES. [2025-03-09 01:18:04,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9646 conditions, 1987 events. 1447/1987 cut-off events. For 6941/6965 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8213 event pairs, 375 based on Foata normal form. 72/2041 useless extension candidates. Maximal degree in co-relation 8606. Up to 1150 conditions per place. [2025-03-09 01:18:04,692 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 111 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2025-03-09 01:18:04,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 124 transitions, 1108 flow [2025-03-09 01:18:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:18:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:18:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-09 01:18:04,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2025-03-09 01:18:04,694 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 367 flow. Second operand 5 states and 116 transitions. [2025-03-09 01:18:04,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 124 transitions, 1108 flow [2025-03-09 01:18:04,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 1099 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:18:04,700 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 408 flow [2025-03-09 01:18:04,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2025-03-09 01:18:04,701 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2025-03-09 01:18:04,701 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 408 flow [2025-03-09 01:18:04,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:18:04,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:18:04,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:18:04,707 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-09 01:18:04,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:04,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-09 01:18:04,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:18:04,903 INFO L85 PathProgramCache]: Analyzing trace with hash 372853184, now seen corresponding path program 1 times [2025-03-09 01:18:04,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:18:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691593960] [2025-03-09 01:18:04,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:04,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:18:04,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:18:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:18:04,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:05,298 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-09 01:18:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:18:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691593960] [2025-03-09 01:18:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691593960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:18:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761549981] [2025-03-09 01:18:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:18:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:18:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:18:05,301 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-09 01:18:05,302 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-09 01:18:05,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:18:05,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:18:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:18:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:18:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:18:05,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:37,566 WARN L286 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)