./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:28:43,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:28:43,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:28:43,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:28:43,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:28:43,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:28:43,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:28:43,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:28:43,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:28:43,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:28:43,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:28:43,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:28:43,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:28:43,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:28:43,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:28:43,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:28:43,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:28:43,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:28:43,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:28:43,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:28:43,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:28:43,928 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:28:43,928 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:28:43,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:28:43,928 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:28:43,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:43,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:28:43,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:28:43,929 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 -> d2a575889db2e07e0d6a3fd2f8635ba39d2afc2713d706bcd4d4aaa862bed792 [2025-03-09 01:28:44,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:28:44,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:28:44,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:28:44,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:28:44,157 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:28:44,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-09 01:28:45,276 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b081f4cfd/3c37d211fb114604a739427699a0133b/FLAG35f067901 [2025-03-09 01:28:45,518 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:28:45,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-send-receive-alt.wvr.c [2025-03-09 01:28:45,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b081f4cfd/3c37d211fb114604a739427699a0133b/FLAG35f067901 [2025-03-09 01:28:45,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b081f4cfd/3c37d211fb114604a739427699a0133b [2025-03-09 01:28:45,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:28:45,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:28:45,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:45,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:28:45,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:28:45,588 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e63df99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45, skipping insertion in model container [2025-03-09 01:28:45,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:28:45,728 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-09 01:28:45,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:45,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:28:45,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:28:45,764 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:28:45,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45 WrapperNode [2025-03-09 01:28:45,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:28:45,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:45,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:28:45,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:28:45,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,793 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 136 [2025-03-09 01:28:45,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:28:45,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:28:45,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:28:45,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:28:45,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,814 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 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-09 01:28:45,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:28:45,826 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:28:45,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:28:45,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:28:45,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (1/1) ... [2025-03-09 01:28:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:28:45,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:45,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:28:45,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:28:45,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:28:45,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:28:45,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:28:45,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:28:45,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:28:45,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:28:45,873 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:28:45,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:28:45,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:28:46,156 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:28:46,157 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:28:46,307 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:28:46,307 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:28:46,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:46 BoogieIcfgContainer [2025-03-09 01:28:46,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:28:46,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:28:46,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:28:46,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:28:46,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:28:45" (1/3) ... [2025-03-09 01:28:46,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07bd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:46, skipping insertion in model container [2025-03-09 01:28:46,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:28:45" (2/3) ... [2025-03-09 01:28:46,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f07bd4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:28:46, skipping insertion in model container [2025-03-09 01:28:46,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:28:46" (3/3) ... [2025-03-09 01:28:46,317 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive-alt.wvr.c [2025-03-09 01:28:46,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:28:46,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive-alt.wvr.c that has 3 procedures, 38 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-09 01:28:46,328 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:28:46,371 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:28:46,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 100 flow [2025-03-09 01:28:46,419 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2025-03-09 01:28:46,421 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:28:46,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 6/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-09 01:28:46,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 100 flow [2025-03-09 01:28:46,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 40 transitions, 92 flow [2025-03-09 01:28:46,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:28:46,445 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;@3b421274, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:28:46,445 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-09 01:28:46,447 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:28:46,448 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:28:46,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:28:46,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:46,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:46,448 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:46,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 383345, now seen corresponding path program 1 times [2025-03-09 01:28:46,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585083299] [2025-03-09 01:28:46,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:46,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:46,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:46,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:46,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:46,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585083299] [2025-03-09 01:28:46,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585083299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:46,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:46,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201640260] [2025-03-09 01:28:46,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:46,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:46,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:46,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:46,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-09 01:28:46,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 92 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-09 01:28:46,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:46,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-09 01:28:46,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:46,828 INFO L124 PetriNetUnfolderBase]: 308/550 cut-off events. [2025-03-09 01:28:46,828 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 01:28:46,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 550 events. 308/550 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2440 event pairs, 250 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1005. Up to 497 conditions per place. [2025-03-09 01:28:46,836 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 27 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2025-03-09 01:28:46,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 140 flow [2025-03-09 01:28:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-03-09 01:28:46,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46511627906976744 [2025-03-09 01:28:46,853 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 92 flow. Second operand 3 states and 60 transitions. [2025-03-09 01:28:46,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 140 flow [2025-03-09 01:28:46,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:46,858 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 78 flow [2025-03-09 01:28:46,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2025-03-09 01:28:46,863 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-03-09 01:28:46,863 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 78 flow [2025-03-09 01:28:46,863 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-09 01:28:46,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:46,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:28:46,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:28:46,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:46,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash 383346, now seen corresponding path program 1 times [2025-03-09 01:28:46,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:46,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878321467] [2025-03-09 01:28:46,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:46,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:46,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:28:46,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:28:46,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:46,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:47,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878321467] [2025-03-09 01:28:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878321467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:47,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908166010] [2025-03-09 01:28:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:47,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:47,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:47,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-09 01:28:47,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 78 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-09 01:28:47,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:47,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-09 01:28:47,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:47,278 INFO L124 PetriNetUnfolderBase]: 309/553 cut-off events. [2025-03-09 01:28:47,278 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:28:47,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 553 events. 309/553 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2447 event pairs, 250 based on Foata normal form. 0/378 useless extension candidates. Maximal degree in co-relation 1049. Up to 502 conditions per place. [2025-03-09 01:28:47,283 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2025-03-09 01:28:47,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 152 flow [2025-03-09 01:28:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-09 01:28:47,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4069767441860465 [2025-03-09 01:28:47,285 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 78 flow. Second operand 4 states and 70 transitions. [2025-03-09 01:28:47,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 152 flow [2025-03-09 01:28:47,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:47,286 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 101 flow [2025-03-09 01:28:47,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2025-03-09 01:28:47,287 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-03-09 01:28:47,287 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 101 flow [2025-03-09 01:28:47,287 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-09 01:28:47,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:47,287 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:28:47,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:28:47,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:47,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 368407906, now seen corresponding path program 1 times [2025-03-09 01:28:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157475601] [2025-03-09 01:28:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:47,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157475601] [2025-03-09 01:28:47,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157475601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:47,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028585048] [2025-03-09 01:28:47,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:47,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:47,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:47,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:47,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:28:47,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:28:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:28:47,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:47,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:28:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:47,622 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-09 01:28:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:47,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:47,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028585048] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:47,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:28:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522442420] [2025-03-09 01:28:47,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:47,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:28:47,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:47,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:28:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:28:47,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-09 01:28:47,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:47,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:47,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-09 01:28:47,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,024 INFO L124 PetriNetUnfolderBase]: 310/555 cut-off events. [2025-03-09 01:28:48,024 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:28:48,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087 conditions, 555 events. 310/555 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2445 event pairs, 250 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 1056. Up to 499 conditions per place. [2025-03-09 01:28:48,029 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 25 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2025-03-09 01:28:48,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 179 flow [2025-03-09 01:28:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:28:48,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:28:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2025-03-09 01:28:48,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3168604651162791 [2025-03-09 01:28:48,030 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 101 flow. Second operand 8 states and 109 transitions. [2025-03-09 01:28:48,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 179 flow [2025-03-09 01:28:48,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:48,031 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 126 flow [2025-03-09 01:28:48,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2025-03-09 01:28:48,032 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-03-09 01:28:48,032 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 126 flow [2025-03-09 01:28:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:28:48,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:48,238 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:48,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1909659701, now seen corresponding path program 1 times [2025-03-09 01:28:48,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6377114] [2025-03-09 01:28:48,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:28:48,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:28:48,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6377114] [2025-03-09 01:28:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6377114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:28:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654405994] [2025-03-09 01:28:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:48,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:48,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:48,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 126 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-09 01:28:48,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:48,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,422 INFO L124 PetriNetUnfolderBase]: 405/745 cut-off events. [2025-03-09 01:28:48,422 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:28:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 745 events. 405/745 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3454 event pairs, 186 based on Foata normal form. 22/527 useless extension candidates. Maximal degree in co-relation 1428. Up to 420 conditions per place. [2025-03-09 01:28:48,425 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 50 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-09 01:28:48,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 270 flow [2025-03-09 01:28:48,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:48,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 01:28:48,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2025-03-09 01:28:48,426 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 126 flow. Second operand 3 states and 80 transitions. [2025-03-09 01:28:48,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 270 flow [2025-03-09 01:28:48,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 228 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:28:48,428 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 107 flow [2025-03-09 01:28:48,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2025-03-09 01:28:48,428 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-09 01:28:48,428 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 107 flow [2025-03-09 01:28:48,428 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-09 01:28:48,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:28:48,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash -456551036, now seen corresponding path program 1 times [2025-03-09 01:28:48,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513795899] [2025-03-09 01:28:48,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:28:48,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:28:48,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513795899] [2025-03-09 01:28:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513795899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:48,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136096099] [2025-03-09 01:28:48,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:48,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:48,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:48,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-03-09 01:28:48,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-03-09 01:28:48,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,583 INFO L124 PetriNetUnfolderBase]: 304/571 cut-off events. [2025-03-09 01:28:48,583 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-09 01:28:48,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1202 conditions, 571 events. 304/571 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2462 event pairs, 246 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 466. Up to 511 conditions per place. [2025-03-09 01:28:48,587 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 30 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2025-03-09 01:28:48,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 167 flow [2025-03-09 01:28:48,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-03-09 01:28:48,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37790697674418605 [2025-03-09 01:28:48,589 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 107 flow. Second operand 4 states and 65 transitions. [2025-03-09 01:28:48,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 167 flow [2025-03-09 01:28:48,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:28:48,590 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 104 flow [2025-03-09 01:28:48,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2025-03-09 01:28:48,591 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-03-09 01:28:48,591 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 104 flow [2025-03-09 01:28:48,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:28:48,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:48,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash -456551035, now seen corresponding path program 1 times [2025-03-09 01:28:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840677180] [2025-03-09 01:28:48,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:28:48,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:28:48,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:48,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840677180] [2025-03-09 01:28:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840677180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:48,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057573633] [2025-03-09 01:28:48,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:48,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:48,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:48,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:48,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:48,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:48,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:48,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:48,780 INFO L124 PetriNetUnfolderBase]: 371/708 cut-off events. [2025-03-09 01:28:48,780 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-09 01:28:48,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 708 events. 371/708 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3160 event pairs, 314 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 1155. Up to 516 conditions per place. [2025-03-09 01:28:48,783 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 45 selfloop transitions, 3 changer transitions 1/54 dead transitions. [2025-03-09 01:28:48,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 236 flow [2025-03-09 01:28:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-03-09 01:28:48,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4941860465116279 [2025-03-09 01:28:48,784 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 104 flow. Second operand 4 states and 85 transitions. [2025-03-09 01:28:48,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 236 flow [2025-03-09 01:28:48,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:48,786 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 108 flow [2025-03-09 01:28:48,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2025-03-09 01:28:48,786 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2025-03-09 01:28:48,786 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 108 flow [2025-03-09 01:28:48,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:48,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:48,787 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:48,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:28:48,787 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:48,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:48,787 INFO L85 PathProgramCache]: Analyzing trace with hash -851465323, now seen corresponding path program 1 times [2025-03-09 01:28:48,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975644050] [2025-03-09 01:28:48,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:48,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:28:48,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:28:48,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:48,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975644050] [2025-03-09 01:28:48,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975644050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:48,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676019202] [2025-03-09 01:28:48,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:48,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:48,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:48,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:28:49,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:28:49,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:28:49,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:28:49,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:49,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:28:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676019202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:28:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-09 01:28:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740794309] [2025-03-09 01:28:49,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:28:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:28:49,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:28:49,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:49,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:49,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,294 INFO L124 PetriNetUnfolderBase]: 282/565 cut-off events. [2025-03-09 01:28:49,294 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-09 01:28:49,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 565 events. 282/565 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2431 event pairs, 202 based on Foata normal form. 48/548 useless extension candidates. Maximal degree in co-relation 877. Up to 438 conditions per place. [2025-03-09 01:28:49,296 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 29 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2025-03-09 01:28:49,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 193 flow [2025-03-09 01:28:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:49,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2025-03-09 01:28:49,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39069767441860465 [2025-03-09 01:28:49,301 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 108 flow. Second operand 5 states and 84 transitions. [2025-03-09 01:28:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 193 flow [2025-03-09 01:28:49,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:49,302 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 113 flow [2025-03-09 01:28:49,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-03-09 01:28:49,303 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-03-09 01:28:49,303 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 113 flow [2025-03-09 01:28:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,315 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-09 01:28:49,503 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,SelfDestructingSolverStorable6 [2025-03-09 01:28:49,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:49,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,504 INFO L85 PathProgramCache]: Analyzing trace with hash 193345697, now seen corresponding path program 1 times [2025-03-09 01:28:49,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176274805] [2025-03-09 01:28:49,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:28:49,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:28:49,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:28:49,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:49,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176274805] [2025-03-09 01:28:49,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176274805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:49,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:28:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508712181] [2025-03-09 01:28:49,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:49,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:49,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:49,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:49,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:49,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:49,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:49,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:49,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:49,623 INFO L124 PetriNetUnfolderBase]: 356/673 cut-off events. [2025-03-09 01:28:49,624 INFO L125 PetriNetUnfolderBase]: For 271/271 co-relation queries the response was YES. [2025-03-09 01:28:49,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 673 events. 356/673 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2792 event pairs, 220 based on Foata normal form. 3/603 useless extension candidates. Maximal degree in co-relation 1228. Up to 462 conditions per place. [2025-03-09 01:28:49,627 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 38 selfloop transitions, 2 changer transitions 5/50 dead transitions. [2025-03-09 01:28:49,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 247 flow [2025-03-09 01:28:49,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-09 01:28:49,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5271317829457365 [2025-03-09 01:28:49,628 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 113 flow. Second operand 3 states and 68 transitions. [2025-03-09 01:28:49,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 247 flow [2025-03-09 01:28:49,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 50 transitions, 223 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:49,630 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 104 flow [2025-03-09 01:28:49,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-03-09 01:28:49,631 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-03-09 01:28:49,631 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 104 flow [2025-03-09 01:28:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:49,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:49,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:49,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:28:49,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:49,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:49,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1882503627, now seen corresponding path program 1 times [2025-03-09 01:28:49,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:49,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079932715] [2025-03-09 01:28:49,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:49,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:49,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:28:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:28:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:50,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079932715] [2025-03-09 01:28:50,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079932715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:50,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119661323] [2025-03-09 01:28:50,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:50,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:50,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:50,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:28:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:28:50,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:28:50,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:50,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:50,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:28:50,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:50,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:28:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:50,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:50,578 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 61 treesize of output 55 [2025-03-09 01:28:50,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:28:50,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 78 treesize of output 68 [2025-03-09 01:28:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119661323] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:50,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:50,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-09 01:28:50,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938496283] [2025-03-09 01:28:50,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:50,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:28:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:50,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:28:50,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:28:50,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:50,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 104 flow. Second operand has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:50,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:50,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:50,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:51,864 INFO L124 PetriNetUnfolderBase]: 1418/2716 cut-off events. [2025-03-09 01:28:51,864 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2025-03-09 01:28:51,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 2716 events. 1418/2716 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 16841 event pairs, 331 based on Foata normal form. 3/2410 useless extension candidates. Maximal degree in co-relation 3764. Up to 500 conditions per place. [2025-03-09 01:28:51,873 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 141 selfloop transitions, 36 changer transitions 62/244 dead transitions. [2025-03-09 01:28:51,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 244 transitions, 1154 flow [2025-03-09 01:28:51,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:28:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:28:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 449 transitions. [2025-03-09 01:28:51,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49723145071982283 [2025-03-09 01:28:51,875 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 104 flow. Second operand 21 states and 449 transitions. [2025-03-09 01:28:51,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 244 transitions, 1154 flow [2025-03-09 01:28:51,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 244 transitions, 1120 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:51,881 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 380 flow [2025-03-09 01:28:51,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=380, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2025-03-09 01:28:51,883 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2025-03-09 01:28:51,883 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 380 flow [2025-03-09 01:28:51,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 13.473684210526315) internal successors, (256), 19 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:51,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:51,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:51,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:28:52,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:52,085 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash 496735981, now seen corresponding path program 1 times [2025-03-09 01:28:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597034604] [2025-03-09 01:28:52,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:52,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:28:52,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:28:52,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:52,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:28:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597034604] [2025-03-09 01:28:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597034604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:52,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:52,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:28:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713237259] [2025-03-09 01:28:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:52,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:28:52,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:52,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:28:52,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:28:52,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2025-03-09 01:28:52,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:52,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:52,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2025-03-09 01:28:52,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:52,317 INFO L124 PetriNetUnfolderBase]: 1592/2821 cut-off events. [2025-03-09 01:28:52,318 INFO L125 PetriNetUnfolderBase]: For 3490/3490 co-relation queries the response was YES. [2025-03-09 01:28:52,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7476 conditions, 2821 events. 1592/2821 cut-off events. For 3490/3490 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16064 event pairs, 896 based on Foata normal form. 44/2664 useless extension candidates. Maximal degree in co-relation 6655. Up to 2035 conditions per place. [2025-03-09 01:28:52,329 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 68 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2025-03-09 01:28:52,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 546 flow [2025-03-09 01:28:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:28:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:28:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-09 01:28:52,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2025-03-09 01:28:52,333 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 380 flow. Second operand 3 states and 64 transitions. [2025-03-09 01:28:52,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 546 flow [2025-03-09 01:28:52,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 76 transitions, 511 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-09 01:28:52,351 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 288 flow [2025-03-09 01:28:52,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-03-09 01:28:52,352 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2025-03-09 01:28:52,352 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 288 flow [2025-03-09 01:28:52,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:52,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:52,352 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:52,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:28:52,353 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:52,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:52,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2053040541, now seen corresponding path program 2 times [2025-03-09 01:28:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:52,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314536290] [2025-03-09 01:28:52,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:52,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:52,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:28:52,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:28:52,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:52,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314536290] [2025-03-09 01:28:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314536290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860743366] [2025-03-09 01:28:52,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:28:52,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:52,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:52,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:52,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:28:52,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-09 01:28:52,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:28:52,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:52,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:52,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:28:52,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:52,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:28:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860743366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:52,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2025-03-09 01:28:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955167413] [2025-03-09 01:28:52,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:28:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:52,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:28:52,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:28:52,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:52,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 288 flow. Second operand has 16 states, 16 states have (on average 14.3125) internal successors, (229), 16 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:52,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:52,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:52,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:53,081 INFO L124 PetriNetUnfolderBase]: 1138/2197 cut-off events. [2025-03-09 01:28:53,081 INFO L125 PetriNetUnfolderBase]: For 2394/2394 co-relation queries the response was YES. [2025-03-09 01:28:53,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 2197 events. 1138/2197 cut-off events. For 2394/2394 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13129 event pairs, 652 based on Foata normal form. 26/2073 useless extension candidates. Maximal degree in co-relation 5105. Up to 1171 conditions per place. [2025-03-09 01:28:53,088 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 32 selfloop transitions, 7 changer transitions 60/105 dead transitions. [2025-03-09 01:28:53,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 614 flow [2025-03-09 01:28:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:28:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:28:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2025-03-09 01:28:53,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43023255813953487 [2025-03-09 01:28:53,090 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 288 flow. Second operand 10 states and 185 transitions. [2025-03-09 01:28:53,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 614 flow [2025-03-09 01:28:53,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 599 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-09 01:28:53,099 INFO L231 Difference]: Finished difference. Result has 72 places, 45 transitions, 224 flow [2025-03-09 01:28:53,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=224, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2025-03-09 01:28:53,100 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2025-03-09 01:28:53,100 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 45 transitions, 224 flow [2025-03-09 01:28:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.3125) internal successors, (229), 16 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:53,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:53,101 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:53,108 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-09 01:28:53,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:53,301 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 702596569, now seen corresponding path program 3 times [2025-03-09 01:28:53,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:53,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073337149] [2025-03-09 01:28:53,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:53,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:53,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:53,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 33 statements. [2025-03-09 01:28:53,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:53,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:28:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073337149] [2025-03-09 01:28:53,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073337149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:53,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462505837] [2025-03-09 01:28:53,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:28:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:53,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:28:53,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:28:53,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes. [2025-03-09 01:28:53,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 33 statements. [2025-03-09 01:28:53,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:28:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:53,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:28:53,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:28:53,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:28:53,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462505837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:53,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2025-03-09 01:28:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469979169] [2025-03-09 01:28:53,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:53,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:28:53,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:53,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:28:53,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:28:53,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:53,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 45 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:53,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:53,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:53,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:53,713 INFO L124 PetriNetUnfolderBase]: 1184/2280 cut-off events. [2025-03-09 01:28:53,713 INFO L125 PetriNetUnfolderBase]: For 4845/4845 co-relation queries the response was YES. [2025-03-09 01:28:53,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6524 conditions, 2280 events. 1184/2280 cut-off events. For 4845/4845 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 12858 event pairs, 461 based on Foata normal form. 22/2155 useless extension candidates. Maximal degree in co-relation 6485. Up to 786 conditions per place. [2025-03-09 01:28:53,721 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 59 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2025-03-09 01:28:53,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 533 flow [2025-03-09 01:28:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:53,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-09 01:28:53,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5406976744186046 [2025-03-09 01:28:53,723 INFO L175 Difference]: Start difference. First operand has 72 places, 45 transitions, 224 flow. Second operand 4 states and 93 transitions. [2025-03-09 01:28:53,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 533 flow [2025-03-09 01:28:53,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 447 flow, removed 36 selfloop flow, removed 12 redundant places. [2025-03-09 01:28:53,732 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 298 flow [2025-03-09 01:28:53,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-03-09 01:28:53,734 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-03-09 01:28:53,734 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 298 flow [2025-03-09 01:28:53,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:53,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:53,735 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:53,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:28:53,935 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,SelfDestructingSolverStorable11 [2025-03-09 01:28:53,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:53,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -529358573, now seen corresponding path program 4 times [2025-03-09 01:28:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255019928] [2025-03-09 01:28:53,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:53,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:53,942 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:28:53,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:28:53,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:28:54,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255019928] [2025-03-09 01:28:54,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255019928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055959980] [2025-03-09 01:28:54,741 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:28:54,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:54,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:54,743 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-09 01:28:54,743 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-09 01:28:54,779 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 01:28:54,809 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 01:28:54,810 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:28:54,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:54,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:28:54,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 01:28:54,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:55,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:28:55,026 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 40 treesize of output 24 [2025-03-09 01:28:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 01:28:55,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055959980] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:55,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:28:55,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 6] total 16 [2025-03-09 01:28:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742399794] [2025-03-09 01:28:55,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:28:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:28:55,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:28:55,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:55,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:55,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,330 INFO L124 PetriNetUnfolderBase]: 1433/2666 cut-off events. [2025-03-09 01:28:55,331 INFO L125 PetriNetUnfolderBase]: For 2875/2883 co-relation queries the response was YES. [2025-03-09 01:28:55,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7058 conditions, 2666 events. 1433/2666 cut-off events. For 2875/2883 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 14677 event pairs, 381 based on Foata normal form. 7/2497 useless extension candidates. Maximal degree in co-relation 3919. Up to 862 conditions per place. [2025-03-09 01:28:55,340 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 66 selfloop transitions, 12 changer transitions 14/98 dead transitions. [2025-03-09 01:28:55,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 98 transitions, 658 flow [2025-03-09 01:28:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:28:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:28:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-09 01:28:55,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5302325581395348 [2025-03-09 01:28:55,341 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 298 flow. Second operand 5 states and 114 transitions. [2025-03-09 01:28:55,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 98 transitions, 658 flow [2025-03-09 01:28:55,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 98 transitions, 636 flow, removed 11 selfloop flow, removed 0 redundant places. [2025-03-09 01:28:55,344 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 346 flow [2025-03-09 01:28:55,344 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2025-03-09 01:28:55,344 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2025-03-09 01:28:55,344 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 346 flow [2025-03-09 01:28:55,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,344 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,350 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-09 01:28:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:55,545 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:55,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1127163775, now seen corresponding path program 5 times [2025-03-09 01:28:55,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310790034] [2025-03-09 01:28:55,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:28:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,555 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 3 equivalence classes. [2025-03-09 01:28:55,566 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 38 statements. [2025-03-09 01:28:55,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:28:55,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 01:28:55,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310790034] [2025-03-09 01:28:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310790034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:28:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:28:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:28:55,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434451406] [2025-03-09 01:28:55,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:28:55,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:28:55,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:55,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:28:55,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:28:55,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43 [2025-03-09 01:28:55,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:55,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43 [2025-03-09 01:28:55,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:28:55,846 INFO L124 PetriNetUnfolderBase]: 2506/4357 cut-off events. [2025-03-09 01:28:55,847 INFO L125 PetriNetUnfolderBase]: For 5433/5433 co-relation queries the response was YES. [2025-03-09 01:28:55,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11673 conditions, 4357 events. 2506/4357 cut-off events. For 5433/5433 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 23566 event pairs, 437 based on Foata normal form. 220/4245 useless extension candidates. Maximal degree in co-relation 7042. Up to 2213 conditions per place. [2025-03-09 01:28:55,866 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 75 selfloop transitions, 4 changer transitions 3/84 dead transitions. [2025-03-09 01:28:55,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 703 flow [2025-03-09 01:28:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:28:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:28:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-09 01:28:55,867 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4418604651162791 [2025-03-09 01:28:55,867 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 346 flow. Second operand 4 states and 76 transitions. [2025-03-09 01:28:55,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 703 flow [2025-03-09 01:28:55,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 665 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-09 01:28:55,872 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 347 flow [2025-03-09 01:28:55,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-09 01:28:55,872 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2025-03-09 01:28:55,872 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 347 flow [2025-03-09 01:28:55,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:28:55,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:28:55,872 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:28:55,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:28:55,873 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:28:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:28:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash 493571637, now seen corresponding path program 1 times [2025-03-09 01:28:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:28:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715616792] [2025-03-09 01:28:55,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:55,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:28:55,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:28:55,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:55,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:55,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:56,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:28:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715616792] [2025-03-09 01:28:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715616792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:28:56,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765086414] [2025-03-09 01:28:56,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:28:56,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:28:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:28:56,514 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-09 01:28:56,516 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-09 01:28:56,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:28:56,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:28:56,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:28:56,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:28:56,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:28:56,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:28:56,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:28:56,931 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-09 01:28:56,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-03-09 01:28:56,941 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:56,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:28:57,746 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 104 [2025-03-09 01:28:57,789 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-03-09 01:28:57,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 196 [2025-03-09 01:28:58,642 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:28:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765086414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:28:58,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:28:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2025-03-09 01:28:58,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82978961] [2025-03-09 01:28:58,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:28:58,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 01:28:58,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:28:58,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 01:28:58,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-09 01:28:58,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:28:58,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 347 flow. Second operand has 31 states, 31 states have (on average 12.806451612903226) internal successors, (397), 31 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-09 01:28:58,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:28:58,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:28:58,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:02,362 INFO L124 PetriNetUnfolderBase]: 6018/11400 cut-off events. [2025-03-09 01:29:02,362 INFO L125 PetriNetUnfolderBase]: For 16549/16553 co-relation queries the response was YES. [2025-03-09 01:29:02,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31236 conditions, 11400 events. 6018/11400 cut-off events. For 16549/16553 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 79231 event pairs, 1082 based on Foata normal form. 70/10674 useless extension candidates. Maximal degree in co-relation 22407. Up to 2092 conditions per place. [2025-03-09 01:29:02,402 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 336 selfloop transitions, 104 changer transitions 97/544 dead transitions. [2025-03-09 01:29:02,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 544 transitions, 3356 flow [2025-03-09 01:29:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-09 01:29:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-09 01:29:02,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 989 transitions. [2025-03-09 01:29:02,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48936170212765956 [2025-03-09 01:29:02,406 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 347 flow. Second operand 47 states and 989 transitions. [2025-03-09 01:29:02,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 544 transitions, 3356 flow [2025-03-09 01:29:02,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 544 transitions, 3350 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:02,418 INFO L231 Difference]: Finished difference. Result has 128 places, 163 transitions, 1715 flow [2025-03-09 01:29:02,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=1715, PETRI_PLACES=128, PETRI_TRANSITIONS=163} [2025-03-09 01:29:02,418 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 87 predicate places. [2025-03-09 01:29:02,418 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 163 transitions, 1715 flow [2025-03-09 01:29:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 12.806451612903226) internal successors, (397), 31 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-09 01:29:02,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:02,419 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:02,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:29:02,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:02,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:02,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -291720083, now seen corresponding path program 2 times [2025-03-09 01:29:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:02,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221328332] [2025-03-09 01:29:02,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:02,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:29:02,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:29:02,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:02,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:29:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221328332] [2025-03-09 01:29:03,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221328332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:03,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767253691] [2025-03-09 01:29:03,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:29:03,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:03,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:03,266 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-09 01:29:03,268 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-09 01:29:03,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:29:03,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:29:03,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:29:03,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:03,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:29:03,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:03,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:29:03,729 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-03-09 01:29:03,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-03-09 01:29:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:03,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:04,528 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 138 treesize of output 126 [2025-03-09 01:29:04,596 INFO L349 Elim1Store]: treesize reduction 10, result has 87.3 percent of original size [2025-03-09 01:29:04,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 241 treesize of output 248 [2025-03-09 01:29:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767253691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:09,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:09,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 29 [2025-03-09 01:29:09,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470253798] [2025-03-09 01:29:09,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:09,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-09 01:29:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:09,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-09 01:29:09,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2025-03-09 01:29:09,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:09,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 163 transitions, 1715 flow. Second operand has 30 states, 30 states have (on average 13.0) internal successors, (390), 30 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:09,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:09,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:09,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:11,961 INFO L124 PetriNetUnfolderBase]: 5372/10164 cut-off events. [2025-03-09 01:29:11,961 INFO L125 PetriNetUnfolderBase]: For 66035/66035 co-relation queries the response was YES. [2025-03-09 01:29:11,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35578 conditions, 10164 events. 5372/10164 cut-off events. For 66035/66035 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 69643 event pairs, 2351 based on Foata normal form. 23/9480 useless extension candidates. Maximal degree in co-relation 35081. Up to 6526 conditions per place. [2025-03-09 01:29:12,003 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 172 selfloop transitions, 30 changer transitions 79/288 dead transitions. [2025-03-09 01:29:12,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 288 transitions, 2645 flow [2025-03-09 01:29:12,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 01:29:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-09 01:29:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 391 transitions. [2025-03-09 01:29:12,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4330011074197121 [2025-03-09 01:29:12,005 INFO L175 Difference]: Start difference. First operand has 128 places, 163 transitions, 1715 flow. Second operand 21 states and 391 transitions. [2025-03-09 01:29:12,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 288 transitions, 2645 flow [2025-03-09 01:29:12,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 288 transitions, 2074 flow, removed 274 selfloop flow, removed 7 redundant places. [2025-03-09 01:29:12,087 INFO L231 Difference]: Finished difference. Result has 143 places, 144 transitions, 1063 flow [2025-03-09 01:29:12,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1063, PETRI_PLACES=143, PETRI_TRANSITIONS=144} [2025-03-09 01:29:12,088 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2025-03-09 01:29:12,089 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 144 transitions, 1063 flow [2025-03-09 01:29:12,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.0) internal successors, (390), 30 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:12,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:12,090 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:12,097 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-09 01:29:12,292 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,SelfDestructingSolverStorable15 [2025-03-09 01:29:12,292 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:12,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1305456609, now seen corresponding path program 3 times [2025-03-09 01:29:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260316655] [2025-03-09 01:29:12,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:12,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:12,297 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-03-09 01:29:12,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:29:12,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:29:12,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260316655] [2025-03-09 01:29:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260316655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039002636] [2025-03-09 01:29:12,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:29:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:12,672 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-09 01:29:12,677 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-09 01:29:12,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-03-09 01:29:12,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:29:12,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:29:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:12,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-09 01:29:12,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:12,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:29:13,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:13,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:13,781 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 104 [2025-03-09 01:29:13,810 INFO L349 Elim1Store]: treesize reduction 13, result has 71.1 percent of original size [2025-03-09 01:29:13,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 191 [2025-03-09 01:29:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:14,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039002636] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:14,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:14,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2025-03-09 01:29:14,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439334896] [2025-03-09 01:29:14,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:14,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-09 01:29:14,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:14,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-09 01:29:14,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:29:14,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:14,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 144 transitions, 1063 flow. Second operand has 26 states, 26 states have (on average 13.461538461538462) internal successors, (350), 26 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:14,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:14,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:14,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:20,064 INFO L124 PetriNetUnfolderBase]: 12292/23130 cut-off events. [2025-03-09 01:29:20,064 INFO L125 PetriNetUnfolderBase]: For 173867/173867 co-relation queries the response was YES. [2025-03-09 01:29:20,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79389 conditions, 23130 events. 12292/23130 cut-off events. For 173867/173867 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 177473 event pairs, 2435 based on Foata normal form. 104/21655 useless extension candidates. Maximal degree in co-relation 77762. Up to 3880 conditions per place. [2025-03-09 01:29:20,191 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 406 selfloop transitions, 302 changer transitions 179/894 dead transitions. [2025-03-09 01:29:20,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 894 transitions, 7251 flow [2025-03-09 01:29:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-09 01:29:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-09 01:29:20,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 1265 transitions. [2025-03-09 01:29:20,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4986204178163185 [2025-03-09 01:29:20,194 INFO L175 Difference]: Start difference. First operand has 143 places, 144 transitions, 1063 flow. Second operand 59 states and 1265 transitions. [2025-03-09 01:29:20,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 894 transitions, 7251 flow [2025-03-09 01:29:20,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 894 transitions, 6872 flow, removed 164 selfloop flow, removed 17 redundant places. [2025-03-09 01:29:20,326 INFO L231 Difference]: Finished difference. Result has 207 places, 384 transitions, 4379 flow [2025-03-09 01:29:20,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=4379, PETRI_PLACES=207, PETRI_TRANSITIONS=384} [2025-03-09 01:29:20,329 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 166 predicate places. [2025-03-09 01:29:20,329 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 384 transitions, 4379 flow [2025-03-09 01:29:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 13.461538461538462) internal successors, (350), 26 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:20,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:20,329 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:20,335 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-09 01:29:20,534 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,SelfDestructingSolverStorable16 [2025-03-09 01:29:20,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:20,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:20,534 INFO L85 PathProgramCache]: Analyzing trace with hash 972828511, now seen corresponding path program 4 times [2025-03-09 01:29:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057709493] [2025-03-09 01:29:20,535 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:29:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:20,543 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-09 01:29:20,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:29:20,568 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:29:20,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:29:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057709493] [2025-03-09 01:29:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057709493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072462575] [2025-03-09 01:29:21,063 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:29:21,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:21,065 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-09 01:29:21,067 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-09 01:29:21,103 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-09 01:29:21,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:29:21,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:29:21,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:21,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 01:29:21,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:29:21,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:21,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:29:21,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-09 01:29:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:21,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072462575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:21,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:21,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 6] total 21 [2025-03-09 01:29:21,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790916375] [2025-03-09 01:29:21,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:21,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:29:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:21,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:29:21,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:29:21,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:21,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 384 transitions, 4379 flow. Second operand has 22 states, 22 states have (on average 14.181818181818182) internal successors, (312), 22 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:21,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:21,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:21,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:25,172 INFO L124 PetriNetUnfolderBase]: 13402/25310 cut-off events. [2025-03-09 01:29:25,172 INFO L125 PetriNetUnfolderBase]: For 492281/492281 co-relation queries the response was YES. [2025-03-09 01:29:25,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106759 conditions, 25310 events. 13402/25310 cut-off events. For 492281/492281 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 200231 event pairs, 5620 based on Foata normal form. 4/23607 useless extension candidates. Maximal degree in co-relation 104711. Up to 17268 conditions per place. [2025-03-09 01:29:25,388 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 410 selfloop transitions, 51 changer transitions 42/510 dead transitions. [2025-03-09 01:29:25,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 510 transitions, 6391 flow [2025-03-09 01:29:25,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:29:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-09 01:29:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 303 transitions. [2025-03-09 01:29:25,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2025-03-09 01:29:25,389 INFO L175 Difference]: Start difference. First operand has 207 places, 384 transitions, 4379 flow. Second operand 15 states and 303 transitions. [2025-03-09 01:29:25,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 510 transitions, 6391 flow [2025-03-09 01:29:26,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 510 transitions, 5213 flow, removed 582 selfloop flow, removed 6 redundant places. [2025-03-09 01:29:26,422 INFO L231 Difference]: Finished difference. Result has 220 places, 400 transitions, 3603 flow [2025-03-09 01:29:26,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3235, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3603, PETRI_PLACES=220, PETRI_TRANSITIONS=400} [2025-03-09 01:29:26,423 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2025-03-09 01:29:26,423 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 400 transitions, 3603 flow [2025-03-09 01:29:26,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 14.181818181818182) internal successors, (312), 22 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:26,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:26,423 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 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-09 01:29:26,429 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-09 01:29:26,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:29:26,624 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:26,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -294983611, now seen corresponding path program 5 times [2025-03-09 01:29:26,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:26,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625099734] [2025-03-09 01:29:26,629 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:29:26,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:26,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 4 equivalence classes. [2025-03-09 01:29:26,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:29:26,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:29:26,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:26,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625099734] [2025-03-09 01:29:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625099734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690992365] [2025-03-09 01:29:26,713 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:29:26,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:26,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:26,717 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-09 01:29:26,726 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-09 01:29:26,769 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 4 equivalence classes. [2025-03-09 01:29:26,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:29:26,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:29:26,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:26,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:29:26,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:26,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:26,951 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:26,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690992365] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:26,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:26,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-03-09 01:29:26,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612147902] [2025-03-09 01:29:26,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:26,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:29:26,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:26,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:29:26,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:29:26,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:26,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 400 transitions, 3603 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:26,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:26,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:26,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:31,199 INFO L124 PetriNetUnfolderBase]: 18302/35077 cut-off events. [2025-03-09 01:29:31,200 INFO L125 PetriNetUnfolderBase]: For 669458/669458 co-relation queries the response was YES. [2025-03-09 01:29:31,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141695 conditions, 35077 events. 18302/35077 cut-off events. For 669458/669458 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 291994 event pairs, 5488 based on Foata normal form. 220/32950 useless extension candidates. Maximal degree in co-relation 138293. Up to 14618 conditions per place. [2025-03-09 01:29:31,554 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 304 selfloop transitions, 235 changer transitions 0/546 dead transitions. [2025-03-09 01:29:31,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 546 transitions, 6131 flow [2025-03-09 01:29:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:29:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:29:31,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-03-09 01:29:31,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488372093023256 [2025-03-09 01:29:31,555 INFO L175 Difference]: Start difference. First operand has 220 places, 400 transitions, 3603 flow. Second operand 5 states and 118 transitions. [2025-03-09 01:29:31,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 546 transitions, 6131 flow [2025-03-09 01:29:32,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 546 transitions, 5947 flow, removed 51 selfloop flow, removed 8 redundant places. [2025-03-09 01:29:32,675 INFO L231 Difference]: Finished difference. Result has 219 places, 504 transitions, 5464 flow [2025-03-09 01:29:32,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5464, PETRI_PLACES=219, PETRI_TRANSITIONS=504} [2025-03-09 01:29:32,675 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 178 predicate places. [2025-03-09 01:29:32,676 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 504 transitions, 5464 flow [2025-03-09 01:29:32,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:32,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:32,676 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:32,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:29:32,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:32,877 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:32,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:32,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1627003487, now seen corresponding path program 6 times [2025-03-09 01:29:32,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:32,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578681463] [2025-03-09 01:29:32,877 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:29:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:32,884 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 4 equivalence classes. [2025-03-09 01:29:32,897 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:29:32,898 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 01:29:32,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:29:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578681463] [2025-03-09 01:29:33,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578681463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:33,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742357333] [2025-03-09 01:29:33,526 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:29:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:33,528 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-09 01:29:33,529 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-09 01:29:33,567 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 4 equivalence classes. [2025-03-09 01:29:33,612 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:29:33,612 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 01:29:33,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:33,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 01:29:33,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:29:33,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:33,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:29:33,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-03-09 01:29:34,031 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-09 01:29:34,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742357333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:34,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:34,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 6] total 23 [2025-03-09 01:29:34,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715048743] [2025-03-09 01:29:34,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:34,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:29:34,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:34,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:29:34,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:29:34,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:34,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 504 transitions, 5464 flow. Second operand has 24 states, 24 states have (on average 14.083333333333334) internal successors, (338), 24 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:34,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:34,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:34,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:29:43,042 INFO L124 PetriNetUnfolderBase]: 30336/57317 cut-off events. [2025-03-09 01:29:43,042 INFO L125 PetriNetUnfolderBase]: For 1094551/1094551 co-relation queries the response was YES. [2025-03-09 01:29:43,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240366 conditions, 57317 events. 30336/57317 cut-off events. For 1094551/1094551 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 509940 event pairs, 8848 based on Foata normal form. 48/53499 useless extension candidates. Maximal degree in co-relation 235243. Up to 18223 conditions per place. [2025-03-09 01:29:43,661 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 644 selfloop transitions, 332 changer transitions 78/1061 dead transitions. [2025-03-09 01:29:43,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1061 transitions, 12847 flow [2025-03-09 01:29:43,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 01:29:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-09 01:29:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 603 transitions. [2025-03-09 01:29:43,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2025-03-09 01:29:43,662 INFO L175 Difference]: Start difference. First operand has 219 places, 504 transitions, 5464 flow. Second operand 27 states and 603 transitions. [2025-03-09 01:29:43,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 1061 transitions, 12847 flow [2025-03-09 01:29:45,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 1061 transitions, 12519 flow, removed 156 selfloop flow, removed 1 redundant places. [2025-03-09 01:29:45,624 INFO L231 Difference]: Finished difference. Result has 255 places, 686 transitions, 8837 flow [2025-03-09 01:29:45,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=5330, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=504, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=8837, PETRI_PLACES=255, PETRI_TRANSITIONS=686} [2025-03-09 01:29:45,625 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 214 predicate places. [2025-03-09 01:29:45,625 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 686 transitions, 8837 flow [2025-03-09 01:29:45,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 14.083333333333334) internal successors, (338), 24 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:45,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:29:45,625 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:29:45,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:29:45,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:45,826 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 15 more)] === [2025-03-09 01:29:45,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:29:45,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2060984601, now seen corresponding path program 7 times [2025-03-09 01:29:45,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:29:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29189885] [2025-03-09 01:29:45,826 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:29:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:29:45,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:29:45,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:29:45,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:45,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:29:46,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:29:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29189885] [2025-03-09 01:29:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29189885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:29:46,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293425139] [2025-03-09 01:29:46,905 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:29:46,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:29:46,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:29:46,907 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-09 01:29:46,908 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-09 01:29:46,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:29:46,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:29:46,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:29:46,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:29:46,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:29:46,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:29:47,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 1 [2025-03-09 01:29:47,662 INFO L349 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-03-09 01:29:47,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-03-09 01:29:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:29:47,673 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:29:48,895 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 169 treesize of output 151 [2025-03-09 01:29:48,947 INFO L349 Elim1Store]: treesize reduction 50, result has 54.1 percent of original size [2025-03-09 01:29:48,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 544 treesize of output 424 [2025-03-09 01:29:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:29:50,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293425139] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:29:50,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:29:50,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-03-09 01:29:50,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142450611] [2025-03-09 01:29:50,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:29:50,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-09 01:29:50,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:29:50,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-09 01:29:50,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1325, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 01:29:50,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-03-09 01:29:50,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 686 transitions, 8837 flow. Second operand has 40 states, 40 states have (on average 12.85) internal successors, (514), 40 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:29:50,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:29:50,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-03-09 01:29:50,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:08,319 INFO L124 PetriNetUnfolderBase]: 38178/73692 cut-off events. [2025-03-09 01:30:08,319 INFO L125 PetriNetUnfolderBase]: For 1696945/1696945 co-relation queries the response was YES. [2025-03-09 01:30:09,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324292 conditions, 73692 events. 38178/73692 cut-off events. For 1696945/1696945 co-relation queries the response was YES. Maximal size of possible extension queue 1321. Compared 694394 event pairs, 8868 based on Foata normal form. 1523/70163 useless extension candidates. Maximal degree in co-relation 320799. Up to 17136 conditions per place. [2025-03-09 01:30:09,198 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 490 selfloop transitions, 773 changer transitions 173/1443 dead transitions. [2025-03-09 01:30:09,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1443 transitions, 21397 flow [2025-03-09 01:30:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-09 01:30:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-09 01:30:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 1052 transitions. [2025-03-09 01:30:09,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47048300536672627 [2025-03-09 01:30:09,201 INFO L175 Difference]: Start difference. First operand has 255 places, 686 transitions, 8837 flow. Second operand 52 states and 1052 transitions. [2025-03-09 01:30:09,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1443 transitions, 21397 flow