./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/pthread-ext/11_fmaxsymopt.i -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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:01:06,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:01:06,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:01:06,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:01:06,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:01:06,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:01:06,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:01:06,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:01:06,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:01:06,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:01:06,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:01:06,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:01:06,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:01:06,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:01:06,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:01:06,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:01:06,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:01:06,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:01:06,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:01:06,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:01:06,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:01:06,540 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-17 14:01:06,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:01:06,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:01:06,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:01:06,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:01:06,729 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:01:06,730 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-17 14:01:07,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0730eb5b3/28d47c50fd364a819479e263abc06f81/FLAG8f7dc1500 [2025-03-17 14:01:08,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:01:08,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-17 14:01:08,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0730eb5b3/28d47c50fd364a819479e263abc06f81/FLAG8f7dc1500 [2025-03-17 14:01:08,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0730eb5b3/28d47c50fd364a819479e263abc06f81 [2025-03-17 14:01:08,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:01:08,179 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:01:08,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:08,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:01:08,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:01:08,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb93f8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08, skipping insertion in model container [2025-03-17 14:01:08,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:01:08,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:08,438 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:01:08,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:01:08,500 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:01:08,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08 WrapperNode [2025-03-17 14:01:08,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:01:08,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:08,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:01:08,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:01:08,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,515 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,531 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2025-03-17 14:01:08,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:01:08,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:01:08,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:01:08,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:01:08,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,556 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-17 14:01:08,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:01:08,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:01:08,575 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:01:08,575 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:01:08,576 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (1/1) ... [2025-03-17 14:01:08,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:01:08,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:08,599 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-17 14:01:08,603 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-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-17 14:01:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 14:01:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:01:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:01:08,616 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:01:08,707 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:01:08,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:01:08,881 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:01:08,881 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:01:08,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:01:09,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:01:09,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:09 BoogieIcfgContainer [2025-03-17 14:01:09,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:01:09,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:01:09,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:01:09,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:01:09,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:01:08" (1/3) ... [2025-03-17 14:01:09,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2475b47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:09, skipping insertion in model container [2025-03-17 14:01:09,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:01:08" (2/3) ... [2025-03-17 14:01:09,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2475b47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:01:09, skipping insertion in model container [2025-03-17 14:01:09,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:01:09" (3/3) ... [2025-03-17 14:01:09,008 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-17 14:01:09,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:01:09,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 14:01:09,020 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:01:09,061 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:09,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 78 flow [2025-03-17 14:01:09,105 INFO L124 PetriNetUnfolderBase]: 5/41 cut-off events. [2025-03-17 14:01:09,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:09,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 41 events. 5/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-03-17 14:01:09,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 78 flow [2025-03-17 14:01:09,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 78 flow [2025-03-17 14:01:09,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:09,125 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;@2e0d1498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:09,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-17 14:01:09,128 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:09,128 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:09,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:09,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:09,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash 253429, now seen corresponding path program 1 times [2025-03-17 14:01:09,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543160187] [2025-03-17 14:01:09,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:09,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:09,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,376 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-17 14:01:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543160187] [2025-03-17 14:01:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543160187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:09,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:09,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805246793] [2025-03-17 14:01:09,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:09,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:09,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:09,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:09,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-03-17 14:01:09,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-17 14:01:09,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:09,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-03-17 14:01:09,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:09,481 INFO L124 PetriNetUnfolderBase]: 21/81 cut-off events. [2025-03-17 14:01:09,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:09,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 81 events. 21/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 212 event pairs, 16 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 115. Up to 51 conditions per place. [2025-03-17 14:01:09,484 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 15 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2025-03-17 14:01:09,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 29 transitions, 94 flow [2025-03-17 14:01:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-17 14:01:09,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-17 14:01:09,494 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 78 flow. Second operand 3 states and 63 transitions. [2025-03-17 14:01:09,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 29 transitions, 94 flow [2025-03-17 14:01:09,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:09,498 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 64 flow [2025-03-17 14:01:09,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-03-17 14:01:09,504 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2025-03-17 14:01:09,504 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 64 flow [2025-03-17 14:01:09,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-17 14:01:09,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:09,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:01:09,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:09,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash 253430, now seen corresponding path program 1 times [2025-03-17 14:01:09,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302731182] [2025-03-17 14:01:09,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:09,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:09,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,611 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-17 14:01:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302731182] [2025-03-17 14:01:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302731182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:09,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018962605] [2025-03-17 14:01:09,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:09,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:09,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:09,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:09,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:09,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-17 14:01:09,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:09,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:09,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-17 14:01:09,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:09,687 INFO L124 PetriNetUnfolderBase]: 21/83 cut-off events. [2025-03-17 14:01:09,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:09,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 83 events. 21/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 212 event pairs, 16 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 137. Up to 53 conditions per place. [2025-03-17 14:01:09,688 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 17 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-17 14:01:09,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 106 flow [2025-03-17 14:01:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-17 14:01:09,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-17 14:01:09,691 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 64 flow. Second operand 3 states and 66 transitions. [2025-03-17 14:01:09,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 106 flow [2025-03-17 14:01:09,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:09,693 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 77 flow [2025-03-17 14:01:09,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2025-03-17 14:01:09,693 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2025-03-17 14:01:09,693 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 77 flow [2025-03-17 14:01:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:09,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:09,693 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:09,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:01:09,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:09,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash 243554605, now seen corresponding path program 1 times [2025-03-17 14:01:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:09,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786349171] [2025-03-17 14:01:09,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:09,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:09,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:09,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,832 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-17 14:01:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786349171] [2025-03-17 14:01:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786349171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546616796] [2025-03-17 14:01:09,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:09,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:09,835 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-17 14:01:09,837 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-17 14:01:09,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:09,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:09,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:09,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:09,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:09,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:09,968 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-17 14:01:09,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:10,022 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-17 14:01:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546616796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:10,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557464330] [2025-03-17 14:01:10,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:10,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:10,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:10,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-17 14:01:10,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 77 flow. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:10,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:10,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-17 14:01:10,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:10,195 INFO L124 PetriNetUnfolderBase]: 23/91 cut-off events. [2025-03-17 14:01:10,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:10,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 16 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 163. Up to 55 conditions per place. [2025-03-17 14:01:10,196 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 20 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2025-03-17 14:01:10,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 39 transitions, 159 flow [2025-03-17 14:01:10,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:10,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2025-03-17 14:01:10,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545045045045045 [2025-03-17 14:01:10,198 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 77 flow. Second operand 6 states and 121 transitions. [2025-03-17 14:01:10,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 39 transitions, 159 flow [2025-03-17 14:01:10,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:10,200 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 127 flow [2025-03-17 14:01:10,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2025-03-17 14:01:10,200 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2025-03-17 14:01:10,200 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 127 flow [2025-03-17 14:01:10,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 8 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:10,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:10,201 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:01:10,209 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-17 14:01:10,403 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-17 14:01:10,403 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1091634464, now seen corresponding path program 1 times [2025-03-17 14:01:10,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:10,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782451596] [2025-03-17 14:01:10,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:10,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:10,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:10,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:10,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:10,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782451596] [2025-03-17 14:01:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782451596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:10,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62872008] [2025-03-17 14:01:10,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:10,474 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-17 14:01:10,475 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-17 14:01:10,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:10,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:10,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:10,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:10,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:10,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:10,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62872008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:10,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:10,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:10,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606887971] [2025-03-17 14:01:10,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:10,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:10,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:10,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:10,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:10,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2025-03-17 14:01:10,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 127 flow. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-17 14:01:10,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:10,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2025-03-17 14:01:10,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:10,657 INFO L124 PetriNetUnfolderBase]: 21/93 cut-off events. [2025-03-17 14:01:10,657 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-17 14:01:10,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 93 events. 21/93 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 210 event pairs, 16 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 180. Up to 50 conditions per place. [2025-03-17 14:01:10,658 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 19 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2025-03-17 14:01:10,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 185 flow [2025-03-17 14:01:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:10,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2025-03-17 14:01:10,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2025-03-17 14:01:10,667 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 127 flow. Second operand 8 states and 159 transitions. [2025-03-17 14:01:10,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 185 flow [2025-03-17 14:01:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 177 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:10,669 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 143 flow [2025-03-17 14:01:10,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=143, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-03-17 14:01:10,669 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2025-03-17 14:01:10,669 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 143 flow [2025-03-17 14:01:10,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 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-17 14:01:10,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:10,673 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:01:10,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:10,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:01:10,876 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:10,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1075044434, now seen corresponding path program 2 times [2025-03-17 14:01:10,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:10,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904492881] [2025-03-17 14:01:10,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:10,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:10,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:10,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:10,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:11,099 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:11,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904492881] [2025-03-17 14:01:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904492881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438188452] [2025-03-17 14:01:11,100 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:11,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:11,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:11,102 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-17 14:01:11,104 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-17 14:01:11,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:11,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:11,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:11,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:01:11,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:11,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:01:11,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438188452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:11,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:01:11,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:01:11,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983430834] [2025-03-17 14:01:11,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:11,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:11,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:11,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:11,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:01:11,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-17 14:01:11,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 143 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-17 14:01:11,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:11,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-17 14:01:11,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:11,398 INFO L124 PetriNetUnfolderBase]: 21/91 cut-off events. [2025-03-17 14:01:11,398 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 14:01:11,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 91 events. 21/91 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 214 event pairs, 16 based on Foata normal form. 2/87 useless extension candidates. Maximal degree in co-relation 185. Up to 49 conditions per place. [2025-03-17 14:01:11,399 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 16 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2025-03-17 14:01:11,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 38 transitions, 201 flow [2025-03-17 14:01:11,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2025-03-17 14:01:11,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48986486486486486 [2025-03-17 14:01:11,402 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 143 flow. Second operand 8 states and 145 transitions. [2025-03-17 14:01:11,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 38 transitions, 201 flow [2025-03-17 14:01:11,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 175 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-17 14:01:11,404 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 139 flow [2025-03-17 14:01:11,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-03-17 14:01:11,405 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2025-03-17 14:01:11,405 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 139 flow [2025-03-17 14:01:11,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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-17 14:01:11,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:11,405 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1] [2025-03-17 14:01:11,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:11,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:11,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 7 more)] === [2025-03-17 14:01:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1117186940, now seen corresponding path program 2 times [2025-03-17 14:01:11,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:11,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232043296] [2025-03-17 14:01:11,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:11,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:11,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:11,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:01:11,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:11,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:11,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:01:11,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:01:11,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:11,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:11,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:11,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:11,663 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-17 14:01:11,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 10 remaining) [2025-03-17 14:01:11,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 10 remaining) [2025-03-17 14:01:11,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 10 remaining) [2025-03-17 14:01:11,666 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2025-03-17 14:01:11,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:01:11,666 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2025-03-17 14:01:11,668 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:11,668 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 14:01:11,689 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 62 transitions, 134 flow [2025-03-17 14:01:11,699 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2025-03-17 14:01:11,699 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:01:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 71 events. 9/71 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 212 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-03-17 14:01:11,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 62 transitions, 134 flow [2025-03-17 14:01:11,700 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 62 transitions, 134 flow [2025-03-17 14:01:11,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:11,701 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;@2e0d1498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:11,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-17 14:01:11,702 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:11,702 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:11,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:11,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:11,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:11,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:11,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:11,702 INFO L85 PathProgramCache]: Analyzing trace with hash 314995, now seen corresponding path program 1 times [2025-03-17 14:01:11,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:11,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835404016] [2025-03-17 14:01:11,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:11,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:11,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:11,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:11,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:11,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:11,723 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-17 14:01:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835404016] [2025-03-17 14:01:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835404016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:11,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:11,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682950834] [2025-03-17 14:01:11,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:11,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:11,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:11,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:11,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:11,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 62 [2025-03-17 14:01:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 14:01:11,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:11,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 62 [2025-03-17 14:01:11,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:11,837 INFO L124 PetriNetUnfolderBase]: 449/1046 cut-off events. [2025-03-17 14:01:11,837 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 14:01:11,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 1046 events. 449/1046 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6205 event pairs, 376 based on Foata normal form. 160/1136 useless extension candidates. Maximal degree in co-relation 1011. Up to 708 conditions per place. [2025-03-17 14:01:11,846 INFO L140 encePairwiseOnDemand]: 53/62 looper letters, 25 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-17 14:01:11,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 162 flow [2025-03-17 14:01:11,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:11,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-17 14:01:11,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2025-03-17 14:01:11,847 INFO L175 Difference]: Start difference. First operand has 58 places, 62 transitions, 134 flow. Second operand 3 states and 109 transitions. [2025-03-17 14:01:11,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 162 flow [2025-03-17 14:01:11,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:11,849 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 112 flow [2025-03-17 14:01:11,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2025-03-17 14:01:11,849 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2025-03-17 14:01:11,849 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 112 flow [2025-03-17 14:01:11,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 14:01:11,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:11,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:11,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:01:11,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:11,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:11,850 INFO L85 PathProgramCache]: Analyzing trace with hash 314996, now seen corresponding path program 1 times [2025-03-17 14:01:11,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:11,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455137204] [2025-03-17 14:01:11,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:11,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:11,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:11,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:11,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:11,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:11,883 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-17 14:01:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455137204] [2025-03-17 14:01:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455137204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:11,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:11,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221829881] [2025-03-17 14:01:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:11,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:11,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:11,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:11,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-17 14:01:11,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-17 14:01:11,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:11,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-17 14:01:11,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:12,025 INFO L124 PetriNetUnfolderBase]: 449/1048 cut-off events. [2025-03-17 14:01:12,026 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 14:01:12,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1048 events. 449/1048 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6219 event pairs, 376 based on Foata normal form. 0/977 useless extension candidates. Maximal degree in co-relation 1786. Up to 710 conditions per place. [2025-03-17 14:01:12,032 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-17 14:01:12,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 174 flow [2025-03-17 14:01:12,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-17 14:01:12,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2025-03-17 14:01:12,034 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 112 flow. Second operand 3 states and 112 transitions. [2025-03-17 14:01:12,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 174 flow [2025-03-17 14:01:12,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:12,036 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 125 flow [2025-03-17 14:01:12,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-03-17 14:01:12,037 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-17 14:01:12,037 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 125 flow [2025-03-17 14:01:12,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-17 14:01:12,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:12,038 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:12,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:01:12,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:12,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 302721515, now seen corresponding path program 1 times [2025-03-17 14:01:12,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561674261] [2025-03-17 14:01:12,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:12,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:12,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:12,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:12,104 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-17 14:01:12,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561674261] [2025-03-17 14:01:12,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561674261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:12,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396664394] [2025-03-17 14:01:12,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:12,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:12,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:12,106 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-17 14:01:12,108 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-17 14:01:12,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:12,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:12,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:12,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:12,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:12,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:12,202 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-17 14:01:12,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:12,236 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-17 14:01:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396664394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:12,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:12,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790056989] [2025-03-17 14:01:12,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:12,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:12,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:12,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:12,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:12,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-17 14:01:12,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 125 flow. Second operand has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-17 14:01:12,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:12,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-17 14:01:12,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:12,485 INFO L124 PetriNetUnfolderBase]: 451/1056 cut-off events. [2025-03-17 14:01:12,485 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-17 14:01:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 1056 events. 451/1056 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6211 event pairs, 376 based on Foata normal form. 1/987 useless extension candidates. Maximal degree in co-relation 1812. Up to 712 conditions per place. [2025-03-17 14:01:12,493 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 30 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-17 14:01:12,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 227 flow [2025-03-17 14:01:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-17 14:01:12,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5456989247311828 [2025-03-17 14:01:12,494 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 125 flow. Second operand 6 states and 203 transitions. [2025-03-17 14:01:12,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 227 flow [2025-03-17 14:01:12,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:12,495 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 175 flow [2025-03-17 14:01:12,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-03-17 14:01:12,496 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2025-03-17 14:01:12,496 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 175 flow [2025-03-17 14:01:12,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.875) internal successors, (231), 8 states have internal predecessors, (231), 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-17 14:01:12,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:12,496 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:01:12,502 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-17 14:01:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:12,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:12,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash -948833840, now seen corresponding path program 2 times [2025-03-17 14:01:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699875608] [2025-03-17 14:01:12,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:12,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:12,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:12,708 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:12,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:12,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699875608] [2025-03-17 14:01:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699875608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636275391] [2025-03-17 14:01:12,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:12,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:12,843 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-17 14:01:12,845 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-17 14:01:12,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:12,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:12,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:12,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:12,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:01:12,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:13,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:01:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636275391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:01:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:01:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755469943] [2025-03-17 14:01:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:13,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:13,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:13,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:13,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:01:13,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 62 [2025-03-17 14:01:13,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:13,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:13,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 62 [2025-03-17 14:01:13,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:13,162 INFO L124 PetriNetUnfolderBase]: 451/1055 cut-off events. [2025-03-17 14:01:13,162 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-17 14:01:13,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1055 events. 451/1055 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6212 event pairs, 376 based on Foata normal form. 1/987 useless extension candidates. Maximal degree in co-relation 1821. Up to 708 conditions per place. [2025-03-17 14:01:13,167 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 26 selfloop transitions, 10 changer transitions 0/59 dead transitions. [2025-03-17 14:01:13,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 245 flow [2025-03-17 14:01:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 253 transitions. [2025-03-17 14:01:13,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5100806451612904 [2025-03-17 14:01:13,168 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 175 flow. Second operand 8 states and 253 transitions. [2025-03-17 14:01:13,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 245 flow [2025-03-17 14:01:13,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 59 transitions, 219 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:01:13,169 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 167 flow [2025-03-17 14:01:13,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-17 14:01:13,170 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-03-17 14:01:13,170 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 167 flow [2025-03-17 14:01:13,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:01:13,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:13,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:13,176 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-17 14:01:13,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:01:13,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:13,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -931487778, now seen corresponding path program 1 times [2025-03-17 14:01:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:13,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458791396] [2025-03-17 14:01:13,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:13,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:13,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:13,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:13,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458791396] [2025-03-17 14:01:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458791396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104401108] [2025-03-17 14:01:13,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:13,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:13,434 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-17 14:01:13,435 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-17 14:01:13,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:13,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:13,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:13,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:13,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:13,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:13,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:13,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:13,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:13,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104401108] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:13,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:13,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:13,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648224867] [2025-03-17 14:01:13,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:13,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:13,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:13,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:13,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:13,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 62 [2025-03-17 14:01:13,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-17 14:01:13,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:13,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 62 [2025-03-17 14:01:13,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:13,637 INFO L124 PetriNetUnfolderBase]: 449/1056 cut-off events. [2025-03-17 14:01:13,638 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-17 14:01:13,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 1056 events. 449/1056 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6205 event pairs, 376 based on Foata normal form. 4/991 useless extension candidates. Maximal degree in co-relation 1827. Up to 707 conditions per place. [2025-03-17 14:01:13,643 INFO L140 encePairwiseOnDemand]: 58/62 looper letters, 29 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2025-03-17 14:01:13,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 258 flow [2025-03-17 14:01:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:13,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2025-03-17 14:01:13,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2025-03-17 14:01:13,644 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 167 flow. Second operand 8 states and 265 transitions. [2025-03-17 14:01:13,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 258 flow [2025-03-17 14:01:13,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 240 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:01:13,646 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 179 flow [2025-03-17 14:01:13,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2025-03-17 14:01:13,646 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2025-03-17 14:01:13,647 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 179 flow [2025-03-17 14:01:13,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.0) internal successors, (270), 9 states have internal predecessors, (270), 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-17 14:01:13,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:13,647 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:13,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:13,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:13,848 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1991026490, now seen corresponding path program 2 times [2025-03-17 14:01:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270109333] [2025-03-17 14:01:13,848 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:13,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:13,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:01:13,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:01:13,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:13,929 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-17 14:01:13,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:13,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270109333] [2025-03-17 14:01:13,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270109333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:13,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:13,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:13,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053642494] [2025-03-17 14:01:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:13,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:13,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:13,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:13,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:13,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 62 [2025-03-17 14:01:13,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-17 14:01:13,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:13,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 62 [2025-03-17 14:01:13,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:14,132 INFO L124 PetriNetUnfolderBase]: 635/1658 cut-off events. [2025-03-17 14:01:14,132 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-17 14:01:14,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1658 events. 635/1658 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 11601 event pairs, 421 based on Foata normal form. 30/1595 useless extension candidates. Maximal degree in co-relation 2759. Up to 797 conditions per place. [2025-03-17 14:01:14,138 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 56 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-03-17 14:01:14,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 82 transitions, 363 flow [2025-03-17 14:01:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2025-03-17 14:01:14,140 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-17 14:01:14,140 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 179 flow. Second operand 5 states and 186 transitions. [2025-03-17 14:01:14,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 82 transitions, 363 flow [2025-03-17 14:01:14,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 82 transitions, 355 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:01:14,144 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 198 flow [2025-03-17 14:01:14,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-17 14:01:14,144 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-17 14:01:14,144 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 198 flow [2025-03-17 14:01:14,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 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-17 14:01:14,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:14,145 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-17 14:01:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:01:14,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 10 more)] === [2025-03-17 14:01:14,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash -50000822, now seen corresponding path program 1 times [2025-03-17 14:01:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493849198] [2025-03-17 14:01:14,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:14,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:14,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:14,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:14,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:14,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:14,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:14,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:14,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:14,174 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (9 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 13 remaining) [2025-03-17 14:01:14,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2025-03-17 14:01:14,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 13 remaining) [2025-03-17 14:01:14,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 13 remaining) [2025-03-17 14:01:14,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 13 remaining) [2025-03-17 14:01:14,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 13 remaining) [2025-03-17 14:01:14,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2025-03-17 14:01:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:01:14,175 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-17 14:01:14,175 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:14,175 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 14:01:14,201 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:14,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 87 transitions, 192 flow [2025-03-17 14:01:14,207 INFO L124 PetriNetUnfolderBase]: 13/101 cut-off events. [2025-03-17 14:01:14,207 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:01:14,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 101 events. 13/101 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 350 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2025-03-17 14:01:14,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 87 transitions, 192 flow [2025-03-17 14:01:14,208 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 87 transitions, 192 flow [2025-03-17 14:01:14,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:14,209 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;@2e0d1498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:14,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-17 14:01:14,223 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:14,223 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:14,223 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:14,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:14,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:14,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:14,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash 401386, now seen corresponding path program 1 times [2025-03-17 14:01:14,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:14,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203332180] [2025-03-17 14:01:14,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:14,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:14,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:14,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:14,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:14,245 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-17 14:01:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:14,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203332180] [2025-03-17 14:01:14,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203332180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:14,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:14,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789458819] [2025-03-17 14:01:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:14,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:14,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:14,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:14,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 87 [2025-03-17 14:01:14,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-17 14:01:14,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:14,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 87 [2025-03-17 14:01:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:14,953 INFO L124 PetriNetUnfolderBase]: 6456/11566 cut-off events. [2025-03-17 14:01:14,953 INFO L125 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2025-03-17 14:01:14,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20732 conditions, 11566 events. 6456/11566 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 89254 event pairs, 5560 based on Foata normal form. 2441/13350 useless extension candidates. Maximal degree in co-relation 2145. Up to 8808 conditions per place. [2025-03-17 14:01:15,017 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 35 selfloop transitions, 1 changer transitions 0/71 dead transitions. [2025-03-17 14:01:15,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 71 transitions, 232 flow [2025-03-17 14:01:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-17 14:01:15,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5938697318007663 [2025-03-17 14:01:15,019 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 192 flow. Second operand 3 states and 155 transitions. [2025-03-17 14:01:15,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 71 transitions, 232 flow [2025-03-17 14:01:15,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:15,021 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 160 flow [2025-03-17 14:01:15,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2025-03-17 14:01:15,021 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2025-03-17 14:01:15,021 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 160 flow [2025-03-17 14:01:15,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-17 14:01:15,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:15,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:15,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:01:15,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash 401387, now seen corresponding path program 1 times [2025-03-17 14:01:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:15,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099753893] [2025-03-17 14:01:15,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:15,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:15,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:15,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:15,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:15,058 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-17 14:01:15,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:15,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099753893] [2025-03-17 14:01:15,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099753893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:15,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291085392] [2025-03-17 14:01:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:15,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:15,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:15,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:15,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:15,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-17 14:01:15,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-17 14:01:15,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:15,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-17 14:01:15,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:15,700 INFO L124 PetriNetUnfolderBase]: 6456/11568 cut-off events. [2025-03-17 14:01:15,700 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-17 14:01:15,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20658 conditions, 11568 events. 6456/11568 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 89123 event pairs, 5560 based on Foata normal form. 0/10910 useless extension candidates. Maximal degree in co-relation 20649. Up to 8810 conditions per place. [2025-03-17 14:01:15,748 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 37 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-17 14:01:15,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 73 transitions, 242 flow [2025-03-17 14:01:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2025-03-17 14:01:15,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053639846743295 [2025-03-17 14:01:15,749 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 160 flow. Second operand 3 states and 158 transitions. [2025-03-17 14:01:15,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 73 transitions, 242 flow [2025-03-17 14:01:15,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 73 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:15,751 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 173 flow [2025-03-17 14:01:15,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2025-03-17 14:01:15,751 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -6 predicate places. [2025-03-17 14:01:15,751 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 173 flow [2025-03-17 14:01:15,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 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-17 14:01:15,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:15,752 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:01:15,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:15,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:15,752 INFO L85 PathProgramCache]: Analyzing trace with hash 385746050, now seen corresponding path program 1 times [2025-03-17 14:01:15,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:15,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471222791] [2025-03-17 14:01:15,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:15,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:15,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:15,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:15,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:15,790 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-17 14:01:15,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:15,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471222791] [2025-03-17 14:01:15,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471222791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:15,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473337780] [2025-03-17 14:01:15,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:15,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:15,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:15,792 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-17 14:01:15,794 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-17 14:01:15,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:15,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:15,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:15,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:15,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:15,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:15,883 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-17 14:01:15,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:15,913 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-17 14:01:15,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473337780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:15,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:15,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260921786] [2025-03-17 14:01:15,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:15,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:15,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:15,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-17 14:01:15,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 173 flow. Second operand has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-17 14:01:15,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:15,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-17 14:01:15,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:16,782 INFO L124 PetriNetUnfolderBase]: 6458/11576 cut-off events. [2025-03-17 14:01:16,782 INFO L125 PetriNetUnfolderBase]: For 350/350 co-relation queries the response was YES. [2025-03-17 14:01:16,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20686 conditions, 11576 events. 6458/11576 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 89119 event pairs, 5560 based on Foata normal form. 1/10920 useless extension candidates. Maximal degree in co-relation 20675. Up to 8812 conditions per place. [2025-03-17 14:01:16,852 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 40 selfloop transitions, 7 changer transitions 0/81 dead transitions. [2025-03-17 14:01:16,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 81 transitions, 295 flow [2025-03-17 14:01:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2025-03-17 14:01:16,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5459770114942529 [2025-03-17 14:01:16,853 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 173 flow. Second operand 6 states and 285 transitions. [2025-03-17 14:01:16,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 81 transitions, 295 flow [2025-03-17 14:01:16,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 293 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:16,855 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 223 flow [2025-03-17 14:01:16,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-17 14:01:16,856 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 1 predicate places. [2025-03-17 14:01:16,856 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 223 flow [2025-03-17 14:01:16,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.875) internal successors, (327), 8 states have internal predecessors, (327), 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-17 14:01:16,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:16,856 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-17 14:01:16,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:01:17,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:17,060 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:17,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1433487417, now seen corresponding path program 2 times [2025-03-17 14:01:17,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:17,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592449119] [2025-03-17 14:01:17,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:17,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:17,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:17,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:17,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592449119] [2025-03-17 14:01:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592449119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818435189] [2025-03-17 14:01:17,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:17,211 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-17 14:01:17,213 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-17 14:01:17,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-17 14:01:17,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:17,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:01:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:17,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:01:17,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:17,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:01:17,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818435189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:01:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-17 14:01:17,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799426042] [2025-03-17 14:01:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:01:17,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-17 14:01:17,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 223 flow. Second operand has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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-17 14:01:17,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:17,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-17 14:01:17,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:18,009 INFO L124 PetriNetUnfolderBase]: 6458/11575 cut-off events. [2025-03-17 14:01:18,009 INFO L125 PetriNetUnfolderBase]: For 367/367 co-relation queries the response was YES. [2025-03-17 14:01:18,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20699 conditions, 11575 events. 6458/11575 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 89162 event pairs, 5560 based on Foata normal form. 1/10920 useless extension candidates. Maximal degree in co-relation 20684. Up to 8808 conditions per place. [2025-03-17 14:01:18,048 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 36 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-03-17 14:01:18,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 313 flow [2025-03-17 14:01:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2025-03-17 14:01:18,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5158045977011494 [2025-03-17 14:01:18,050 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 223 flow. Second operand 8 states and 359 transitions. [2025-03-17 14:01:18,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 313 flow [2025-03-17 14:01:18,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 80 transitions, 287 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-17 14:01:18,052 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 215 flow [2025-03-17 14:01:18,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=215, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-03-17 14:01:18,052 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 3 predicate places. [2025-03-17 14:01:18,052 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 215 flow [2025-03-17 14:01:18,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.375) internal successors, (323), 8 states have internal predecessors, (323), 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-17 14:01:18,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:18,052 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:18,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:01:18,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:01:18,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:18,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1415426371, now seen corresponding path program 1 times [2025-03-17 14:01:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077923102] [2025-03-17 14:01:18,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:18,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:18,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:18,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:18,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077923102] [2025-03-17 14:01:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077923102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960677303] [2025-03-17 14:01:18,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:18,288 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-17 14:01:18,290 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-17 14:01:18,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:01:18,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:01:18,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:18,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:18,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:01:18,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:18,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:01:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960677303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:18,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-17 14:01:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376317305] [2025-03-17 14:01:18,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:18,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 14:01:18,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 14:01:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 14:01:18,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 87 [2025-03-17 14:01:18,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 215 flow. Second operand has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-17 14:01:18,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:18,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 87 [2025-03-17 14:01:18,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:18,929 INFO L124 PetriNetUnfolderBase]: 6456/11576 cut-off events. [2025-03-17 14:01:18,929 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2025-03-17 14:01:18,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20703 conditions, 11576 events. 6456/11576 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 89187 event pairs, 5560 based on Foata normal form. 4/10924 useless extension candidates. Maximal degree in co-relation 20690. Up to 8807 conditions per place. [2025-03-17 14:01:18,967 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 39 selfloop transitions, 8 changer transitions 0/81 dead transitions. [2025-03-17 14:01:18,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 326 flow [2025-03-17 14:01:18,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:01:18,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:01:18,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 371 transitions. [2025-03-17 14:01:18,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5330459770114943 [2025-03-17 14:01:18,968 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 215 flow. Second operand 8 states and 371 transitions. [2025-03-17 14:01:18,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 326 flow [2025-03-17 14:01:18,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 308 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-17 14:01:18,970 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 227 flow [2025-03-17 14:01:18,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2025-03-17 14:01:18,970 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 7 predicate places. [2025-03-17 14:01:18,970 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 227 flow [2025-03-17 14:01:18,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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-17 14:01:18,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:18,972 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:18,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:01:19,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:01:19,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:19,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:19,172 INFO L85 PathProgramCache]: Analyzing trace with hash 376654489, now seen corresponding path program 2 times [2025-03-17 14:01:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392480008] [2025-03-17 14:01:19,173 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:01:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:19,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-17 14:01:19,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 19 statements. [2025-03-17 14:01:19,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:01:19,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:19,244 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-17 14:01:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392480008] [2025-03-17 14:01:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392480008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:19,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:19,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:19,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140145185] [2025-03-17 14:01:19,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:19,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:19,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:19,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:19,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-17 14:01:19,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-17 14:01:19,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:19,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-17 14:01:19,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:20,159 INFO L124 PetriNetUnfolderBase]: 9236/18484 cut-off events. [2025-03-17 14:01:20,159 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2025-03-17 14:01:20,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31651 conditions, 18484 events. 9236/18484 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 169905 event pairs, 6208 based on Foata normal form. 273/17739 useless extension candidates. Maximal degree in co-relation 31636. Up to 9797 conditions per place. [2025-03-17 14:01:20,229 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 86 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-17 14:01:20,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 521 flow [2025-03-17 14:01:20,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:20,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 276 transitions. [2025-03-17 14:01:20,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2025-03-17 14:01:20,230 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 227 flow. Second operand 5 states and 276 transitions. [2025-03-17 14:01:20,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 521 flow [2025-03-17 14:01:20,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:01:20,232 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 246 flow [2025-03-17 14:01:20,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=246, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2025-03-17 14:01:20,233 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 9 predicate places. [2025-03-17 14:01:20,233 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 246 flow [2025-03-17 14:01:20,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 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-17 14:01:20,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:20,233 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:20,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:01:20,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:20,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:20,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1238364226, now seen corresponding path program 1 times [2025-03-17 14:01:20,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:20,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030912139] [2025-03-17 14:01:20,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:20,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:20,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:20,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:20,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:20,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:20,360 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-17 14:01:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030912139] [2025-03-17 14:01:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030912139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:20,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:20,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:20,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018978756] [2025-03-17 14:01:20,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:20,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:01:20,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:20,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:01:20,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:01:20,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-17 14:01:20,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-17 14:01:20,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:20,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-17 14:01:20,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:21,907 INFO L124 PetriNetUnfolderBase]: 11243/22430 cut-off events. [2025-03-17 14:01:21,907 INFO L125 PetriNetUnfolderBase]: For 4786/4786 co-relation queries the response was YES. [2025-03-17 14:01:21,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41633 conditions, 22430 events. 11243/22430 cut-off events. For 4786/4786 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 209520 event pairs, 7651 based on Foata normal form. 330/21626 useless extension candidates. Maximal degree in co-relation 41615. Up to 11963 conditions per place. [2025-03-17 14:01:22,000 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 90 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2025-03-17 14:01:22,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 127 transitions, 574 flow [2025-03-17 14:01:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:01:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:01:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 274 transitions. [2025-03-17 14:01:22,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6298850574712643 [2025-03-17 14:01:22,002 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 246 flow. Second operand 5 states and 274 transitions. [2025-03-17 14:01:22,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 127 transitions, 574 flow [2025-03-17 14:01:22,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 573 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:22,004 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 272 flow [2025-03-17 14:01:22,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2025-03-17 14:01:22,005 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 14 predicate places. [2025-03-17 14:01:22,005 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 272 flow [2025-03-17 14:01:22,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 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-17 14:01:22,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:22,005 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:22,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:01:22,005 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:22,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1835218005, now seen corresponding path program 1 times [2025-03-17 14:01:22,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:22,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545484088] [2025-03-17 14:01:22,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:22,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:22,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:22,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:22,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:22,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:22,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545484088] [2025-03-17 14:01:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545484088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:22,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815478313] [2025-03-17 14:01:22,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:22,160 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-17 14:01:22,161 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-17 14:01:22,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:01:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:01:22,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:22,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:22,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:01:22,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:22,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 14:01:22,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815478313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:22,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:22,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:01:22,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208050484] [2025-03-17 14:01:22,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:22,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:01:22,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:01:22,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:01:22,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 87 [2025-03-17 14:01:22,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 272 flow. Second operand has 11 states, 11 states have (on average 40.72727272727273) internal successors, (448), 11 states have internal predecessors, (448), 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-17 14:01:22,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:22,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 87 [2025-03-17 14:01:22,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:24,704 INFO L124 PetriNetUnfolderBase]: 18461/36623 cut-off events. [2025-03-17 14:01:24,704 INFO L125 PetriNetUnfolderBase]: For 11316/11316 co-relation queries the response was YES. [2025-03-17 14:01:24,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72710 conditions, 36623 events. 18461/36623 cut-off events. For 11316/11316 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 363142 event pairs, 6904 based on Foata normal form. 333/35570 useless extension candidates. Maximal degree in co-relation 72689. Up to 12290 conditions per place. [2025-03-17 14:01:24,924 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 123 selfloop transitions, 7 changer transitions 0/162 dead transitions. [2025-03-17 14:01:24,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 162 transitions, 780 flow [2025-03-17 14:01:24,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:01:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:01:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-03-17 14:01:24,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590038314176245 [2025-03-17 14:01:24,926 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 272 flow. Second operand 6 states and 344 transitions. [2025-03-17 14:01:24,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 162 transitions, 780 flow [2025-03-17 14:01:24,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 162 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:24,934 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 312 flow [2025-03-17 14:01:24,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2025-03-17 14:01:24,934 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 20 predicate places. [2025-03-17 14:01:24,934 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 312 flow [2025-03-17 14:01:24,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 40.72727272727273) internal successors, (448), 11 states have internal predecessors, (448), 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-17 14:01:24,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:24,934 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:24,940 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-17 14:01:25,135 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,SelfDestructingSolverStorable20 [2025-03-17 14:01:25,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1057203743, now seen corresponding path program 1 times [2025-03-17 14:01:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:25,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609612084] [2025-03-17 14:01:25,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:25,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:25,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:01:25,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:01:25,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:25,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:25,186 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-17 14:01:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:25,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609612084] [2025-03-17 14:01:25,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609612084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:25,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:25,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:01:25,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775718168] [2025-03-17 14:01:25,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:25,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:25,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:25,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:25,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:25,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 87 [2025-03-17 14:01:25,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-17 14:01:25,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:25,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 87 [2025-03-17 14:01:25,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:27,421 INFO L124 PetriNetUnfolderBase]: 15860/29657 cut-off events. [2025-03-17 14:01:27,421 INFO L125 PetriNetUnfolderBase]: For 12432/12432 co-relation queries the response was YES. [2025-03-17 14:01:27,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65600 conditions, 29657 events. 15860/29657 cut-off events. For 12432/12432 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 269072 event pairs, 2062 based on Foata normal form. 999/29774 useless extension candidates. Maximal degree in co-relation 65576. Up to 18243 conditions per place. [2025-03-17 14:01:27,609 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 71 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-03-17 14:01:27,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 107 transitions, 532 flow [2025-03-17 14:01:27,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:27,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2025-03-17 14:01:27,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-03-17 14:01:27,610 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 312 flow. Second operand 3 states and 177 transitions. [2025-03-17 14:01:27,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 107 transitions, 532 flow [2025-03-17 14:01:27,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 107 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:01:27,658 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 313 flow [2025-03-17 14:01:27,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-03-17 14:01:27,659 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 20 predicate places. [2025-03-17 14:01:27,659 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 313 flow [2025-03-17 14:01:27,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-17 14:01:27,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:27,660 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:27,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 14:01:27,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-03-17 14:01:27,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 703596848, now seen corresponding path program 1 times [2025-03-17 14:01:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486302877] [2025-03-17 14:01:27,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:27,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:01:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:01:27,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:27,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:27,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:01:27,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 14:01:27,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 14:01:27,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:01:27,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:01:27,689 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (12 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-03-17 14:01:27,689 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-03-17 14:01:27,690 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-03-17 14:01:27,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 14:01:27,690 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 14:01:27,690 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 14:01:27,690 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-17 14:01:27,715 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 14:01:27,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 112 transitions, 252 flow [2025-03-17 14:01:27,723 INFO L124 PetriNetUnfolderBase]: 17/131 cut-off events. [2025-03-17 14:01:27,723 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-17 14:01:27,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 131 events. 17/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 492 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 109. Up to 5 conditions per place. [2025-03-17 14:01:27,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 112 transitions, 252 flow [2025-03-17 14:01:27,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 112 transitions, 252 flow [2025-03-17 14:01:27,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:01:27,726 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;@2e0d1498, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:01:27,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-17 14:01:27,726 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:01:27,726 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:01:27,727 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:01:27,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:27,727 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:27,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:27,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:27,727 INFO L85 PathProgramCache]: Analyzing trace with hash 512602, now seen corresponding path program 1 times [2025-03-17 14:01:27,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:27,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261756782] [2025-03-17 14:01:27,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:27,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:27,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:27,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:27,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:27,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:27,746 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-17 14:01:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261756782] [2025-03-17 14:01:27,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261756782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:27,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:27,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:27,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921368553] [2025-03-17 14:01:27,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:27,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:27,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:27,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:27,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 112 [2025-03-17 14:01:27,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-17 14:01:27,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:27,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 112 [2025-03-17 14:01:27,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:34,454 INFO L124 PetriNetUnfolderBase]: 80126/124925 cut-off events. [2025-03-17 14:01:34,455 INFO L125 PetriNetUnfolderBase]: For 9197/9197 co-relation queries the response was YES. [2025-03-17 14:01:35,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230320 conditions, 124925 events. 80126/124925 cut-off events. For 9197/9197 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 1088087 event pairs, 69712 based on Foata normal form. 31555/150628 useless extension candidates. Maximal degree in co-relation 20819. Up to 101391 conditions per place. [2025-03-17 14:01:35,433 INFO L140 encePairwiseOnDemand]: 97/112 looper letters, 45 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2025-03-17 14:01:35,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 304 flow [2025-03-17 14:01:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:35,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-17 14:01:35,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-17 14:01:35,434 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 252 flow. Second operand 3 states and 201 transitions. [2025-03-17 14:01:35,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 304 flow [2025-03-17 14:01:35,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 298 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 14:01:35,439 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 208 flow [2025-03-17 14:01:35,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-03-17 14:01:35,439 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2025-03-17 14:01:35,439 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 208 flow [2025-03-17 14:01:35,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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-17 14:01:35,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:35,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:01:35,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 14:01:35,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:35,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:35,440 INFO L85 PathProgramCache]: Analyzing trace with hash 512603, now seen corresponding path program 1 times [2025-03-17 14:01:35,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:35,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832736306] [2025-03-17 14:01:35,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:35,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:35,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:01:35,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:01:35,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:35,465 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-17 14:01:35,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832736306] [2025-03-17 14:01:35,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832736306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:01:35,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:01:35,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:01:35,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658741568] [2025-03-17 14:01:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:01:35,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:01:35,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:35,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:01:35,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:01:35,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-03-17 14:01:35,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-17 14:01:35,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:35,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-03-17 14:01:35,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:01:42,867 INFO L124 PetriNetUnfolderBase]: 80126/124927 cut-off events. [2025-03-17 14:01:42,868 INFO L125 PetriNetUnfolderBase]: For 3919/3919 co-relation queries the response was YES. [2025-03-17 14:01:43,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228788 conditions, 124927 events. 80126/124927 cut-off events. For 3919/3919 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 1088219 event pairs, 69712 based on Foata normal form. 0/119074 useless extension candidates. Maximal degree in co-relation 228778. Up to 101393 conditions per place. [2025-03-17 14:01:43,648 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 47 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2025-03-17 14:01:43,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 94 transitions, 310 flow [2025-03-17 14:01:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:01:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:01:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2025-03-17 14:01:43,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-17 14:01:43,650 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 208 flow. Second operand 3 states and 204 transitions. [2025-03-17 14:01:43,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 94 transitions, 310 flow [2025-03-17 14:01:43,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 309 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:01:43,659 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 221 flow [2025-03-17 14:01:43,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2025-03-17 14:01:43,659 INFO L279 CegarLoopForPetriNet]: 104 programPoint places, -8 predicate places. [2025-03-17 14:01:43,659 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 221 flow [2025-03-17 14:01:43,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-17 14:01:43,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:01:43,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:01:43,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 14:01:43,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 16 more)] === [2025-03-17 14:01:43,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:01:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 492628210, now seen corresponding path program 1 times [2025-03-17 14:01:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:01:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130733981] [2025-03-17 14:01:43,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:43,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:01:43,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:43,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:43,699 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-17 14:01:43,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:01:43,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130733981] [2025-03-17 14:01:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130733981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:01:43,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41117507] [2025-03-17 14:01:43,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:01:43,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:01:43,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:01:43,702 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-17 14:01:43,703 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-17 14:01:43,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:01:43,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:01:43,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:01:43,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:01:43,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:01:43,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:01:43,802 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-17 14:01:43,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:01:43,828 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-17 14:01:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41117507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:01:43,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:01:43,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-03-17 14:01:43,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819393941] [2025-03-17 14:01:43,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:01:43,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:01:43,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:01:43,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:01:43,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:01:43,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-03-17 14:01:43,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 52.875) internal successors, (423), 8 states have internal predecessors, (423), 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-17 14:01:43,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:01:43,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-03-17 14:01:43,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand