./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-symm.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/chl-name-comparator-symm.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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:07:14,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:07:14,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:07:14,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:07:14,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:07:14,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:07:14,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:07:14,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:07:14,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:07:14,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:07:14,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:07:14,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:07:14,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:14,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:07:14,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:07:14,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:07:14,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:07:14,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:07:14,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:07:14,398 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2025-03-04 10:07:14,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:07:14,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:07:14,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:07:14,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:07:14,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:07:14,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-04 10:07:15,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03e73a6/f1f7b4b449f14acb9034f57963e67277/FLAG587eb4764 [2025-03-04 10:07:15,952 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:07:15,953 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2025-03-04 10:07:15,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03e73a6/f1f7b4b449f14acb9034f57963e67277/FLAG587eb4764 [2025-03-04 10:07:15,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03e73a6/f1f7b4b449f14acb9034f57963e67277 [2025-03-04 10:07:15,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:07:15,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:07:15,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:15,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:07:15,982 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:07:15,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:15" (1/1) ... [2025-03-04 10:07:15,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:15, skipping insertion in model container [2025-03-04 10:07:15,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:15" (1/1) ... [2025-03-04 10:07:16,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:07:16,137 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:07:16,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:16,146 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:07:16,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:16,183 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:07:16,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16 WrapperNode [2025-03-04 10:07:16,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:16,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:16,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:07:16,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:07:16,190 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:07:16" (1/1) ... [2025-03-04 10:07:16,196 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:07:16" (1/1) ... [2025-03-04 10:07:16,216 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 216 [2025-03-04 10:07:16,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:16,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:07:16,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:07:16,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:07:16,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,234 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,250 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:07:16,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,261 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:07:16,273 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:07:16,273 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:07:16,273 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:07:16,274 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (1/1) ... [2025-03-04 10:07:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:16,301 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:07:16,302 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:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:07:16,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:07:16,317 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:07:16,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:07:16,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:07:16,318 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:07:16,388 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:07:16,389 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:07:16,689 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:07:16,689 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:07:16,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:07:16,915 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:07:16,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:16 BoogieIcfgContainer [2025-03-04 10:07:16,915 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:07:16,918 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:07:16,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:07:16,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:07:16,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:07:15" (1/3) ... [2025-03-04 10:07:16,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0fc9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:16, skipping insertion in model container [2025-03-04 10:07:16,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:16" (2/3) ... [2025-03-04 10:07:16,923 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0fc9df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:16, skipping insertion in model container [2025-03-04 10:07:16,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:16" (3/3) ... [2025-03-04 10:07:16,925 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-04 10:07:16,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:07:16,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 33 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 10:07:16,938 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:07:16,982 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:07:17,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 37 transitions, 88 flow [2025-03-04 10:07:17,028 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-03-04 10:07:17,031 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:07:17,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 5/35 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-04 10:07:17,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 37 transitions, 88 flow [2025-03-04 10:07:17,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 34 transitions, 80 flow [2025-03-04 10:07:17,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:07:17,055 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;@6c710b5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:07:17,055 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-04 10:07:17,060 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:07:17,060 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 10:07:17,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:07:17,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:17,062 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:17,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 591908, now seen corresponding path program 1 times [2025-03-04 10:07:17,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808730262] [2025-03-04 10:07:17,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:17,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:17,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:17,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:17,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:17,272 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:07:17,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:17,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808730262] [2025-03-04 10:07:17,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808730262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:17,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:17,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:07:17,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880580130] [2025-03-04 10:07:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:17,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:17,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:17,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:17,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:17,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:07:17,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:17,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:17,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:17,408 INFO L124 PetriNetUnfolderBase]: 128/261 cut-off events. [2025-03-04 10:07:17,408 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 10:07:17,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 261 events. 128/261 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 988 event pairs, 100 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 456. Up to 221 conditions per place. [2025-03-04 10:07:17,411 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 21 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2025-03-04 10:07:17,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 116 flow [2025-03-04 10:07:17,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:17,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-03-04 10:07:17,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-04 10:07:17,424 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 80 flow. Second operand 3 states and 54 transitions. [2025-03-04 10:07:17,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 116 flow [2025-03-04 10:07:17,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:17,429 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 66 flow [2025-03-04 10:07:17,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-04 10:07:17,433 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2025-03-04 10:07:17,434 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 66 flow [2025-03-04 10:07:17,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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:07:17,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:17,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:17,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:07:17,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:17,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash 591909, now seen corresponding path program 1 times [2025-03-04 10:07:17,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:17,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704456212] [2025-03-04 10:07:17,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:17,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:17,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:17,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:17,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:17,610 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:07:17,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:17,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704456212] [2025-03-04 10:07:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704456212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:17,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:17,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:17,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127623894] [2025-03-04 10:07:17,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:17,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:17,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:17,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:07:17,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:17,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:17,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:17,723 INFO L124 PetriNetUnfolderBase]: 129/264 cut-off events. [2025-03-04 10:07:17,723 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:07:17,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 264 events. 129/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1000 event pairs, 100 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 482. Up to 226 conditions per place. [2025-03-04 10:07:17,725 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-03-04 10:07:17,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 128 flow [2025-03-04 10:07:17,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:17,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:17,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 10:07:17,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4954954954954955 [2025-03-04 10:07:17,726 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 66 flow. Second operand 3 states and 55 transitions. [2025-03-04 10:07:17,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 128 flow [2025-03-04 10:07:17,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:17,727 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 81 flow [2025-03-04 10:07:17,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2025-03-04 10:07:17,728 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2025-03-04 10:07:17,728 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 81 flow [2025-03-04 10:07:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:07:17,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:17,728 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:07:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:07:17,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash 568843702, now seen corresponding path program 1 times [2025-03-04 10:07:17,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:17,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-03-04 10:07:17,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:17,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:17,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:17,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:17,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:17,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627912524] [2025-03-04 10:07:17,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627912524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:17,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097778080] [2025-03-04 10:07:17,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:17,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:17,973 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:07:17,974 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:07:18,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:18,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:18,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:18,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:07:18,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:18,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:07:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:18,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:18,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:18,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097778080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:18,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:18,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-04 10:07:18,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262260733] [2025-03-04 10:07:18,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:07:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:18,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:07:18,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:18,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:18,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 81 flow. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:18,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:18,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:18,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:18,360 INFO L124 PetriNetUnfolderBase]: 131/270 cut-off events. [2025-03-04 10:07:18,360 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:07:18,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 270 events. 131/270 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1031 event pairs, 100 based on Foata normal form. 0/224 useless extension candidates. Maximal degree in co-relation 482. Up to 228 conditions per place. [2025-03-04 10:07:18,362 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 26 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2025-03-04 10:07:18,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 169 flow [2025-03-04 10:07:18,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 10:07:18,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2025-03-04 10:07:18,365 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 81 flow. Second operand 5 states and 80 transitions. [2025-03-04 10:07:18,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 169 flow [2025-03-04 10:07:18,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:18,367 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 122 flow [2025-03-04 10:07:18,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2025-03-04 10:07:18,368 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-04 10:07:18,368 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 122 flow [2025-03-04 10:07:18,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:18,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:18,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:18,376 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:07:18,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:18,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:18,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1215010267, now seen corresponding path program 1 times [2025-03-04 10:07:18,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:18,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560891949] [2025-03-04 10:07:18,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:18,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:18,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:07:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:07:18,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:18,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,650 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:07:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560891949] [2025-03-04 10:07:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560891949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351538648] [2025-03-04 10:07:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:18,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:18,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:18,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 10:07:18,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07:18,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 10:07:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:18,719 INFO L124 PetriNetUnfolderBase]: 131/252 cut-off events. [2025-03-04 10:07:18,719 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 10:07:18,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 252 events. 131/252 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 850 event pairs, 100 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 485. Up to 223 conditions per place. [2025-03-04 10:07:18,721 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 24 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2025-03-04 10:07:18,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 176 flow [2025-03-04 10:07:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2025-03-04 10:07:18,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3581081081081081 [2025-03-04 10:07:18,722 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 122 flow. Second operand 4 states and 53 transitions. [2025-03-04 10:07:18,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 176 flow [2025-03-04 10:07:18,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 165 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:18,723 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 117 flow [2025-03-04 10:07:18,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-03-04 10:07:18,724 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-04 10:07:18,724 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 117 flow [2025-03-04 10:07:18,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:07:18,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:18,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:18,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:07:18,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:18,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:18,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1215010268, now seen corresponding path program 1 times [2025-03-04 10:07:18,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:18,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756067365] [2025-03-04 10:07:18,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:18,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:18,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:07:18,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:07:18,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:18,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,765 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:07:18,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:18,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756067365] [2025-03-04 10:07:18,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756067365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:18,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:18,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:18,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236004558] [2025-03-04 10:07:18,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:18,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:18,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:18,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:18,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:18,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:18,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:07:18,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:18,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:18,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:18,820 INFO L124 PetriNetUnfolderBase]: 130/251 cut-off events. [2025-03-04 10:07:18,820 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 10:07:18,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 251 events. 130/251 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 834 event pairs, 100 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 488. Up to 230 conditions per place. [2025-03-04 10:07:18,822 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-04 10:07:18,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 170 flow [2025-03-04 10:07:18,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-04 10:07:18,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-03-04 10:07:18,823 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 117 flow. Second operand 3 states and 56 transitions. [2025-03-04 10:07:18,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 170 flow [2025-03-04 10:07:18,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:18,824 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 109 flow [2025-03-04 10:07:18,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-03-04 10:07:18,825 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-04 10:07:18,825 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 109 flow [2025-03-04 10:07:18,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:07:18,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:18,825 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1] [2025-03-04 10:07:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:07:18,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash 198129688, now seen corresponding path program 2 times [2025-03-04 10:07:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844458930] [2025-03-04 10:07:18,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:18,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:18,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 10:07:18,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:18,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:18,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:18,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844458930] [2025-03-04 10:07:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844458930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:18,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978440497] [2025-03-04 10:07:18,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:18,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:18,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:18,919 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:07:18,920 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:07:18,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-03-04 10:07:18,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:18,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:18,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:07:18,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:19,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978440497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:19,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:07:19,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516939801] [2025-03-04 10:07:19,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:19,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:19,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:19,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:07:19,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:19,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:07:19,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:19,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:19,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:19,121 INFO L124 PetriNetUnfolderBase]: 129/248 cut-off events. [2025-03-04 10:07:19,121 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:07:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 248 events. 129/248 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 816 event pairs, 100 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 491. Up to 223 conditions per place. [2025-03-04 10:07:19,123 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 22 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2025-03-04 10:07:19,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 157 flow [2025-03-04 10:07:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:19,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:19,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2025-03-04 10:07:19,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2025-03-04 10:07:19,124 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 109 flow. Second operand 6 states and 90 transitions. [2025-03-04 10:07:19,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 157 flow [2025-03-04 10:07:19,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 143 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:19,125 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 99 flow [2025-03-04 10:07:19,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=99, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2025-03-04 10:07:19,125 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-04 10:07:19,125 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 99 flow [2025-03-04 10:07:19,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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:07:19,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:19,125 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:19,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:07:19,326 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:07:19,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:19,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 215169773, now seen corresponding path program 1 times [2025-03-04 10:07:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:19,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-03-04 10:07:19,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:19,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:07:19,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:19,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:19,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:19,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:19,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776024483] [2025-03-04 10:07:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776024483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:19,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723398295] [2025-03-04 10:07:19,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:19,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:19,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:19,381 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:07:19,383 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:07:19,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:07:19,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:19,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:19,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:07:19,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:19,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723398295] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:19,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:19,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:07:19,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252700144] [2025-03-04 10:07:19,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:19,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:07:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:19,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:07:19,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:07:19,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:19,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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:07:19,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:19,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:19,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:19,543 INFO L124 PetriNetUnfolderBase]: 127/246 cut-off events. [2025-03-04 10:07:19,543 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:07:19,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 246 events. 127/246 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 804 event pairs, 100 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 464. Up to 222 conditions per place. [2025-03-04 10:07:19,545 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-04 10:07:19,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 147 flow [2025-03-04 10:07:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:19,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2025-03-04 10:07:19,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42702702702702705 [2025-03-04 10:07:19,546 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 99 flow. Second operand 5 states and 79 transitions. [2025-03-04 10:07:19,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 147 flow [2025-03-04 10:07:19,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 135 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:19,546 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 81 flow [2025-03-04 10:07:19,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-03-04 10:07:19,547 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2025-03-04 10:07:19,547 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 81 flow [2025-03-04 10:07:19,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 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:07:19,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:19,547 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:19,553 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:07:19,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:19,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:19,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1528654769, now seen corresponding path program 2 times [2025-03-04 10:07:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580680081] [2025-03-04 10:07:19,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:19,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:07:19,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 13 statements. [2025-03-04 10:07:19,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:19,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:19,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:19,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:19,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580680081] [2025-03-04 10:07:19,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580680081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:19,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:19,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:19,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319493193] [2025-03-04 10:07:19,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:19,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:19,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:19,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:19,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:19,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:19,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:07:19,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:19,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:19,990 INFO L124 PetriNetUnfolderBase]: 253/451 cut-off events. [2025-03-04 10:07:19,990 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:07:19,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 451 events. 253/451 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1700 event pairs, 118 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 897. Up to 254 conditions per place. [2025-03-04 10:07:19,992 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 39 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-04 10:07:19,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 204 flow [2025-03-04 10:07:19,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-04 10:07:19,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2025-03-04 10:07:19,993 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 81 flow. Second operand 5 states and 87 transitions. [2025-03-04 10:07:19,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 204 flow [2025-03-04 10:07:19,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:19,994 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 89 flow [2025-03-04 10:07:19,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-03-04 10:07:19,995 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2025-03-04 10:07:19,995 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 89 flow [2025-03-04 10:07:19,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:07:19,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:19,995 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:07:19,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -572013103, now seen corresponding path program 1 times [2025-03-04 10:07:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217698236] [2025-03-04 10:07:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:20,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:20,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:20,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:20,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217698236] [2025-03-04 10:07:20,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217698236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:20,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754060692] [2025-03-04 10:07:20,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:20,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:20,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:20,156 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:07:20,158 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:07:20,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:20,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:20,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:20,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:20,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:07:20,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:20,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:20,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:07:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:20,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754060692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:20,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-03-04 10:07:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892783813] [2025-03-04 10:07:20,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:07:20,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:20,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:07:20,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:07:20,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:20,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 89 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:07:20,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:20,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:20,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:20,921 INFO L124 PetriNetUnfolderBase]: 618/1080 cut-off events. [2025-03-04 10:07:20,921 INFO L125 PetriNetUnfolderBase]: For 196/224 co-relation queries the response was YES. [2025-03-04 10:07:20,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1080 events. 618/1080 cut-off events. For 196/224 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4675 event pairs, 228 based on Foata normal form. 0/912 useless extension candidates. Maximal degree in co-relation 2294. Up to 463 conditions per place. [2025-03-04 10:07:20,926 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 54 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-04 10:07:20,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 303 flow [2025-03-04 10:07:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:07:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:07:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2025-03-04 10:07:20,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2025-03-04 10:07:20,927 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 89 flow. Second operand 8 states and 132 transitions. [2025-03-04 10:07:20,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 303 flow [2025-03-04 10:07:20,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:20,929 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 111 flow [2025-03-04 10:07:20,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=111, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2025-03-04 10:07:20,929 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2025-03-04 10:07:20,929 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 111 flow [2025-03-04 10:07:20,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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:07:20,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:20,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:20,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:21,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:21,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:21,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash -615373990, now seen corresponding path program 1 times [2025-03-04 10:07:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56750391] [2025-03-04 10:07:21,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:07:21,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56750391] [2025-03-04 10:07:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56750391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:21,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795129405] [2025-03-04 10:07:21,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:21,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:21,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:21,354 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:07:21,356 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:07:21,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:07:21,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:21,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:21,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:21,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:07:21,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:21,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:21,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:21,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795129405] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:21,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:21,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2025-03-04 10:07:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618693343] [2025-03-04 10:07:21,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:21,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:07:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:21,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:07:21,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:07:21,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-04 10:07:21,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 111 flow. Second operand has 21 states, 21 states have (on average 10.142857142857142) internal successors, (213), 21 states have internal predecessors, (213), 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:07:21,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:21,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-04 10:07:21,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:22,333 INFO L124 PetriNetUnfolderBase]: 1165/2025 cut-off events. [2025-03-04 10:07:22,333 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2025-03-04 10:07:22,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4577 conditions, 2025 events. 1165/2025 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9979 event pairs, 318 based on Foata normal form. 0/1711 useless extension candidates. Maximal degree in co-relation 4541. Up to 628 conditions per place. [2025-03-04 10:07:22,341 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 79 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-03-04 10:07:22,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 89 transitions, 454 flow [2025-03-04 10:07:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2025-03-04 10:07:22,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2025-03-04 10:07:22,342 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 111 flow. Second operand 9 states and 153 transitions. [2025-03-04 10:07:22,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 89 transitions, 454 flow [2025-03-04 10:07:22,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 447 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:22,345 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 138 flow [2025-03-04 10:07:22,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=138, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-03-04 10:07:22,345 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2025-03-04 10:07:22,345 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 138 flow [2025-03-04 10:07:22,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.142857142857142) internal successors, (213), 21 states have internal predecessors, (213), 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:07:22,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:22,345 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:22,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:22,551 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,SelfDestructingSolverStorable9 [2025-03-04 10:07:22,551 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash 988702673, now seen corresponding path program 1 times [2025-03-04 10:07:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562335057] [2025-03-04 10:07:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:07:22,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:07:22,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562335057] [2025-03-04 10:07:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562335057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:22,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691358272] [2025-03-04 10:07:22,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:22,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:22,753 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:07:22,754 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:07:22,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:07:22,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:07:22,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:07:22,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:22,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:23,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:07:23,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:23,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691358272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:23,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:23,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2025-03-04 10:07:23,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654766119] [2025-03-04 10:07:23,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:23,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:07:23,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:23,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:07:23,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:07:23,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2025-03-04 10:07:23,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 138 flow. Second operand has 24 states, 24 states have (on average 11.5) internal successors, (276), 24 states have internal predecessors, (276), 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:07:23,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:23,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2025-03-04 10:07:23,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:23,942 INFO L124 PetriNetUnfolderBase]: 1517/2633 cut-off events. [2025-03-04 10:07:23,942 INFO L125 PetriNetUnfolderBase]: For 1312/1348 co-relation queries the response was YES. [2025-03-04 10:07:23,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6273 conditions, 2633 events. 1517/2633 cut-off events. For 1312/1348 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 13214 event pairs, 450 based on Foata normal form. 46/2311 useless extension candidates. Maximal degree in co-relation 6234. Up to 885 conditions per place. [2025-03-04 10:07:23,951 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 77 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-03-04 10:07:23,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 500 flow [2025-03-04 10:07:23,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2025-03-04 10:07:23,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46546546546546547 [2025-03-04 10:07:23,952 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 138 flow. Second operand 9 states and 155 transitions. [2025-03-04 10:07:23,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 500 flow [2025-03-04 10:07:23,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 87 transitions, 469 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:23,955 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 151 flow [2025-03-04 10:07:23,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-04 10:07:23,955 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-04 10:07:23,955 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 151 flow [2025-03-04 10:07:23,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.5) internal successors, (276), 24 states have internal predecessors, (276), 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:07:23,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:23,956 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-04 10:07:23,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:07:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:24,161 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:24,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:24,161 INFO L85 PathProgramCache]: Analyzing trace with hash -474607814, now seen corresponding path program 2 times [2025-03-04 10:07:24,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:24,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284000996] [2025-03-04 10:07:24,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:24,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:24,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:07:24,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:07:24,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:24,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:24,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284000996] [2025-03-04 10:07:24,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284000996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:24,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925608398] [2025-03-04 10:07:24,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:24,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:24,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:07:24,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:07:24,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:07:24,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:24,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:07:24,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:24,489 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:24,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925608398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:24,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:24,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-04 10:07:24,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546673382] [2025-03-04 10:07:24,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:24,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:24,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:24,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:24,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:24,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:24,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:07:24,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:24,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:24,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:24,751 INFO L124 PetriNetUnfolderBase]: 1341/2363 cut-off events. [2025-03-04 10:07:24,751 INFO L125 PetriNetUnfolderBase]: For 1339/1379 co-relation queries the response was YES. [2025-03-04 10:07:24,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5640 conditions, 2363 events. 1341/2363 cut-off events. For 1339/1379 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12102 event pairs, 20 based on Foata normal form. 0/2055 useless extension candidates. Maximal degree in co-relation 5599. Up to 595 conditions per place. [2025-03-04 10:07:24,764 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 94 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2025-03-04 10:07:24,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 100 transitions, 583 flow [2025-03-04 10:07:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2025-03-04 10:07:24,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6396396396396397 [2025-03-04 10:07:24,765 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 151 flow. Second operand 6 states and 142 transitions. [2025-03-04 10:07:24,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 100 transitions, 583 flow [2025-03-04 10:07:24,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 100 transitions, 526 flow, removed 5 selfloop flow, removed 11 redundant places. [2025-03-04 10:07:24,770 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 123 flow [2025-03-04 10:07:24,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2025-03-04 10:07:24,772 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2025-03-04 10:07:24,772 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 123 flow [2025-03-04 10:07:24,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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:07:24,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:24,772 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:24,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:07:24,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:24,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:24,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash 914719892, now seen corresponding path program 1 times [2025-03-04 10:07:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:24,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243232995] [2025-03-04 10:07:24,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:07:24,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:07:24,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:24,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243232995] [2025-03-04 10:07:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243232995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:07:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537790492] [2025-03-04 10:07:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:25,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:07:25,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:25,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:25,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:25,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,418 INFO L124 PetriNetUnfolderBase]: 1343/2417 cut-off events. [2025-03-04 10:07:25,418 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2025-03-04 10:07:25,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 2417 events. 1343/2417 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 12580 event pairs, 987 based on Foata normal form. 3/2244 useless extension candidates. Maximal degree in co-relation 5747. Up to 1808 conditions per place. [2025-03-04 10:07:25,428 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 52 selfloop transitions, 3 changer transitions 7/64 dead transitions. [2025-03-04 10:07:25,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 350 flow [2025-03-04 10:07:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2025-03-04 10:07:25,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2025-03-04 10:07:25,430 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 123 flow. Second operand 5 states and 104 transitions. [2025-03-04 10:07:25,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 350 flow [2025-03-04 10:07:25,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 329 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:25,432 INFO L231 Difference]: Finished difference. Result has 50 places, 33 transitions, 136 flow [2025-03-04 10:07:25,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=33} [2025-03-04 10:07:25,432 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2025-03-04 10:07:25,432 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 33 transitions, 136 flow [2025-03-04 10:07:25,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:25,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:25,433 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:25,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:07:25,433 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:25,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2027284642, now seen corresponding path program 2 times [2025-03-04 10:07:25,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-04 10:07:25,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:25,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:07:25,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 24 statements. [2025-03-04 10:07:25,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:25,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220577627] [2025-03-04 10:07:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220577627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:25,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:07:25,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819264911] [2025-03-04 10:07:25,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:25,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:07:25,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:25,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 33 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:25,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:25,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:25,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,854 INFO L124 PetriNetUnfolderBase]: 1344/2410 cut-off events. [2025-03-04 10:07:25,854 INFO L125 PetriNetUnfolderBase]: For 1609/1618 co-relation queries the response was YES. [2025-03-04 10:07:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6162 conditions, 2410 events. 1344/2410 cut-off events. For 1609/1618 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 12874 event pairs, 966 based on Foata normal form. 1/2235 useless extension candidates. Maximal degree in co-relation 6125. Up to 1751 conditions per place. [2025-03-04 10:07:25,863 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 58 selfloop transitions, 3 changer transitions 9/72 dead transitions. [2025-03-04 10:07:25,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 430 flow [2025-03-04 10:07:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 10:07:25,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5783783783783784 [2025-03-04 10:07:25,865 INFO L175 Difference]: Start difference. First operand has 50 places, 33 transitions, 136 flow. Second operand 5 states and 107 transitions. [2025-03-04 10:07:25,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 430 flow [2025-03-04 10:07:25,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 410 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:25,867 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 148 flow [2025-03-04 10:07:25,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-04 10:07:25,868 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2025-03-04 10:07:25,868 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 148 flow [2025-03-04 10:07:25,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:25,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:25,868 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:25,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:07:25,869 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:25,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:25,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1970936384, now seen corresponding path program 3 times [2025-03-04 10:07:25,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:25,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-03-04 10:07:25,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:25,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-04 10:07:25,883 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 24 statements. [2025-03-04 10:07:25,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:07:25,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:26,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119004414] [2025-03-04 10:07:26,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119004414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:26,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:26,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:07:26,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506699307] [2025-03-04 10:07:26,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:26,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:26,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:26,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:26,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:07:26,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:26,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:26,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:26,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:26,341 INFO L124 PetriNetUnfolderBase]: 1441/2581 cut-off events. [2025-03-04 10:07:26,341 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-03-04 10:07:26,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7052 conditions, 2581 events. 1441/2581 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13572 event pairs, 993 based on Foata normal form. 3/2584 useless extension candidates. Maximal degree in co-relation 7013. Up to 1839 conditions per place. [2025-03-04 10:07:26,356 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 56 selfloop transitions, 10 changer transitions 5/73 dead transitions. [2025-03-04 10:07:26,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 445 flow [2025-03-04 10:07:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-04 10:07:26,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-04 10:07:26,357 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 148 flow. Second operand 5 states and 110 transitions. [2025-03-04 10:07:26,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 445 flow [2025-03-04 10:07:26,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 421 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:26,360 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 235 flow [2025-03-04 10:07:26,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2025-03-04 10:07:26,362 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2025-03-04 10:07:26,362 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 235 flow [2025-03-04 10:07:26,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:26,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,362 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:07:26,362 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:26,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,363 INFO L85 PathProgramCache]: Analyzing trace with hash -151228002, now seen corresponding path program 4 times [2025-03-04 10:07:26,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855409705] [2025-03-04 10:07:26,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:26,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,369 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:07:26,377 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:07:26,377 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:07:26,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:26,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855409705] [2025-03-04 10:07:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855409705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:26,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:07:26,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288968704] [2025-03-04 10:07:26,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:26,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:26,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:26,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:26,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:07:26,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:26,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:26,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:26,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:26,835 INFO L124 PetriNetUnfolderBase]: 1455/2603 cut-off events. [2025-03-04 10:07:26,836 INFO L125 PetriNetUnfolderBase]: For 3222/3222 co-relation queries the response was YES. [2025-03-04 10:07:26,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7760 conditions, 2603 events. 1455/2603 cut-off events. For 3222/3222 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 13864 event pairs, 976 based on Foata normal form. 3/2606 useless extension candidates. Maximal degree in co-relation 7719. Up to 1835 conditions per place. [2025-03-04 10:07:26,846 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 62 selfloop transitions, 11 changer transitions 5/80 dead transitions. [2025-03-04 10:07:26,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 562 flow [2025-03-04 10:07:26,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:26,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-04 10:07:26,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:07:26,847 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 235 flow. Second operand 5 states and 111 transitions. [2025-03-04 10:07:26,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 562 flow [2025-03-04 10:07:26,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:26,852 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 332 flow [2025-03-04 10:07:26,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2025-03-04 10:07:26,853 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2025-03-04 10:07:26,853 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 332 flow [2025-03-04 10:07:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:26,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,853 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:07:26,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:26,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -443765887, now seen corresponding path program 2 times [2025-03-04 10:07:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576875880] [2025-03-04 10:07:26,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:26,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:07:26,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:07:26,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:26,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576875880] [2025-03-04 10:07:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576875880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553350057] [2025-03-04 10:07:27,034 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:27,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:27,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:27,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:27,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:07:27,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:07:27,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:07:27,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:07:27,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:27,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553350057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-04 10:07:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890235269] [2025-03-04 10:07:27,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:27,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:07:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:27,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:07:27,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:27,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:27,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:27,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:27,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:27,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:27,399 INFO L124 PetriNetUnfolderBase]: 1349/2410 cut-off events. [2025-03-04 10:07:27,399 INFO L125 PetriNetUnfolderBase]: For 4240/4240 co-relation queries the response was YES. [2025-03-04 10:07:27,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7494 conditions, 2410 events. 1349/2410 cut-off events. For 4240/4240 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 12279 event pairs, 107 based on Foata normal form. 44/2454 useless extension candidates. Maximal degree in co-relation 7450. Up to 696 conditions per place. [2025-03-04 10:07:27,408 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 96 selfloop transitions, 7 changer transitions 1/105 dead transitions. [2025-03-04 10:07:27,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 821 flow [2025-03-04 10:07:27,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-04 10:07:27,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2025-03-04 10:07:27,409 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 332 flow. Second operand 6 states and 135 transitions. [2025-03-04 10:07:27,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 821 flow [2025-03-04 10:07:27,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 787 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:27,415 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 308 flow [2025-03-04 10:07:27,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2025-03-04 10:07:27,416 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2025-03-04 10:07:27,416 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 308 flow [2025-03-04 10:07:27,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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:07:27,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:27,416 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:27,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:27,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:07:27,617 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash 292779309, now seen corresponding path program 1 times [2025-03-04 10:07:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:27,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577193498] [2025-03-04 10:07:27,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:27,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:27,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:07:27,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:27,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577193498] [2025-03-04 10:07:27,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577193498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:27,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853141811] [2025-03-04 10:07:27,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:27,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:27,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:27,686 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:27,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:07:27,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:07:27,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:27,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:07:27,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:27,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853141811] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:27,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:27,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 10:07:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465890004] [2025-03-04 10:07:27,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:27,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:27,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:27,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:27,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:07:27,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:27,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:27,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:27,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:27,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:28,155 INFO L124 PetriNetUnfolderBase]: 1487/2647 cut-off events. [2025-03-04 10:07:28,155 INFO L125 PetriNetUnfolderBase]: For 3942/3942 co-relation queries the response was YES. [2025-03-04 10:07:28,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8179 conditions, 2647 events. 1487/2647 cut-off events. For 3942/3942 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 14176 event pairs, 91 based on Foata normal form. 33/2680 useless extension candidates. Maximal degree in co-relation 8138. Up to 1450 conditions per place. [2025-03-04 10:07:28,166 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 72 selfloop transitions, 25 changer transitions 4/102 dead transitions. [2025-03-04 10:07:28,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 817 flow [2025-03-04 10:07:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-04 10:07:28,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.528957528957529 [2025-03-04 10:07:28,168 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 308 flow. Second operand 7 states and 137 transitions. [2025-03-04 10:07:28,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 817 flow [2025-03-04 10:07:28,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 102 transitions, 788 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:28,175 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 521 flow [2025-03-04 10:07:28,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=521, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2025-03-04 10:07:28,175 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2025-03-04 10:07:28,175 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 521 flow [2025-03-04 10:07:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:28,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:28,176 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:28,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:07:28,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:07:28,376 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1405582044, now seen corresponding path program 1 times [2025-03-04 10:07:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357723586] [2025-03-04 10:07:28,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:07:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:28,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357723586] [2025-03-04 10:07:28,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357723586] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:28,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625769971] [2025-03-04 10:07:28,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:28,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:28,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:07:28,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:07:28,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:28,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:28,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:28,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:07:28,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:28,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625769971] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:28,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:28,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-03-04 10:07:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326464492] [2025-03-04 10:07:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:28,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:28,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:28,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:07:28,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:28,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:28,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:28,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:28,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:28,834 INFO L124 PetriNetUnfolderBase]: 1616/2866 cut-off events. [2025-03-04 10:07:28,835 INFO L125 PetriNetUnfolderBase]: For 7472/7472 co-relation queries the response was YES. [2025-03-04 10:07:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9847 conditions, 2866 events. 1616/2866 cut-off events. For 7472/7472 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15234 event pairs, 209 based on Foata normal form. 30/2896 useless extension candidates. Maximal degree in co-relation 9802. Up to 1481 conditions per place. [2025-03-04 10:07:28,845 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 78 selfloop transitions, 38 changer transitions 4/121 dead transitions. [2025-03-04 10:07:28,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 121 transitions, 1151 flow [2025-03-04 10:07:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2025-03-04 10:07:28,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5173745173745173 [2025-03-04 10:07:28,846 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 521 flow. Second operand 7 states and 134 transitions. [2025-03-04 10:07:28,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 121 transitions, 1151 flow [2025-03-04 10:07:28,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1119 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-04 10:07:28,858 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 823 flow [2025-03-04 10:07:28,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=823, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2025-03-04 10:07:28,858 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 42 predicate places. [2025-03-04 10:07:28,858 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 823 flow [2025-03-04 10:07:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:28,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:28,859 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:28,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:29,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,059 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:29,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 134405626, now seen corresponding path program 2 times [2025-03-04 10:07:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:29,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386992893] [2025-03-04 10:07:29,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:29,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:07:29,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:29,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:29,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:29,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386992893] [2025-03-04 10:07:29,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386992893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:29,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:29,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:29,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721350061] [2025-03-04 10:07:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:29,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:29,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:29,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:29,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 823 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:29,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:29,472 INFO L124 PetriNetUnfolderBase]: 1618/2883 cut-off events. [2025-03-04 10:07:29,473 INFO L125 PetriNetUnfolderBase]: For 11744/11744 co-relation queries the response was YES. [2025-03-04 10:07:29,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10766 conditions, 2883 events. 1618/2883 cut-off events. For 11744/11744 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15869 event pairs, 977 based on Foata normal form. 6/2889 useless extension candidates. Maximal degree in co-relation 10716. Up to 1951 conditions per place. [2025-03-04 10:07:29,488 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 96 selfloop transitions, 17 changer transitions 1/115 dead transitions. [2025-03-04 10:07:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 1243 flow [2025-03-04 10:07:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-04 10:07:29,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-04 10:07:29,492 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 823 flow. Second operand 5 states and 110 transitions. [2025-03-04 10:07:29,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 1243 flow [2025-03-04 10:07:29,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 115 transitions, 1211 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-03-04 10:07:29,513 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 865 flow [2025-03-04 10:07:29,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=865, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-03-04 10:07:29,514 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 48 predicate places. [2025-03-04 10:07:29,514 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 865 flow [2025-03-04 10:07:29,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:29,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:29,515 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:29,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:07:29,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:29,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1315454920, now seen corresponding path program 3 times [2025-03-04 10:07:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972439365] [2025-03-04 10:07:29,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:29,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:07:29,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-04 10:07:29,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:29,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972439365] [2025-03-04 10:07:29,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972439365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679697180] [2025-03-04 10:07:29,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:29,602 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:29,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:07:29,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:07:29,670 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-04 10:07:29,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:29,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:07:29,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:29,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:29,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:29,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:29,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679697180] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:29,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:29,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 10:07:29,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581546446] [2025-03-04 10:07:29,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:29,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:29,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:29,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:29,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:07:29,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:29,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 865 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:29,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:29,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:30,090 INFO L124 PetriNetUnfolderBase]: 1729/3060 cut-off events. [2025-03-04 10:07:30,090 INFO L125 PetriNetUnfolderBase]: For 12275/12275 co-relation queries the response was YES. [2025-03-04 10:07:30,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11423 conditions, 3060 events. 1729/3060 cut-off events. For 12275/12275 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 16905 event pairs, 917 based on Foata normal form. 30/3090 useless extension candidates. Maximal degree in co-relation 11370. Up to 1707 conditions per place. [2025-03-04 10:07:30,100 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 82 selfloop transitions, 32 changer transitions 7/122 dead transitions. [2025-03-04 10:07:30,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 122 transitions, 1314 flow [2025-03-04 10:07:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-04 10:07:30,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108108108108108 [2025-03-04 10:07:30,102 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 865 flow. Second operand 5 states and 113 transitions. [2025-03-04 10:07:30,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 122 transitions, 1314 flow [2025-03-04 10:07:30,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 122 transitions, 1285 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:30,123 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 955 flow [2025-03-04 10:07:30,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=955, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-04 10:07:30,123 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 52 predicate places. [2025-03-04 10:07:30,124 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 955 flow [2025-03-04 10:07:30,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:30,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:30,124 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:30,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:30,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:07:30,325 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:30,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash 103833201, now seen corresponding path program 2 times [2025-03-04 10:07:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:30,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-04 10:07:30,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:30,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:30,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:07:30,338 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 27 statements. [2025-03-04 10:07:30,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:30,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:30,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:30,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550319165] [2025-03-04 10:07:30,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550319165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:30,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:30,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:30,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359863315] [2025-03-04 10:07:30,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:30,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:30,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:30,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:30,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:30,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:30,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 955 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:30,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:30,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:30,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:30,713 INFO L124 PetriNetUnfolderBase]: 1928/3399 cut-off events. [2025-03-04 10:07:30,713 INFO L125 PetriNetUnfolderBase]: For 17758/17758 co-relation queries the response was YES. [2025-03-04 10:07:30,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13390 conditions, 3399 events. 1928/3399 cut-off events. For 17758/17758 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19171 event pairs, 1053 based on Foata normal form. 33/3432 useless extension candidates. Maximal degree in co-relation 13335. Up to 2003 conditions per place. [2025-03-04 10:07:30,729 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 97 selfloop transitions, 31 changer transitions 7/136 dead transitions. [2025-03-04 10:07:30,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 136 transitions, 1580 flow [2025-03-04 10:07:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-04 10:07:30,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 10:07:30,731 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 955 flow. Second operand 7 states and 147 transitions. [2025-03-04 10:07:30,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 136 transitions, 1580 flow [2025-03-04 10:07:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 136 transitions, 1484 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:30,761 INFO L231 Difference]: Finished difference. Result has 91 places, 96 transitions, 1151 flow [2025-03-04 10:07:30,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1151, PETRI_PLACES=91, PETRI_TRANSITIONS=96} [2025-03-04 10:07:30,761 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 55 predicate places. [2025-03-04 10:07:30,761 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 96 transitions, 1151 flow [2025-03-04 10:07:30,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:30,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:30,761 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:30,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:07:30,761 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:30,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 994925326, now seen corresponding path program 4 times [2025-03-04 10:07:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:30,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919555507] [2025-03-04 10:07:30,763 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:30,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:30,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:07:30,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:30,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:07:30,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919555507] [2025-03-04 10:07:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919555507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:30,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:30,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:30,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44556822] [2025-03-04 10:07:30,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:30,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:30,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:30,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:30,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:30,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:30,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 96 transitions, 1151 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:30,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:30,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:30,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,141 INFO L124 PetriNetUnfolderBase]: 1923/3403 cut-off events. [2025-03-04 10:07:31,141 INFO L125 PetriNetUnfolderBase]: For 17280/17280 co-relation queries the response was YES. [2025-03-04 10:07:31,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13392 conditions, 3403 events. 1923/3403 cut-off events. For 17280/17280 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 18910 event pairs, 1104 based on Foata normal form. 6/3409 useless extension candidates. Maximal degree in co-relation 13336. Up to 2170 conditions per place. [2025-03-04 10:07:31,157 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 104 selfloop transitions, 22 changer transitions 1/128 dead transitions. [2025-03-04 10:07:31,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1604 flow [2025-03-04 10:07:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:31,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-04 10:07:31,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2025-03-04 10:07:31,158 INFO L175 Difference]: Start difference. First operand has 91 places, 96 transitions, 1151 flow. Second operand 5 states and 108 transitions. [2025-03-04 10:07:31,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1604 flow [2025-03-04 10:07:31,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 128 transitions, 1551 flow, removed 16 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:31,188 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 1239 flow [2025-03-04 10:07:31,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1239, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2025-03-04 10:07:31,189 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 58 predicate places. [2025-03-04 10:07:31,189 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 1239 flow [2025-03-04 10:07:31,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:31,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:31,189 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:31,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:07:31,189 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:31,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:31,190 INFO L85 PathProgramCache]: Analyzing trace with hash -897876192, now seen corresponding path program 5 times [2025-03-04 10:07:31,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:31,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133162917] [2025-03-04 10:07:31,190 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:07:31,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:31,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:07:31,203 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:07:31,205 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:07:31,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133162917] [2025-03-04 10:07:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133162917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:07:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377880995] [2025-03-04 10:07:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:31,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:31,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:31,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:31,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 1239 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:31,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:31,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,612 INFO L124 PetriNetUnfolderBase]: 1901/3340 cut-off events. [2025-03-04 10:07:31,612 INFO L125 PetriNetUnfolderBase]: For 17570/17570 co-relation queries the response was YES. [2025-03-04 10:07:31,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13488 conditions, 3340 events. 1901/3340 cut-off events. For 17570/17570 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 18291 event pairs, 970 based on Foata normal form. 30/3370 useless extension candidates. Maximal degree in co-relation 13429. Up to 1885 conditions per place. [2025-03-04 10:07:31,628 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 102 selfloop transitions, 33 changer transitions 9/145 dead transitions. [2025-03-04 10:07:31,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 145 transitions, 1770 flow [2025-03-04 10:07:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:07:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:07:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2025-03-04 10:07:31,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 10:07:31,629 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 1239 flow. Second operand 7 states and 148 transitions. [2025-03-04 10:07:31,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 145 transitions, 1770 flow [2025-03-04 10:07:31,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 1737 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:31,663 INFO L231 Difference]: Finished difference. Result has 102 places, 107 transitions, 1379 flow [2025-03-04 10:07:31,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1379, PETRI_PLACES=102, PETRI_TRANSITIONS=107} [2025-03-04 10:07:31,664 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 66 predicate places. [2025-03-04 10:07:31,664 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 107 transitions, 1379 flow [2025-03-04 10:07:31,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:31,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:31,664 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:07:31,664 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1915613571, now seen corresponding path program 3 times [2025-03-04 10:07:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-03-04 10:07:31,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:31,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:07:31,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-04 10:07:31,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-03-04 10:07:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040802508] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721427649] [2025-03-04 10:07:31,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:31,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:31,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:31,735 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:31,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:07:31,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-04 10:07:31,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 27 statements. [2025-03-04 10:07:31,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:31,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:07:31,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:31,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:31,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721427649] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:31,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:07:31,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-03-04 10:07:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174144032] [2025-03-04 10:07:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:31,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:07:31,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:31,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 107 transitions, 1379 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:31,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:31,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:32,222 INFO L124 PetriNetUnfolderBase]: 1839/3218 cut-off events. [2025-03-04 10:07:32,223 INFO L125 PetriNetUnfolderBase]: For 18188/18188 co-relation queries the response was YES. [2025-03-04 10:07:32,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13220 conditions, 3218 events. 1839/3218 cut-off events. For 18188/18188 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 17465 event pairs, 840 based on Foata normal form. 33/3251 useless extension candidates. Maximal degree in co-relation 13158. Up to 1861 conditions per place. [2025-03-04 10:07:32,238 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 85 selfloop transitions, 42 changer transitions 6/134 dead transitions. [2025-03-04 10:07:32,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 134 transitions, 1797 flow [2025-03-04 10:07:32,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:07:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:07:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-04 10:07:32,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 10:07:32,240 INFO L175 Difference]: Start difference. First operand has 102 places, 107 transitions, 1379 flow. Second operand 5 states and 105 transitions. [2025-03-04 10:07:32,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 134 transitions, 1797 flow [2025-03-04 10:07:32,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 134 transitions, 1646 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-03-04 10:07:32,275 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 1319 flow [2025-03-04 10:07:32,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1319, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-03-04 10:07:32,275 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 60 predicate places. [2025-03-04 10:07:32,276 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 1319 flow [2025-03-04 10:07:32,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:07:32,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,276 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:32,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 10:07:32,477 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:32,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2006737179, now seen corresponding path program 1 times [2025-03-04 10:07:32,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904001858] [2025-03-04 10:07:32,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:07:32,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:32,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904001858] [2025-03-04 10:07:32,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904001858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:32,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458326252] [2025-03-04 10:07:32,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:32,987 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:32,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:07:33,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:07:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:33,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:33,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:07:33,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:33,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 131 [2025-03-04 10:07:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:33,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:34,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:07:34,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 165 [2025-03-04 10:07:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458326252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:35,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:35,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 10:07:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628821358] [2025-03-04 10:07:35,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:35,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:07:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:35,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:07:35,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:07:35,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:35,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 1319 flow. Second operand has 25 states, 25 states have (on average 12.64) internal successors, (316), 25 states have internal predecessors, (316), 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:07:35,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:35,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:35,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:39,317 INFO L124 PetriNetUnfolderBase]: 2694/4750 cut-off events. [2025-03-04 10:07:39,318 INFO L125 PetriNetUnfolderBase]: For 24285/24285 co-relation queries the response was YES. [2025-03-04 10:07:39,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19833 conditions, 4750 events. 2694/4750 cut-off events. For 24285/24285 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 28698 event pairs, 515 based on Foata normal form. 8/4758 useless extension candidates. Maximal degree in co-relation 19775. Up to 980 conditions per place. [2025-03-04 10:07:39,380 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 235 selfloop transitions, 228 changer transitions 37/501 dead transitions. [2025-03-04 10:07:39,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 501 transitions, 5450 flow [2025-03-04 10:07:39,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 10:07:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-04 10:07:39,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 840 transitions. [2025-03-04 10:07:39,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2025-03-04 10:07:39,382 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 1319 flow. Second operand 48 states and 840 transitions. [2025-03-04 10:07:39,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 501 transitions, 5450 flow [2025-03-04 10:07:39,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 501 transitions, 4939 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:39,432 INFO L231 Difference]: Finished difference. Result has 153 places, 278 transitions, 3995 flow [2025-03-04 10:07:39,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1184, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3995, PETRI_PLACES=153, PETRI_TRANSITIONS=278} [2025-03-04 10:07:39,433 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 117 predicate places. [2025-03-04 10:07:39,433 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 278 transitions, 3995 flow [2025-03-04 10:07:39,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.64) internal successors, (316), 25 states have internal predecessors, (316), 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:07:39,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:39,433 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:39,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:07:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:07:39,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:39,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:39,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2086512605, now seen corresponding path program 2 times [2025-03-04 10:07:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168513467] [2025-03-04 10:07:39,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:39,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:39,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-04 10:07:39,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:39,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:40,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168513467] [2025-03-04 10:07:40,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168513467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:40,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:40,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:07:40,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631633681] [2025-03-04 10:07:40,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:40,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:07:40,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:40,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:07:40,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:07:40,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:40,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 278 transitions, 3995 flow. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 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:07:40,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:40,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:40,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:40,874 INFO L124 PetriNetUnfolderBase]: 2766/4867 cut-off events. [2025-03-04 10:07:40,875 INFO L125 PetriNetUnfolderBase]: For 31968/31968 co-relation queries the response was YES. [2025-03-04 10:07:40,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23118 conditions, 4867 events. 2766/4867 cut-off events. For 31968/31968 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 29754 event pairs, 1553 based on Foata normal form. 1/4868 useless extension candidates. Maximal degree in co-relation 23043. Up to 3608 conditions per place. [2025-03-04 10:07:40,897 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 275 selfloop transitions, 51 changer transitions 7/334 dead transitions. [2025-03-04 10:07:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 334 transitions, 5063 flow [2025-03-04 10:07:40,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2025-03-04 10:07:40,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4945945945945946 [2025-03-04 10:07:40,898 INFO L175 Difference]: Start difference. First operand has 153 places, 278 transitions, 3995 flow. Second operand 10 states and 183 transitions. [2025-03-04 10:07:40,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 334 transitions, 5063 flow [2025-03-04 10:07:41,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 334 transitions, 4586 flow, removed 223 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:41,030 INFO L231 Difference]: Finished difference. Result has 155 places, 288 transitions, 3818 flow [2025-03-04 10:07:41,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3556, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3818, PETRI_PLACES=155, PETRI_TRANSITIONS=288} [2025-03-04 10:07:41,030 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 119 predicate places. [2025-03-04 10:07:41,030 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 288 transitions, 3818 flow [2025-03-04 10:07:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 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:07:41,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:41,030 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:41,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:07:41,031 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:41,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:41,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1633412713, now seen corresponding path program 3 times [2025-03-04 10:07:41,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:41,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990477056] [2025-03-04 10:07:41,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:41,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:41,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:41,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-04 10:07:41,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:41,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990477056] [2025-03-04 10:07:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990477056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925054540] [2025-03-04 10:07:41,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:41,546 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:41,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:07:41,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:41,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-04 10:07:41,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:41,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:41,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:07:41,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:41,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 132 [2025-03-04 10:07:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:41,978 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:43,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:07:43,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 318 treesize of output 222 [2025-03-04 10:07:43,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925054540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:43,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:43,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-03-04 10:07:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709588420] [2025-03-04 10:07:43,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:43,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:07:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:43,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:07:43,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:07:44,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:44,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 288 transitions, 3818 flow. Second operand has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 22 states have internal predecessors, (282), 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:07:44,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:44,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:44,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:46,452 INFO L124 PetriNetUnfolderBase]: 3320/5830 cut-off events. [2025-03-04 10:07:46,452 INFO L125 PetriNetUnfolderBase]: For 35346/35346 co-relation queries the response was YES. [2025-03-04 10:07:46,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26978 conditions, 5830 events. 3320/5830 cut-off events. For 35346/35346 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 37057 event pairs, 921 based on Foata normal form. 8/5838 useless extension candidates. Maximal degree in co-relation 26905. Up to 2185 conditions per place. [2025-03-04 10:07:46,484 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 177 selfloop transitions, 306 changer transitions 24/508 dead transitions. [2025-03-04 10:07:46,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 508 transitions, 6685 flow [2025-03-04 10:07:46,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:07:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:07:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 511 transitions. [2025-03-04 10:07:46,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4603603603603604 [2025-03-04 10:07:46,486 INFO L175 Difference]: Start difference. First operand has 155 places, 288 transitions, 3818 flow. Second operand 30 states and 511 transitions. [2025-03-04 10:07:46,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 508 transitions, 6685 flow [2025-03-04 10:07:46,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 508 transitions, 6605 flow, removed 23 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:46,617 INFO L231 Difference]: Finished difference. Result has 190 places, 384 transitions, 6071 flow [2025-03-04 10:07:46,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3762, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6071, PETRI_PLACES=190, PETRI_TRANSITIONS=384} [2025-03-04 10:07:46,618 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 154 predicate places. [2025-03-04 10:07:46,618 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 384 transitions, 6071 flow [2025-03-04 10:07:46,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.818181818181818) internal successors, (282), 22 states have internal predecessors, (282), 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:07:46,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:46,618 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:46,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:46,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:46,822 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:46,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:46,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1700180941, now seen corresponding path program 4 times [2025-03-04 10:07:46,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:46,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-03-04 10:07:46,824 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:46,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:46,829 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:46,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:46,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:07:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:47,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30568027] [2025-03-04 10:07:47,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30568027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:47,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951962966] [2025-03-04 10:07:47,249 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:47,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:47,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:47,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:47,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:07:47,302 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:47,326 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:47,326 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:07:47,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:47,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:07:47,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:47,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 131 [2025-03-04 10:07:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:47,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:49,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:07:49,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 252 [2025-03-04 10:07:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:50,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951962966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:50,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:50,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-04 10:07:50,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94074824] [2025-03-04 10:07:50,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:50,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:07:50,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:50,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:07:50,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:07:50,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:50,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 384 transitions, 6071 flow. Second operand has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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:07:50,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:50,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:50,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:55,258 INFO L124 PetriNetUnfolderBase]: 4209/7679 cut-off events. [2025-03-04 10:07:55,259 INFO L125 PetriNetUnfolderBase]: For 74958/74958 co-relation queries the response was YES. [2025-03-04 10:07:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40790 conditions, 7679 events. 4209/7679 cut-off events. For 74958/74958 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 53482 event pairs, 795 based on Foata normal form. 17/7696 useless extension candidates. Maximal degree in co-relation 40705. Up to 2202 conditions per place. [2025-03-04 10:07:55,305 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 295 selfloop transitions, 505 changer transitions 63/864 dead transitions. [2025-03-04 10:07:55,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 864 transitions, 12213 flow [2025-03-04 10:07:55,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-04 10:07:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2025-03-04 10:07:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 1113 transitions. [2025-03-04 10:07:55,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4489713594191206 [2025-03-04 10:07:55,307 INFO L175 Difference]: Start difference. First operand has 190 places, 384 transitions, 6071 flow. Second operand 67 states and 1113 transitions. [2025-03-04 10:07:55,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 864 transitions, 12213 flow [2025-03-04 10:07:55,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 864 transitions, 11803 flow, removed 116 selfloop flow, removed 13 redundant places. [2025-03-04 10:07:55,787 INFO L231 Difference]: Finished difference. Result has 256 places, 591 transitions, 10749 flow [2025-03-04 10:07:55,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5803, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=309, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=67, PETRI_FLOW=10749, PETRI_PLACES=256, PETRI_TRANSITIONS=591} [2025-03-04 10:07:55,788 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 220 predicate places. [2025-03-04 10:07:55,788 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 591 transitions, 10749 flow [2025-03-04 10:07:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 12.6) internal successors, (315), 25 states have internal predecessors, (315), 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:07:55,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:55,788 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:55,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:07:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:07:55,989 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:55,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:55,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1285070619, now seen corresponding path program 5 times [2025-03-04 10:07:55,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:55,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-03-04 10:07:55,990 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:07:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:55,996 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:56,009 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:56,009 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:07:56,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:56,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169968780] [2025-03-04 10:07:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169968780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:07:56,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861300920] [2025-03-04 10:07:56,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:56,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:07:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:07:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:07:56,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:07:56,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 591 transitions, 10749 flow. Second operand has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:07:56,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:56,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:07:56,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:57,860 INFO L124 PetriNetUnfolderBase]: 4241/7719 cut-off events. [2025-03-04 10:07:57,860 INFO L125 PetriNetUnfolderBase]: For 92974/92974 co-relation queries the response was YES. [2025-03-04 10:07:57,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45618 conditions, 7719 events. 4241/7719 cut-off events. For 92974/92974 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 53977 event pairs, 2307 based on Foata normal form. 1/7720 useless extension candidates. Maximal degree in co-relation 45522. Up to 6134 conditions per place. [2025-03-04 10:07:57,915 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 557 selfloop transitions, 90 changer transitions 12/660 dead transitions. [2025-03-04 10:07:57,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 660 transitions, 12759 flow [2025-03-04 10:07:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:07:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:07:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2025-03-04 10:07:57,916 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49385749385749383 [2025-03-04 10:07:57,916 INFO L175 Difference]: Start difference. First operand has 256 places, 591 transitions, 10749 flow. Second operand 11 states and 201 transitions. [2025-03-04 10:07:57,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 660 transitions, 12759 flow [2025-03-04 10:07:59,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 660 transitions, 11946 flow, removed 393 selfloop flow, removed 8 redundant places. [2025-03-04 10:07:59,144 INFO L231 Difference]: Finished difference. Result has 256 places, 605 transitions, 10562 flow [2025-03-04 10:07:59,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10050, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10562, PETRI_PLACES=256, PETRI_TRANSITIONS=605} [2025-03-04 10:07:59,145 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 220 predicate places. [2025-03-04 10:07:59,145 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 605 transitions, 10562 flow [2025-03-04 10:07:59,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.083333333333334) internal successors, (145), 12 states have internal predecessors, (145), 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:07:59,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:59,145 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:59,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 10:07:59,145 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:07:59,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:59,146 INFO L85 PathProgramCache]: Analyzing trace with hash 839949755, now seen corresponding path program 6 times [2025-03-04 10:07:59,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:59,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877196141] [2025-03-04 10:07:59,146 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:07:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:59,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:59,167 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:07:59,167 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:07:59,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:07:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877196141] [2025-03-04 10:07:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877196141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774239015] [2025-03-04 10:07:59,609 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:07:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:59,611 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:59,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:07:59,665 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:59,686 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-04 10:07:59,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 10:07:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:59,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:07:59,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:00,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 78 [2025-03-04 10:08:00,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:00,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:01,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 417 treesize of output 257 [2025-03-04 10:08:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:01,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774239015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:01,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:01,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 22 [2025-03-04 10:08:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499177891] [2025-03-04 10:08:01,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:01,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:08:01,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:01,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:08:01,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:08:01,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:01,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 605 transitions, 10562 flow. Second operand has 22 states, 22 states have (on average 12.772727272727273) internal successors, (281), 22 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:01,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:01,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:01,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:04,139 INFO L124 PetriNetUnfolderBase]: 4242/7822 cut-off events. [2025-03-04 10:08:04,139 INFO L125 PetriNetUnfolderBase]: For 65539/65539 co-relation queries the response was YES. [2025-03-04 10:08:04,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42593 conditions, 7822 events. 4242/7822 cut-off events. For 65539/65539 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 55336 event pairs, 1252 based on Foata normal form. 5/7827 useless extension candidates. Maximal degree in co-relation 42497. Up to 3390 conditions per place. [2025-03-04 10:08:04,193 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 183 selfloop transitions, 506 changer transitions 26/716 dead transitions. [2025-03-04 10:08:04,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 716 transitions, 12641 flow [2025-03-04 10:08:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:08:04,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:08:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 391 transitions. [2025-03-04 10:08:04,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48034398034398035 [2025-03-04 10:08:04,194 INFO L175 Difference]: Start difference. First operand has 256 places, 605 transitions, 10562 flow. Second operand 22 states and 391 transitions. [2025-03-04 10:08:04,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 716 transitions, 12641 flow [2025-03-04 10:08:04,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 716 transitions, 12375 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-03-04 10:08:04,689 INFO L231 Difference]: Finished difference. Result has 274 places, 625 transitions, 12267 flow [2025-03-04 10:08:04,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10293, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12267, PETRI_PLACES=274, PETRI_TRANSITIONS=625} [2025-03-04 10:08:04,689 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 238 predicate places. [2025-03-04 10:08:04,689 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 625 transitions, 12267 flow [2025-03-04 10:08:04,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 12.772727272727273) internal successors, (281), 22 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:04,690 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:04,690 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:04,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:08:04,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:04,890 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:08:04,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash 337561289, now seen corresponding path program 7 times [2025-03-04 10:08:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504319474] [2025-03-04 10:08:04,891 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:08:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:04,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:08:04,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:04,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:04,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:05,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504319474] [2025-03-04 10:08:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504319474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921086679] [2025-03-04 10:08:05,327 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:08:05,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:05,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:05,329 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:05,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:08:05,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:08:05,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:05,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:05,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:05,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 10:08:05,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:05,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 135 [2025-03-04 10:08:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:05,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:07,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:07,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 197 [2025-03-04 10:08:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921086679] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:07,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-03-04 10:08:07,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040708247] [2025-03-04 10:08:07,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:07,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:08:07,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:07,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:08:07,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:08:07,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:07,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 625 transitions, 12267 flow. Second operand has 26 states, 26 states have (on average 12.5) internal successors, (325), 26 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:07,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:07,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:07,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:11,768 INFO L124 PetriNetUnfolderBase]: 4646/8609 cut-off events. [2025-03-04 10:08:11,768 INFO L125 PetriNetUnfolderBase]: For 85903/85903 co-relation queries the response was YES. [2025-03-04 10:08:11,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50716 conditions, 8609 events. 4646/8609 cut-off events. For 85903/85903 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 62110 event pairs, 1295 based on Foata normal form. 11/8620 useless extension candidates. Maximal degree in co-relation 50616. Up to 3244 conditions per place. [2025-03-04 10:08:11,827 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 273 selfloop transitions, 617 changer transitions 35/926 dead transitions. [2025-03-04 10:08:11,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 926 transitions, 17404 flow [2025-03-04 10:08:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 10:08:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-04 10:08:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 637 transitions. [2025-03-04 10:08:11,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47822822822822825 [2025-03-04 10:08:11,829 INFO L175 Difference]: Start difference. First operand has 274 places, 625 transitions, 12267 flow. Second operand 36 states and 637 transitions. [2025-03-04 10:08:11,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 926 transitions, 17404 flow [2025-03-04 10:08:12,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 926 transitions, 17207 flow, removed 32 selfloop flow, removed 8 redundant places. [2025-03-04 10:08:12,520 INFO L231 Difference]: Finished difference. Result has 310 places, 750 transitions, 16657 flow [2025-03-04 10:08:12,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=12123, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=499, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=16657, PETRI_PLACES=310, PETRI_TRANSITIONS=750} [2025-03-04 10:08:12,521 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 274 predicate places. [2025-03-04 10:08:12,521 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 750 transitions, 16657 flow [2025-03-04 10:08:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 12.5) internal successors, (325), 26 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:12,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:12,521 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:12,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:08:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:12,722 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:08:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1897490181, now seen corresponding path program 8 times [2025-03-04 10:08:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437737527] [2025-03-04 10:08:12,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:12,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:12,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:08:12,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:12,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:12,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437737527] [2025-03-04 10:08:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437737527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422225504] [2025-03-04 10:08:13,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:08:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:13,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:13,667 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:13,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:08:13,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:08:13,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:13,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:08:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:08:13,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:14,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 76 [2025-03-04 10:08:14,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:14,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:15,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:15,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 268 treesize of output 184 [2025-03-04 10:08:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422225504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:15,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:15,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2025-03-04 10:08:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67628243] [2025-03-04 10:08:15,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:15,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 10:08:15,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:15,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 10:08:15,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 10:08:16,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:16,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 750 transitions, 16657 flow. Second operand has 33 states, 33 states have (on average 12.030303030303031) internal successors, (397), 33 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:16,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:16,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:16,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:19,971 INFO L124 PetriNetUnfolderBase]: 4724/8746 cut-off events. [2025-03-04 10:08:19,971 INFO L125 PetriNetUnfolderBase]: For 113960/113960 co-relation queries the response was YES. [2025-03-04 10:08:20,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57132 conditions, 8746 events. 4724/8746 cut-off events. For 113960/113960 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 63343 event pairs, 1116 based on Foata normal form. 1/8747 useless extension candidates. Maximal degree in co-relation 57022. Up to 2527 conditions per place. [2025-03-04 10:08:20,046 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 522 selfloop transitions, 522 changer transitions 21/1066 dead transitions. [2025-03-04 10:08:20,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1066 transitions, 23430 flow [2025-03-04 10:08:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:08:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 10:08:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 609 transitions. [2025-03-04 10:08:20,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2025-03-04 10:08:20,050 INFO L175 Difference]: Start difference. First operand has 310 places, 750 transitions, 16657 flow. Second operand 35 states and 609 transitions. [2025-03-04 10:08:20,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1066 transitions, 23430 flow [2025-03-04 10:08:21,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1066 transitions, 22468 flow, removed 238 selfloop flow, removed 11 redundant places. [2025-03-04 10:08:21,154 INFO L231 Difference]: Finished difference. Result has 345 places, 835 transitions, 19160 flow [2025-03-04 10:08:21,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15918, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=750, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=19160, PETRI_PLACES=345, PETRI_TRANSITIONS=835} [2025-03-04 10:08:21,155 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 309 predicate places. [2025-03-04 10:08:21,155 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 835 transitions, 19160 flow [2025-03-04 10:08:21,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 12.030303030303031) internal successors, (397), 33 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:21,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:21,156 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:21,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:08:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:21,356 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:08:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -268698587, now seen corresponding path program 9 times [2025-03-04 10:08:21,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:21,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230536443] [2025-03-04 10:08:21,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:21,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:21,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:08:21,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-04 10:08:21,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:21,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230536443] [2025-03-04 10:08:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230536443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362387620] [2025-03-04 10:08:21,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:08:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:21,904 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:21,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:08:21,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:08:21,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 30 statements. [2025-03-04 10:08:21,990 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:08:21,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:21,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:08:21,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:22,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 89 [2025-03-04 10:08:22,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:22,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:23,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:23,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 170 [2025-03-04 10:08:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362387620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:23,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-03-04 10:08:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017294244] [2025-03-04 10:08:23,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:23,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:08:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:23,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:08:23,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:08:23,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:23,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 835 transitions, 19160 flow. Second operand has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:23,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:23,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:23,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:27,035 INFO L124 PetriNetUnfolderBase]: 4740/8930 cut-off events. [2025-03-04 10:08:27,036 INFO L125 PetriNetUnfolderBase]: For 121964/121964 co-relation queries the response was YES. [2025-03-04 10:08:27,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63135 conditions, 8930 events. 4740/8930 cut-off events. For 121964/121964 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 66252 event pairs, 1677 based on Foata normal form. 3/8933 useless extension candidates. Maximal degree in co-relation 63016. Up to 4701 conditions per place. [2025-03-04 10:08:27,112 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 460 selfloop transitions, 528 changer transitions 17/1006 dead transitions. [2025-03-04 10:08:27,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 1006 transitions, 23398 flow [2025-03-04 10:08:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:08:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 10:08:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 378 transitions. [2025-03-04 10:08:27,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4643734643734644 [2025-03-04 10:08:27,114 INFO L175 Difference]: Start difference. First operand has 345 places, 835 transitions, 19160 flow. Second operand 22 states and 378 transitions. [2025-03-04 10:08:27,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 1006 transitions, 23398 flow [2025-03-04 10:08:28,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 1006 transitions, 22427 flow, removed 124 selfloop flow, removed 8 redundant places. [2025-03-04 10:08:28,439 INFO L231 Difference]: Finished difference. Result has 364 places, 894 transitions, 21231 flow [2025-03-04 10:08:28,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18301, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=835, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=470, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21231, PETRI_PLACES=364, PETRI_TRANSITIONS=894} [2025-03-04 10:08:28,440 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 328 predicate places. [2025-03-04 10:08:28,440 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 894 transitions, 21231 flow [2025-03-04 10:08:28,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 12.392857142857142) internal successors, (347), 28 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:28,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:28,441 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:28,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:08:28,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:28,641 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:08:28,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1874204645, now seen corresponding path program 10 times [2025-03-04 10:08:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:28,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520363035] [2025-03-04 10:08:28,642 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:28,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:28,647 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:08:28,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:28,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:28,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:29,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:29,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520363035] [2025-03-04 10:08:29,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520363035] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:29,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092890627] [2025-03-04 10:08:29,032 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:08:29,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:29,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:29,034 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:29,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:08:29,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:08:29,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:29,115 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:08:29,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:29,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:08:29,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:29,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 104 [2025-03-04 10:08:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:29,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:30,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:30,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 247 treesize of output 159 [2025-03-04 10:08:30,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092890627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:30,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-03-04 10:08:30,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820229586] [2025-03-04 10:08:30,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:30,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:08:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:30,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:08:30,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:08:31,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:31,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 894 transitions, 21231 flow. Second operand has 24 states, 24 states have (on average 12.666666666666666) internal successors, (304), 24 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:31,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:31,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:31,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:35,196 INFO L124 PetriNetUnfolderBase]: 4803/9043 cut-off events. [2025-03-04 10:08:35,196 INFO L125 PetriNetUnfolderBase]: For 126851/126851 co-relation queries the response was YES. [2025-03-04 10:08:35,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64776 conditions, 9043 events. 4803/9043 cut-off events. For 126851/126851 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 67164 event pairs, 1032 based on Foata normal form. 6/9049 useless extension candidates. Maximal degree in co-relation 64651. Up to 2980 conditions per place. [2025-03-04 10:08:35,262 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 284 selfloop transitions, 767 changer transitions 25/1077 dead transitions. [2025-03-04 10:08:35,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1077 transitions, 25435 flow [2025-03-04 10:08:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:08:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-04 10:08:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 566 transitions. [2025-03-04 10:08:35,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46355446355446356 [2025-03-04 10:08:35,264 INFO L175 Difference]: Start difference. First operand has 364 places, 894 transitions, 21231 flow. Second operand 33 states and 566 transitions. [2025-03-04 10:08:35,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1077 transitions, 25435 flow [2025-03-04 10:08:36,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 1077 transitions, 25273 flow, removed 58 selfloop flow, removed 8 redundant places. [2025-03-04 10:08:36,508 INFO L231 Difference]: Finished difference. Result has 391 places, 953 transitions, 24337 flow [2025-03-04 10:08:36,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21082, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=893, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=707, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=24337, PETRI_PLACES=391, PETRI_TRANSITIONS=953} [2025-03-04 10:08:36,509 INFO L279 CegarLoopForPetriNet]: 36 programPoint places, 355 predicate places. [2025-03-04 10:08:36,509 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 953 transitions, 24337 flow [2025-03-04 10:08:36,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 12.666666666666666) internal successors, (304), 24 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:36,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:36,509 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:36,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:08:36,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 10:08:36,710 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-04 10:08:36,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:36,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1730721147, now seen corresponding path program 11 times [2025-03-04 10:08:36,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:36,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213097162] [2025-03-04 10:08:36,711 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:36,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:36,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:08:36,724 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:36,724 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:08:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213097162] [2025-03-04 10:08:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213097162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535815282] [2025-03-04 10:08:37,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:08:37,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:37,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:37,247 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:37,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:08:37,304 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:08:37,323 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:08:37,324 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:08:37,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:37,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-04 10:08:37,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:37,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 132 [2025-03-04 10:08:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:37,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:38,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:08:38,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 397 treesize of output 261 [2025-03-04 10:08:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 10:08:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535815282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:39,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:39,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 31 [2025-03-04 10:08:39,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9054205] [2025-03-04 10:08:39,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:39,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:08:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:39,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:08:39,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=785, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:08:39,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2025-03-04 10:08:39,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 953 transitions, 24337 flow. Second operand has 31 states, 31 states have (on average 12.35483870967742) internal successors, (383), 31 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:39,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:39,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2025-03-04 10:08:39,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand