./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:05:20,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:05:20,641 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:05:20,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:05:20,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:05:20,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:05:20,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:05:20,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:05:20,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:05:20,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:05:20,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:05:20,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:05:20,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:05:20,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:05:20,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:05:20,661 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:05:20,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:05:20,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:05:20,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:05:20,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:05:20,663 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2025-03-04 10:05:20,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:05:20,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:05:20,888 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:05:20,889 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:05:20,889 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:05:20,891 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-04 10:05:22,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98b90b13/0a0ebb95dd934d7fae86f3576421ca2b/FLAG39cbe9e30 [2025-03-04 10:05:22,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:05:22,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3-opt.wvr.c [2025-03-04 10:05:22,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98b90b13/0a0ebb95dd934d7fae86f3576421ca2b/FLAG39cbe9e30 [2025-03-04 10:05:22,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98b90b13/0a0ebb95dd934d7fae86f3576421ca2b [2025-03-04 10:05:22,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:05:22,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:05:22,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:05:22,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:05:22,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:05:22,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed66158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22, skipping insertion in model container [2025-03-04 10:05:22,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:05:22,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:05:22,754 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:05:22,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:05:22,792 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:05:22,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22 WrapperNode [2025-03-04 10:05:22,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:05:22,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:05:22,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:05:22,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:05:22,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,818 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-04 10:05:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:05:22,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:05:22,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:05:22,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:05:22,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,843 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:05:22,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,844 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:05:22,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:05:22,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:05:22,856 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:05:22,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (1/1) ... [2025-03-04 10:05:22,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:05:22,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:22,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:05:22,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:05:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:05:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:05:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-04 10:05:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:05:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:05:22,899 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:05:22,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:05:22,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:05:23,151 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:05:23,152 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:05:23,263 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:05:23,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:05:23,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:05:23 BoogieIcfgContainer [2025-03-04 10:05:23,263 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:05:23,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:05:23,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:05:23,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:05:23,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:05:22" (1/3) ... [2025-03-04 10:05:23,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326da6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:05:23, skipping insertion in model container [2025-03-04 10:05:23,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:05:22" (2/3) ... [2025-03-04 10:05:23,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326da6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:05:23, skipping insertion in model container [2025-03-04 10:05:23,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:05:23" (3/3) ... [2025-03-04 10:05:23,272 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2025-03-04 10:05:23,284 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:05:23,285 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp3x3-opt.wvr.c that has 7 procedures, 43 locations, 1 initial locations, 6 loop locations, and 2 error locations. [2025-03-04 10:05:23,286 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:05:23,337 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-03-04 10:05:23,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 48 transitions, 138 flow [2025-03-04 10:05:23,405 INFO L124 PetriNetUnfolderBase]: 6/42 cut-off events. [2025-03-04 10:05:23,408 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:05:23,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 42 events. 6/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2025-03-04 10:05:23,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 48 transitions, 138 flow [2025-03-04 10:05:23,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 41 transitions, 118 flow [2025-03-04 10:05:23,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:05:23,440 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;@556b72ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:05:23,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:05:23,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:05:23,461 INFO L124 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-03-04 10:05:23,461 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:05:23,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:23,461 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:23,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -112677829, now seen corresponding path program 1 times [2025-03-04 10:05:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:23,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596343574] [2025-03-04 10:05:23,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:23,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:23,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 10:05:23,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 10:05:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:05:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596343574] [2025-03-04 10:05:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596343574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:05:23,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477796682] [2025-03-04 10:05:23,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:23,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:05:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:23,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:05:23,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:05:23,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:23,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:23,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:23,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:23,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:25,235 INFO L124 PetriNetUnfolderBase]: 21719/25257 cut-off events. [2025-03-04 10:05:25,235 INFO L125 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2025-03-04 10:05:25,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51643 conditions, 25257 events. 21719/25257 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 88484 event pairs, 3973 based on Foata normal form. 2/13724 useless extension candidates. Maximal degree in co-relation 44649. Up to 16365 conditions per place. [2025-03-04 10:05:25,392 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 49 selfloop transitions, 3 changer transitions 1/60 dead transitions. [2025-03-04 10:05:25,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 283 flow [2025-03-04 10:05:25,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:05:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:05:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-04 10:05:25,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6736111111111112 [2025-03-04 10:05:25,404 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 118 flow. Second operand 3 states and 97 transitions. [2025-03-04 10:05:25,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 283 flow [2025-03-04 10:05:25,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-04 10:05:25,467 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 109 flow [2025-03-04 10:05:25,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2025-03-04 10:05:25,474 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2025-03-04 10:05:25,475 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 109 flow [2025-03-04 10:05:25,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:25,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:25,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:25,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:05:25,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -676991891, now seen corresponding path program 1 times [2025-03-04 10:05:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674643025] [2025-03-04 10:05:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:25,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 10:05:25,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 10:05:25,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:25,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:25,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:25,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674643025] [2025-03-04 10:05:25,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674643025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:25,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:25,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:05:25,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051340427] [2025-03-04 10:05:25,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:25,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:05:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:25,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:05:25,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:05:25,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:25,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:25,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:25,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:25,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:26,906 INFO L124 PetriNetUnfolderBase]: 27281/31861 cut-off events. [2025-03-04 10:05:26,906 INFO L125 PetriNetUnfolderBase]: For 4124/4124 co-relation queries the response was YES. [2025-03-04 10:05:26,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69532 conditions, 31861 events. 27281/31861 cut-off events. For 4124/4124 co-relation queries the response was YES. Maximal size of possible extension queue 1137. Compared 118338 event pairs, 4194 based on Foata normal form. 1/21679 useless extension candidates. Maximal degree in co-relation 22987. Up to 23229 conditions per place. [2025-03-04 10:05:27,128 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 55 selfloop transitions, 3 changer transitions 3/68 dead transitions. [2025-03-04 10:05:27,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 68 transitions, 304 flow [2025-03-04 10:05:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:05:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:05:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2025-03-04 10:05:27,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 10:05:27,133 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 109 flow. Second operand 3 states and 100 transitions. [2025-03-04 10:05:27,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 68 transitions, 304 flow [2025-03-04 10:05:27,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:27,135 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 125 flow [2025-03-04 10:05:27,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-04 10:05:27,135 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-04 10:05:27,135 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 125 flow [2025-03-04 10:05:27,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:27,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:27,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:05:27,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2050225769, now seen corresponding path program 1 times [2025-03-04 10:05:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749766523] [2025-03-04 10:05:27,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:27,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:05:27,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:05:27,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:27,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:27,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:27,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749766523] [2025-03-04 10:05:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749766523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:27,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:27,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:05:27,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235180857] [2025-03-04 10:05:27,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:27,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:05:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:27,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:05:27,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:05:27,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:27,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:27,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:27,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:27,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:28,746 INFO L124 PetriNetUnfolderBase]: 36105/42483 cut-off events. [2025-03-04 10:05:28,746 INFO L125 PetriNetUnfolderBase]: For 12422/12422 co-relation queries the response was YES. [2025-03-04 10:05:28,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100224 conditions, 42483 events. 36105/42483 cut-off events. For 12422/12422 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 170043 event pairs, 5986 based on Foata normal form. 1/36259 useless extension candidates. Maximal degree in co-relation 33618. Up to 30318 conditions per place. [2025-03-04 10:05:28,899 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 61 selfloop transitions, 3 changer transitions 5/76 dead transitions. [2025-03-04 10:05:28,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 76 transitions, 358 flow [2025-03-04 10:05:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:05:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:05:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-03-04 10:05:28,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-04 10:05:28,902 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 125 flow. Second operand 3 states and 104 transitions. [2025-03-04 10:05:28,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 76 transitions, 358 flow [2025-03-04 10:05:28,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:28,904 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 141 flow [2025-03-04 10:05:28,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2025-03-04 10:05:28,905 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2025-03-04 10:05:28,905 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 141 flow [2025-03-04 10:05:28,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:28,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:28,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:28,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:05:28,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:28,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1210128203, now seen corresponding path program 1 times [2025-03-04 10:05:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052245378] [2025-03-04 10:05:28,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:28,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:28,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:28,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:29,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:29,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052245378] [2025-03-04 10:05:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052245378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:29,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759685111] [2025-03-04 10:05:29,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:29,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:29,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:29,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:29,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:29,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-04 10:05:29,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:29,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:29,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:30,611 INFO L124 PetriNetUnfolderBase]: 36049/42318 cut-off events. [2025-03-04 10:05:30,612 INFO L125 PetriNetUnfolderBase]: For 16704/16704 co-relation queries the response was YES. [2025-03-04 10:05:30,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105179 conditions, 42318 events. 36049/42318 cut-off events. For 16704/16704 co-relation queries the response was YES. Maximal size of possible extension queue 1521. Compared 165966 event pairs, 984 based on Foata normal form. 562/42868 useless extension candidates. Maximal degree in co-relation 35250. Up to 17323 conditions per place. [2025-03-04 10:05:31,004 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 102 selfloop transitions, 6 changer transitions 11/126 dead transitions. [2025-03-04 10:05:31,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 126 transitions, 615 flow [2025-03-04 10:05:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2025-03-04 10:05:31,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-03-04 10:05:31,005 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 141 flow. Second operand 5 states and 174 transitions. [2025-03-04 10:05:31,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 126 transitions, 615 flow [2025-03-04 10:05:31,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 126 transitions, 611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:31,008 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 162 flow [2025-03-04 10:05:31,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-04 10:05:31,009 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-03-04 10:05:31,009 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 162 flow [2025-03-04 10:05:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-04 10:05:31,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:31,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:05:31,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1868920200, now seen corresponding path program 1 times [2025-03-04 10:05:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276246880] [2025-03-04 10:05:31,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:31,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:31,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276246880] [2025-03-04 10:05:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276246880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819161219] [2025-03-04 10:05:31,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:31,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:31,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:31,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:31,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:05:31,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:31,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:31,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:31,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:31,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:05:31,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:31,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819161219] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:31,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 10:05:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064534954] [2025-03-04 10:05:31,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:31,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:31,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:31,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:31,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:31,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:31,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:31,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:31,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:31,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:32,874 INFO L124 PetriNetUnfolderBase]: 35781/42567 cut-off events. [2025-03-04 10:05:32,874 INFO L125 PetriNetUnfolderBase]: For 25316/25316 co-relation queries the response was YES. [2025-03-04 10:05:32,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114178 conditions, 42567 events. 35781/42567 cut-off events. For 25316/25316 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 177800 event pairs, 4692 based on Foata normal form. 917/43437 useless extension candidates. Maximal degree in co-relation 39089. Up to 20852 conditions per place. [2025-03-04 10:05:33,011 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 108 selfloop transitions, 6 changer transitions 7/128 dead transitions. [2025-03-04 10:05:33,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 128 transitions, 693 flow [2025-03-04 10:05:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:33,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-04 10:05:33,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 10:05:33,013 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 162 flow. Second operand 5 states and 170 transitions. [2025-03-04 10:05:33,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 128 transitions, 693 flow [2025-03-04 10:05:33,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 128 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:33,016 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 195 flow [2025-03-04 10:05:33,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2025-03-04 10:05:33,017 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-04 10:05:33,017 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 195 flow [2025-03-04 10:05:33,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:33,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:33,017 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:33,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:05:33,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:33,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1365943141, now seen corresponding path program 1 times [2025-03-04 10:05:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489282836] [2025-03-04 10:05:33,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:33,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:33,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:33,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489282836] [2025-03-04 10:05:33,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489282836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:33,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315012382] [2025-03-04 10:05:33,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:33,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:33,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:33,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:05:33,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:33,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:33,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:33,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:33,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:05:33,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:33,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:33,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315012382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:33,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:33,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 10:05:33,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144436166] [2025-03-04 10:05:33,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:33,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:33,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:33,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:33,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:33,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:33,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:33,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:33,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:33,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:36,042 INFO L124 PetriNetUnfolderBase]: 40859/49047 cut-off events. [2025-03-04 10:05:36,043 INFO L125 PetriNetUnfolderBase]: For 50384/50402 co-relation queries the response was YES. [2025-03-04 10:05:36,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146843 conditions, 49047 events. 40859/49047 cut-off events. For 50384/50402 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 218534 event pairs, 5075 based on Foata normal form. 1144/49699 useless extension candidates. Maximal degree in co-relation 64565. Up to 24931 conditions per place. [2025-03-04 10:05:36,199 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 116 selfloop transitions, 6 changer transitions 14/143 dead transitions. [2025-03-04 10:05:36,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 818 flow [2025-03-04 10:05:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:36,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-03-04 10:05:36,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 10:05:36,200 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 195 flow. Second operand 5 states and 180 transitions. [2025-03-04 10:05:36,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 818 flow [2025-03-04 10:05:36,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 143 transitions, 801 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:36,219 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 219 flow [2025-03-04 10:05:36,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-04 10:05:36,220 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2025-03-04 10:05:36,220 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 219 flow [2025-03-04 10:05:36,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:36,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:36,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:36,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:05:36,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:05:36,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:36,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1973087544, now seen corresponding path program 1 times [2025-03-04 10:05:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465677771] [2025-03-04 10:05:36,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 10:05:36,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:36,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:36,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:36,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:36,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465677771] [2025-03-04 10:05:36,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465677771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:36,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849531784] [2025-03-04 10:05:36,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:36,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:36,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:36,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:36,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-04 10:05:36,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:36,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:36,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:38,123 INFO L124 PetriNetUnfolderBase]: 28133/33361 cut-off events. [2025-03-04 10:05:38,123 INFO L125 PetriNetUnfolderBase]: For 46077/46077 co-relation queries the response was YES. [2025-03-04 10:05:38,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110724 conditions, 33361 events. 28133/33361 cut-off events. For 46077/46077 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 131815 event pairs, 674 based on Foata normal form. 366/33704 useless extension candidates. Maximal degree in co-relation 56630. Up to 13091 conditions per place. [2025-03-04 10:05:38,215 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 89 selfloop transitions, 4 changer transitions 34/134 dead transitions. [2025-03-04 10:05:38,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 134 transitions, 841 flow [2025-03-04 10:05:38,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-04 10:05:38,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-03-04 10:05:38,216 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 219 flow. Second operand 5 states and 166 transitions. [2025-03-04 10:05:38,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 134 transitions, 841 flow [2025-03-04 10:05:38,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 134 transitions, 812 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:38,355 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 221 flow [2025-03-04 10:05:38,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-03-04 10:05:38,356 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 10 predicate places. [2025-03-04 10:05:38,359 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 221 flow [2025-03-04 10:05:38,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 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-04 10:05:38,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:38,360 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:38,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:05:38,360 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:38,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:38,360 INFO L85 PathProgramCache]: Analyzing trace with hash -353093436, now seen corresponding path program 2 times [2025-03-04 10:05:38,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:38,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019277455] [2025-03-04 10:05:38,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:05:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:38,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 10:05:38,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:38,379 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:05:38,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:38,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019277455] [2025-03-04 10:05:38,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019277455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:38,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071954622] [2025-03-04 10:05:38,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:05:38,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:38,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:38,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:38,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:05:38,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-04 10:05:38,498 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 10:05:38,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:05:38,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:38,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:05:38,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:38,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:38,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071954622] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:38,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:38,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:05:38,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530598811] [2025-03-04 10:05:38,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:38,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:05:38,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:38,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:05:38,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:05:38,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:38,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 221 flow. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:38,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:38,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:38,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:40,298 INFO L124 PetriNetUnfolderBase]: 19916/23672 cut-off events. [2025-03-04 10:05:40,299 INFO L125 PetriNetUnfolderBase]: For 41079/41085 co-relation queries the response was YES. [2025-03-04 10:05:40,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83023 conditions, 23672 events. 19916/23672 cut-off events. For 41079/41085 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 88953 event pairs, 257 based on Foata normal form. 1107/24776 useless extension candidates. Maximal degree in co-relation 46094. Up to 6957 conditions per place. [2025-03-04 10:05:40,395 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 290 selfloop transitions, 41 changer transitions 6/344 dead transitions. [2025-03-04 10:05:40,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 344 transitions, 2354 flow [2025-03-04 10:05:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:05:40,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:05:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 500 transitions. [2025-03-04 10:05:40,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2025-03-04 10:05:40,397 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 221 flow. Second operand 17 states and 500 transitions. [2025-03-04 10:05:40,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 344 transitions, 2354 flow [2025-03-04 10:05:40,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 344 transitions, 2317 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:40,428 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 619 flow [2025-03-04 10:05:40,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=619, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-03-04 10:05:40,428 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2025-03-04 10:05:40,428 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 619 flow [2025-03-04 10:05:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:40,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:40,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:40,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:05:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:40,629 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:40,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2102127813, now seen corresponding path program 1 times [2025-03-04 10:05:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189173495] [2025-03-04 10:05:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:40,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 10:05:40,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:05:40,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:40,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:40,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:40,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189173495] [2025-03-04 10:05:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189173495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817225690] [2025-03-04 10:05:40,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:40,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:40,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:40,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:40,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 619 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:40,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:40,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:40,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:41,902 INFO L124 PetriNetUnfolderBase]: 19713/23589 cut-off events. [2025-03-04 10:05:41,902 INFO L125 PetriNetUnfolderBase]: For 126824/126870 co-relation queries the response was YES. [2025-03-04 10:05:41,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112573 conditions, 23589 events. 19713/23589 cut-off events. For 126824/126870 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 89338 event pairs, 998 based on Foata normal form. 210/23779 useless extension candidates. Maximal degree in co-relation 100071. Up to 9384 conditions per place. [2025-03-04 10:05:42,071 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 127 selfloop transitions, 10 changer transitions 54/198 dead transitions. [2025-03-04 10:05:42,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 198 transitions, 1761 flow [2025-03-04 10:05:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2025-03-04 10:05:42,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-04 10:05:42,073 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 619 flow. Second operand 5 states and 158 transitions. [2025-03-04 10:05:42,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 198 transitions, 1761 flow [2025-03-04 10:05:42,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 198 transitions, 1675 flow, removed 28 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:42,774 INFO L231 Difference]: Finished difference. Result has 93 places, 93 transitions, 600 flow [2025-03-04 10:05:42,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=93, PETRI_TRANSITIONS=93} [2025-03-04 10:05:42,775 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2025-03-04 10:05:42,775 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 600 flow [2025-03-04 10:05:42,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:42,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:42,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:42,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:05:42,775 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:42,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash 834353081, now seen corresponding path program 2 times [2025-03-04 10:05:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443881517] [2025-03-04 10:05:42,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:05:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:42,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:05:42,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:05:42,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:05:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:42,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:42,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443881517] [2025-03-04 10:05:42,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443881517] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:42,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239551215] [2025-03-04 10:05:42,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:05:42,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:42,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:42,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:05:42,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-04 10:05:42,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 10:05:42,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:05:42,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:42,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:05:42,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:43,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239551215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:43,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 10:05:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720471837] [2025-03-04 10:05:43,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:43,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:43,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:43,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:43,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:43,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 600 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:43,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:43,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:43,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:44,232 INFO L124 PetriNetUnfolderBase]: 13483/16182 cut-off events. [2025-03-04 10:05:44,233 INFO L125 PetriNetUnfolderBase]: For 84876/84922 co-relation queries the response was YES. [2025-03-04 10:05:44,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76629 conditions, 16182 events. 13483/16182 cut-off events. For 84876/84922 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 58375 event pairs, 999 based on Foata normal form. 411/16573 useless extension candidates. Maximal degree in co-relation 67149. Up to 10707 conditions per place. [2025-03-04 10:05:44,324 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 155 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2025-03-04 10:05:44,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 174 transitions, 1478 flow [2025-03-04 10:05:44,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 151 transitions. [2025-03-04 10:05:44,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2025-03-04 10:05:44,325 INFO L175 Difference]: Start difference. First operand has 93 places, 93 transitions, 600 flow. Second operand 5 states and 151 transitions. [2025-03-04 10:05:44,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 174 transitions, 1478 flow [2025-03-04 10:05:44,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 174 transitions, 1465 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:44,521 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 655 flow [2025-03-04 10:05:44,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2025-03-04 10:05:44,521 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2025-03-04 10:05:44,521 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 655 flow [2025-03-04 10:05:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:44,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:44,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:44,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:05:44,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:44,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:44,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:44,723 INFO L85 PathProgramCache]: Analyzing trace with hash 193127029, now seen corresponding path program 1 times [2025-03-04 10:05:44,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:44,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295413089] [2025-03-04 10:05:44,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:44,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:05:44,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:05:44,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:44,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:05:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295413089] [2025-03-04 10:05:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295413089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448780968] [2025-03-04 10:05:44,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:44,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:44,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:44,805 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:44,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:05:44,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:05:44,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:05:44,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:44,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:05:44,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:44,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:05:44,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:05:44,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448780968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:44,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:44,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-03-04 10:05:44,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289821919] [2025-03-04 10:05:44,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:44,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:44,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:44,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:44,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:05:44,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 655 flow. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:44,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:44,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:05:44,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:46,084 INFO L124 PetriNetUnfolderBase]: 12943/15536 cut-off events. [2025-03-04 10:05:46,084 INFO L125 PetriNetUnfolderBase]: For 112436/112440 co-relation queries the response was YES. [2025-03-04 10:05:46,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78123 conditions, 15536 events. 12943/15536 cut-off events. For 112436/112440 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 57483 event pairs, 352 based on Foata normal form. 541/16066 useless extension candidates. Maximal degree in co-relation 68466. Up to 11160 conditions per place. [2025-03-04 10:05:46,179 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 290 selfloop transitions, 6 changer transitions 0/303 dead transitions. [2025-03-04 10:05:46,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 303 transitions, 2876 flow [2025-03-04 10:05:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-04 10:05:46,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6541666666666667 [2025-03-04 10:05:46,180 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 655 flow. Second operand 5 states and 157 transitions. [2025-03-04 10:05:46,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 303 transitions, 2876 flow [2025-03-04 10:05:46,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 303 transitions, 2803 flow, removed 20 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:46,296 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 677 flow [2025-03-04 10:05:46,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=677, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2025-03-04 10:05:46,296 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 48 predicate places. [2025-03-04 10:05:46,296 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 677 flow [2025-03-04 10:05:46,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:46,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:46,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:46,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:05:46,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:05:46,501 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-03-04 10:05:46,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2088019767, now seen corresponding path program 1 times [2025-03-04 10:05:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247993895] [2025-03-04 10:05:46,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:46,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:05:46,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:05:46,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:46,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:46,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:46,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247993895] [2025-03-04 10:05:46,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247993895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:46,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116867196] [2025-03-04 10:05:46,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:46,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:46,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:46,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:46,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:05:46,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:05:47,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:05:47,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:47,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:47,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:05:47,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:21,634 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)