./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-node-subst.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:07:16,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:07:16,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:07:16,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:07:16,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:07:16,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:07:16,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:07:16,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:07:16,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:07:16,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:07:16,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:07:16,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:07:16,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:07:16,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:07:16,904 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:07:16,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:07:16,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:16,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:07:16,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:07:16,906 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-03-04 10:07:17,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:07:17,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:07:17,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:07:17,200 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:07:17,200 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:07:17,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-04 10:07:18,326 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185351150/65ab4e6b4c054983a37d0b0c0c485e3b/FLAG0d859186a [2025-03-04 10:07:18,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:07:18,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-03-04 10:07:18,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185351150/65ab4e6b4c054983a37d0b0c0c485e3b/FLAG0d859186a [2025-03-04 10:07:18,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/185351150/65ab4e6b4c054983a37d0b0c0c485e3b [2025-03-04 10:07:18,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:07:18,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:07:18,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:18,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:07:18,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:07:18,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:18" (1/1) ... [2025-03-04 10:07:18,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ba8ab43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:18, skipping insertion in model container [2025-03-04 10:07:18,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:18" (1/1) ... [2025-03-04 10:07:18,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:07:19,029 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:07:19,033 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:07:19,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:19,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:07:19,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:19,094 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:07:19,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19 WrapperNode [2025-03-04 10:07:19,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:19,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:19,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:07:19,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:07:19,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,106 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,126 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 408 [2025-03-04 10:07:19,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:19,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:07:19,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:07:19,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:07:19,142 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,168 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-04 10:07:19,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:07:19,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:07:19,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:07:19,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:07:19,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (1/1) ... [2025-03-04 10:07:19,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:19,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:19,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:07:19,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:07:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:07:19,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:07:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:07:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:07:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:07:19,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:07:19,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:07:19,240 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:07:19,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:07:19,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:07:19,836 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:07:19,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:07:20,131 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:07:20,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:07:20,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:20 BoogieIcfgContainer [2025-03-04 10:07:20,132 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:07:20,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:07:20,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:07:20,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:07:20,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:07:18" (1/3) ... [2025-03-04 10:07:20,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5c13a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:20, skipping insertion in model container [2025-03-04 10:07:20,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:19" (2/3) ... [2025-03-04 10:07:20,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b5c13a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:20, skipping insertion in model container [2025-03-04 10:07:20,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:20" (3/3) ... [2025-03-04 10:07:20,140 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-03-04 10:07:20,156 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:07:20,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 109 locations, 1 initial locations, 6 loop locations, and 50 error locations. [2025-03-04 10:07:20,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:07:20,255 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:07:20,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 261 flow [2025-03-04 10:07:20,329 INFO L124 PetriNetUnfolderBase]: 12/117 cut-off events. [2025-03-04 10:07:20,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:07:20,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 12/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 385 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-03-04 10:07:20,336 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 261 flow [2025-03-04 10:07:20,340 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 116 transitions, 250 flow [2025-03-04 10:07:20,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:07:20,353 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;@3dbf4240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:07:20,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-03-04 10:07:20,356 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:07:20,357 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:07:20,357 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:07:20,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:20,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:20,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1218081, now seen corresponding path program 1 times [2025-03-04 10:07:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:20,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523519172] [2025-03-04 10:07:20,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:20,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:20,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:20,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:20,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:20,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:20,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:20,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523519172] [2025-03-04 10:07:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523519172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:07:20,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711395188] [2025-03-04 10:07:20,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:20,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:20,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:20,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:20,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:20,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:20,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:20,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:20,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:20,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:21,234 INFO L124 PetriNetUnfolderBase]: 2263/4993 cut-off events. [2025-03-04 10:07:21,234 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-04 10:07:21,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 4993 events. 2263/4993 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40782 event pairs, 1414 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7651. Up to 3012 conditions per place. [2025-03-04 10:07:21,273 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 48 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 10:07:21,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 340 flow [2025-03-04 10:07:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-04 10:07:21,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-03-04 10:07:21,283 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 250 flow. Second operand 3 states and 249 transitions. [2025-03-04 10:07:21,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 340 flow [2025-03-04 10:07:21,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:21,290 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 232 flow [2025-03-04 10:07:21,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2025-03-04 10:07:21,297 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -9 predicate places. [2025-03-04 10:07:21,297 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 232 flow [2025-03-04 10:07:21,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:21,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:21,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:21,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:07:21,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:21,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1218082, now seen corresponding path program 1 times [2025-03-04 10:07:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:21,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092964726] [2025-03-04 10:07:21,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:21,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:21,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:21,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:21,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:21,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:21,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092964726] [2025-03-04 10:07:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092964726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:21,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345425346] [2025-03-04 10:07:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:21,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:21,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:21,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:21,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:21,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:21,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:21,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:21,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:21,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:22,268 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-03-04 10:07:22,268 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 10:07:22,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 4995 events. 2263/4995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40852 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8038. Up to 3024 conditions per place. [2025-03-04 10:07:22,300 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 53 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-04 10:07:22,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 346 flow [2025-03-04 10:07:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-03-04 10:07:22,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 10:07:22,304 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 232 flow. Second operand 3 states and 252 transitions. [2025-03-04 10:07:22,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 346 flow [2025-03-04 10:07:22,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:22,306 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 242 flow [2025-03-04 10:07:22,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2025-03-04 10:07:22,307 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2025-03-04 10:07:22,307 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 242 flow [2025-03-04 10:07:22,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:22,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:22,308 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:07:22,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:07:22,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1170614776, now seen corresponding path program 1 times [2025-03-04 10:07:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310044731] [2025-03-04 10:07:22,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:22,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:22,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:22,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310044731] [2025-03-04 10:07:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310044731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:22,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789270719] [2025-03-04 10:07:22,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:22,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:22,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:22,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:07:22,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:22,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:22,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:22,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:07:22,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:22,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:07:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:22,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789270719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:22,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:07:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996154371] [2025-03-04 10:07:22,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:22,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:07:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:22,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:07:22,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:07:23,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:23,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 242 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:23,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:23,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:23,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:23,995 INFO L124 PetriNetUnfolderBase]: 2263/4994 cut-off events. [2025-03-04 10:07:23,995 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 10:07:24,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4994 events. 2263/4994 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40885 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8062. Up to 3018 conditions per place. [2025-03-04 10:07:24,021 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-04 10:07:24,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 348 flow [2025-03-04 10:07:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2025-03-04 10:07:24,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-03-04 10:07:24,023 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 242 flow. Second operand 6 states and 445 transitions. [2025-03-04 10:07:24,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 348 flow [2025-03-04 10:07:24,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:24,025 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 258 flow [2025-03-04 10:07:24,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2025-03-04 10:07:24,028 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -4 predicate places. [2025-03-04 10:07:24,028 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 258 flow [2025-03-04 10:07:24,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:24,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:24,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:07:24,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:07:24,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:24,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:24,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:24,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1929322272, now seen corresponding path program 1 times [2025-03-04 10:07:24,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:24,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742259640] [2025-03-04 10:07:24,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:24,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:24,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:07:24,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:07:24,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:24,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:24,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:24,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742259640] [2025-03-04 10:07:24,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742259640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:24,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:24,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:24,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98094549] [2025-03-04 10:07:24,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:24,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:24,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:24,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:24,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:24,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:24,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:24,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:24,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:24,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:24,933 INFO L124 PetriNetUnfolderBase]: 2264/4997 cut-off events. [2025-03-04 10:07:24,933 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:07:24,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4997 events. 2264/4997 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40896 event pairs, 1414 based on Foata normal form. 1/3843 useless extension candidates. Maximal degree in co-relation 8062. Up to 3023 conditions per place. [2025-03-04 10:07:24,959 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 52 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-04 10:07:24,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 378 flow [2025-03-04 10:07:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-03-04 10:07:24,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-04 10:07:24,961 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 258 flow. Second operand 4 states and 318 transitions. [2025-03-04 10:07:24,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 378 flow [2025-03-04 10:07:24,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 366 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:24,963 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 271 flow [2025-03-04 10:07:24,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2025-03-04 10:07:24,963 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-03-04 10:07:24,963 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 271 flow [2025-03-04 10:07:24,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:24,964 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:24,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:24,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:07:24,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:24,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:24,964 INFO L85 PathProgramCache]: Analyzing trace with hash -320547379, now seen corresponding path program 1 times [2025-03-04 10:07:24,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:24,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141314680] [2025-03-04 10:07:24,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:24,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:24,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:07:24,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:07:24,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:24,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:25,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141314680] [2025-03-04 10:07:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141314680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557841308] [2025-03-04 10:07:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:25,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:25,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:25,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:25,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:25,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:25,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,350 INFO L124 PetriNetUnfolderBase]: 2263/4996 cut-off events. [2025-03-04 10:07:25,350 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:07:25,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4996 events. 2263/4996 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40866 event pairs, 1414 based on Foata normal form. 1/3844 useless extension candidates. Maximal degree in co-relation 8063. Up to 3020 conditions per place. [2025-03-04 10:07:25,378 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 50 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 10:07:25,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 376 flow [2025-03-04 10:07:25,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-03-04 10:07:25,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-04 10:07:25,381 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 271 flow. Second operand 4 states and 327 transitions. [2025-03-04 10:07:25,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 376 flow [2025-03-04 10:07:25,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:25,384 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 270 flow [2025-03-04 10:07:25,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 10:07:25,385 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -2 predicate places. [2025-03-04 10:07:25,386 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 270 flow [2025-03-04 10:07:25,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:25,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:25,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:25,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:07:25,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:25,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1347131331, now seen corresponding path program 1 times [2025-03-04 10:07:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:25,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112295163] [2025-03-04 10:07:25,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:25,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:07:25,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:07:25,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:25,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112295163] [2025-03-04 10:07:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112295163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876135731] [2025-03-04 10:07:25,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:25,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:25,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:25,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:25,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:07:25,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:07:25,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:07:25,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:25,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:07:25,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:25,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:25,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:25,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876135731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:25,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:25,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:07:25,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496284278] [2025-03-04 10:07:25,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:07:25,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:07:25,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:26,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:26,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:26,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:27,057 INFO L124 PetriNetUnfolderBase]: 2265/5001 cut-off events. [2025-03-04 10:07:27,057 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:27,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 5001 events. 2265/5001 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40853 event pairs, 1414 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 8069. Up to 3016 conditions per place. [2025-03-04 10:07:27,080 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 45 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2025-03-04 10:07:27,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 119 transitions, 417 flow [2025-03-04 10:07:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 648 transitions. [2025-03-04 10:07:27,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:07:27,082 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 270 flow. Second operand 9 states and 648 transitions. [2025-03-04 10:07:27,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 119 transitions, 417 flow [2025-03-04 10:07:27,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:27,084 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 317 flow [2025-03-04 10:07:27,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2025-03-04 10:07:27,084 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-03-04 10:07:27,084 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 317 flow [2025-03-04 10:07:27,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:27,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:27,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:27,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:27,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:07:27,289 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606032, now seen corresponding path program 1 times [2025-03-04 10:07:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625450746] [2025-03-04 10:07:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:27,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:27,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:07:27,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:27,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:27,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625450746] [2025-03-04 10:07:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625450746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016061196] [2025-03-04 10:07:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:27,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:27,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:27,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:27,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:27,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:27,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:27,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:27,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:27,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:27,945 INFO L124 PetriNetUnfolderBase]: 2265/5003 cut-off events. [2025-03-04 10:07:27,946 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 10:07:27,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 5003 events. 2265/5003 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40872 event pairs, 1414 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 8080. Up to 3028 conditions per place. [2025-03-04 10:07:27,973 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 58 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-03-04 10:07:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 447 flow [2025-03-04 10:07:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:27,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:27,975 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 317 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:27,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 447 flow [2025-03-04 10:07:27,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 428 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:27,977 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 321 flow [2025-03-04 10:07:27,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2025-03-04 10:07:27,978 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-03-04 10:07:27,978 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 321 flow [2025-03-04 10:07:27,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:27,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:27,978 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:07:27,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:27,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash -210864714, now seen corresponding path program 1 times [2025-03-04 10:07:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682586179] [2025-03-04 10:07:27,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:27,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:07:27,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:27,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682586179] [2025-03-04 10:07:28,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682586179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642209172] [2025-03-04 10:07:28,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:28,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:28,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:07:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:07:28,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:28,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:28,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:28,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:07:28,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:28,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:28,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642209172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:28,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:28,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:07:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580077885] [2025-03-04 10:07:28,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:28,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:07:28,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:28,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:07:28,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:29,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:29,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 321 flow. Second operand has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:29,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:29,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:29,502 INFO L124 PetriNetUnfolderBase]: 2266/5005 cut-off events. [2025-03-04 10:07:29,502 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:29,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8131 conditions, 5005 events. 2266/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40812 event pairs, 1414 based on Foata normal form. 0/3851 useless extension candidates. Maximal degree in co-relation 8086. Up to 3020 conditions per place. [2025-03-04 10:07:29,537 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 47 selfloop transitions, 18 changer transitions 0/123 dead transitions. [2025-03-04 10:07:29,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 458 flow [2025-03-04 10:07:29,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 647 transitions. [2025-03-04 10:07:29,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990740740740741 [2025-03-04 10:07:29,539 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 321 flow. Second operand 9 states and 647 transitions. [2025-03-04 10:07:29,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 458 flow [2025-03-04 10:07:29,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:29,544 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 359 flow [2025-03-04 10:07:29,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-03-04 10:07:29,546 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-04 10:07:29,546 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 359 flow [2025-03-04 10:07:29,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:29,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:29,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:29,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:07:29,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:29,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131108, now seen corresponding path program 1 times [2025-03-04 10:07:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858009834] [2025-03-04 10:07:29,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:29,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:29,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858009834] [2025-03-04 10:07:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858009834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56137655] [2025-03-04 10:07:29,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:29,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:29,950 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:29,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:07:30,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:30,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:30,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:30,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:30,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:30,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:30,077 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56137655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:07:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026306358] [2025-03-04 10:07:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:30,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:30,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:30,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:30,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:07:30,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:30,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:30,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:30,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:30,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:30,431 INFO L124 PetriNetUnfolderBase]: 2267/5009 cut-off events. [2025-03-04 10:07:30,432 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:07:30,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 5009 events. 2267/5009 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40876 event pairs, 1414 based on Foata normal form. 0/3854 useless extension candidates. Maximal degree in co-relation 8105. Up to 3038 conditions per place. [2025-03-04 10:07:30,450 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 66 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-04 10:07:30,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 507 flow [2025-03-04 10:07:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:30,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:30,452 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 359 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:30,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 507 flow [2025-03-04 10:07:30,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 482 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:30,454 INFO L231 Difference]: Finished difference. Result has 121 places, 125 transitions, 358 flow [2025-03-04 10:07:30,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=121, PETRI_TRANSITIONS=125} [2025-03-04 10:07:30,455 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-04 10:07:30,455 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 125 transitions, 358 flow [2025-03-04 10:07:30,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:30,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:30,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:30,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:30,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:30,657 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:30,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:30,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131107, now seen corresponding path program 1 times [2025-03-04 10:07:30,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:30,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302847904] [2025-03-04 10:07:30,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:30,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:30,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:30,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:30,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302847904] [2025-03-04 10:07:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302847904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:30,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657118340] [2025-03-04 10:07:30,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:30,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:30,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:30,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:30,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:30,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 125 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:30,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:30,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:30,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,019 INFO L124 PetriNetUnfolderBase]: 2267/5005 cut-off events. [2025-03-04 10:07:31,019 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 5005 events. 2267/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40850 event pairs, 1414 based on Foata normal form. 2/3855 useless extension candidates. Maximal degree in co-relation 8098. Up to 3026 conditions per place. [2025-03-04 10:07:31,041 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 64 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-04 10:07:31,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 486 flow [2025-03-04 10:07:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-04 10:07:31,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-03-04 10:07:31,043 INFO L175 Difference]: Start difference. First operand has 121 places, 125 transitions, 358 flow. Second operand 3 states and 248 transitions. [2025-03-04 10:07:31,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 486 flow [2025-03-04 10:07:31,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:31,045 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 352 flow [2025-03-04 10:07:31,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2025-03-04 10:07:31,045 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-03-04 10:07:31,045 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 352 flow [2025-03-04 10:07:31,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:31,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:07:31,046 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash -777442915, now seen corresponding path program 1 times [2025-03-04 10:07:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707864279] [2025-03-04 10:07:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:31,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:07:31,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:07:31,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:31,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:31,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707864279] [2025-03-04 10:07:31,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707864279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:31,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:31,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:31,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598289116] [2025-03-04 10:07:31,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:31,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:31,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:31,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:31,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:31,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,437 INFO L124 PetriNetUnfolderBase]: 2266/5004 cut-off events. [2025-03-04 10:07:31,437 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:31,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 5004 events. 2266/5004 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40854 event pairs, 1414 based on Foata normal form. 1/3854 useless extension candidates. Maximal degree in co-relation 8096. Up to 3034 conditions per place. [2025-03-04 10:07:31,460 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 63 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-03-04 10:07:31,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 484 flow [2025-03-04 10:07:31,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:31,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:07:31,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:07:31,462 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 352 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:07:31,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 484 flow [2025-03-04 10:07:31,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 122 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:31,463 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 350 flow [2025-03-04 10:07:31,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-03-04 10:07:31,464 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-03-04 10:07:31,464 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 350 flow [2025-03-04 10:07:31,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:31,464 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:31,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:07:31,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:31,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:31,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1669043914, now seen corresponding path program 1 times [2025-03-04 10:07:31,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:31,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755418169] [2025-03-04 10:07:31,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:31,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:31,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:07:31,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:07:31,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:31,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:31,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755418169] [2025-03-04 10:07:31,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755418169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:31,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259311177] [2025-03-04 10:07:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:31,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:31,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:31,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:31,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:07:31,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:07:31,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:07:31,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:31,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:31,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:31,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:31,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:31,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259311177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:31,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:31,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:07:31,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548812357] [2025-03-04 10:07:31,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:31,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:31,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:31,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:31,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 350 flow. Second operand has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:31,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:32,507 INFO L124 PetriNetUnfolderBase]: 4460/9788 cut-off events. [2025-03-04 10:07:32,508 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 10:07:32,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 9788 events. 4460/9788 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 89607 event pairs, 2808 based on Foata normal form. 1/7627 useless extension candidates. Maximal degree in co-relation 8089. Up to 3008 conditions per place. [2025-03-04 10:07:32,552 INFO L140 encePairwiseOnDemand]: 108/120 looper letters, 88 selfloop transitions, 34 changer transitions 0/177 dead transitions. [2025-03-04 10:07:32,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 177 transitions, 758 flow [2025-03-04 10:07:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 782 transitions. [2025-03-04 10:07:32,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516666666666666 [2025-03-04 10:07:32,554 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 350 flow. Second operand 10 states and 782 transitions. [2025-03-04 10:07:32,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 177 transitions, 758 flow [2025-03-04 10:07:32,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 177 transitions, 744 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:32,557 INFO L231 Difference]: Finished difference. Result has 128 places, 137 transitions, 506 flow [2025-03-04 10:07:32,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=506, PETRI_PLACES=128, PETRI_TRANSITIONS=137} [2025-03-04 10:07:32,557 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 14 predicate places. [2025-03-04 10:07:32,558 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 137 transitions, 506 flow [2025-03-04 10:07:32,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:07:32,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:07:32,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 200755959, now seen corresponding path program 1 times [2025-03-04 10:07:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314149806] [2025-03-04 10:07:32,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:32,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:32,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314149806] [2025-03-04 10:07:32,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314149806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220052416] [2025-03-04 10:07:32,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:32,964 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:32,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:07:33,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:33,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:33,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:33,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:33,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:33,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:33,135 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:33,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220052416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:33,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:33,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-04 10:07:33,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445135002] [2025-03-04 10:07:33,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:33,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:33,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:33,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:33,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:33,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 137 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:33,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:33,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:33,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:33,753 INFO L124 PetriNetUnfolderBase]: 4530/10002 cut-off events. [2025-03-04 10:07:33,753 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-04 10:07:33,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 10002 events. 4530/10002 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91853 event pairs, 2828 based on Foata normal form. 0/7699 useless extension candidates. Maximal degree in co-relation 8121. Up to 6070 conditions per place. [2025-03-04 10:07:33,795 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 83 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2025-03-04 10:07:33,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 688 flow [2025-03-04 10:07:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:33,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:33,797 INFO L175 Difference]: Start difference. First operand has 128 places, 137 transitions, 506 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:33,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 688 flow [2025-03-04 10:07:33,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 684 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:33,800 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 526 flow [2025-03-04 10:07:33,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-03-04 10:07:33,801 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 17 predicate places. [2025-03-04 10:07:33,801 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 526 flow [2025-03-04 10:07:33,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:33,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:33,801 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:33,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:07:34,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:34,002 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:34,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1928469381, now seen corresponding path program 1 times [2025-03-04 10:07:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:34,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39180379] [2025-03-04 10:07:34,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:34,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:34,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:07:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:34,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:34,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39180379] [2025-03-04 10:07:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39180379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016513839] [2025-03-04 10:07:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:34,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:34,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:34,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:34,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:34,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:34,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:34,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:34,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:34,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:34,673 INFO L124 PetriNetUnfolderBase]: 4528/10000 cut-off events. [2025-03-04 10:07:34,673 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 10:07:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16302 conditions, 10000 events. 4528/10000 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91822 event pairs, 2828 based on Foata normal form. 2/7708 useless extension candidates. Maximal degree in co-relation 8122. Up to 6063 conditions per place. [2025-03-04 10:07:34,721 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 80 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2025-03-04 10:07:34,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 691 flow [2025-03-04 10:07:34,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:34,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:07:34,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:07:34,723 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 526 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:07:34,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 691 flow [2025-03-04 10:07:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:34,726 INFO L231 Difference]: Finished difference. Result has 132 places, 138 transitions, 524 flow [2025-03-04 10:07:34,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=132, PETRI_TRANSITIONS=138} [2025-03-04 10:07:34,727 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 18 predicate places. [2025-03-04 10:07:34,728 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 138 transitions, 524 flow [2025-03-04 10:07:34,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:34,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:34,728 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:34,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:07:34,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:34,729 INFO L85 PathProgramCache]: Analyzing trace with hash 274620724, now seen corresponding path program 2 times [2025-03-04 10:07:34,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:34,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110490966] [2025-03-04 10:07:34,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:34,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:34,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:07:34,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:34,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:34,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:34,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110490966] [2025-03-04 10:07:34,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110490966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:34,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663605360] [2025-03-04 10:07:34,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:34,912 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:34,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:07:34,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:07:35,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:35,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:35,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:35,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:07:35,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:35,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 10:07:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:35,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:35,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663605360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:35,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:35,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 18 [2025-03-04 10:07:35,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018242976] [2025-03-04 10:07:35,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:35,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:07:35,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:35,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:07:35,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:07:36,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:36,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 138 transitions, 524 flow. Second operand has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:36,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:36,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:36,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:37,265 INFO L124 PetriNetUnfolderBase]: 6725/14793 cut-off events. [2025-03-04 10:07:37,265 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 10:07:37,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24167 conditions, 14793 events. 6725/14793 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 143971 event pairs, 4222 based on Foata normal form. 0/11486 useless extension candidates. Maximal degree in co-relation 8134. Up to 6055 conditions per place. [2025-03-04 10:07:37,333 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 126 selfloop transitions, 27 changer transitions 0/205 dead transitions. [2025-03-04 10:07:37,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 205 transitions, 1097 flow [2025-03-04 10:07:37,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:07:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:07:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1223 transitions. [2025-03-04 10:07:37,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995098039215686 [2025-03-04 10:07:37,337 INFO L175 Difference]: Start difference. First operand has 132 places, 138 transitions, 524 flow. Second operand 17 states and 1223 transitions. [2025-03-04 10:07:37,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 205 transitions, 1097 flow [2025-03-04 10:07:37,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 1083 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:37,341 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 651 flow [2025-03-04 10:07:37,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=651, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2025-03-04 10:07:37,341 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 31 predicate places. [2025-03-04 10:07:37,341 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 651 flow [2025-03-04 10:07:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:37,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:37,342 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:37,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:07:37,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:37,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:37,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash -347012561, now seen corresponding path program 1 times [2025-03-04 10:07:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:37,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647564958] [2025-03-04 10:07:37,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:37,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:37,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:37,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:37,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:37,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647564958] [2025-03-04 10:07:37,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647564958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:37,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178655299] [2025-03-04 10:07:37,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:37,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:37,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:37,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:37,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:07:37,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:37,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:37,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:37,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:37,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:37,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:37,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:37,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178655299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:37,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:37,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:07:37,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333850162] [2025-03-04 10:07:37,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:37,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:37,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:37,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:37,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:37,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:37,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 651 flow. Second operand has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:37,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:37,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:37,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:39,896 INFO L124 PetriNetUnfolderBase]: 13369/29333 cut-off events. [2025-03-04 10:07:39,896 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-03-04 10:07:39,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47876 conditions, 29333 events. 13369/29333 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 316741 event pairs, 8424 based on Foata normal form. 3/22874 useless extension candidates. Maximal degree in co-relation 15949. Up to 9042 conditions per place. [2025-03-04 10:07:40,122 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 119 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2025-03-04 10:07:40,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 220 transitions, 1316 flow [2025-03-04 10:07:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:40,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2025-03-04 10:07:40,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6601851851851852 [2025-03-04 10:07:40,124 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 651 flow. Second operand 9 states and 713 transitions. [2025-03-04 10:07:40,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 220 transitions, 1316 flow [2025-03-04 10:07:40,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 220 transitions, 1150 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:40,129 INFO L231 Difference]: Finished difference. Result has 150 places, 168 transitions, 838 flow [2025-03-04 10:07:40,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=838, PETRI_PLACES=150, PETRI_TRANSITIONS=168} [2025-03-04 10:07:40,130 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 36 predicate places. [2025-03-04 10:07:40,130 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 168 transitions, 838 flow [2025-03-04 10:07:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:40,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:40,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:40,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:07:40,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:40,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2127514445, now seen corresponding path program 1 times [2025-03-04 10:07:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:40,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520131642] [2025-03-04 10:07:40,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:40,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:07:40,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:07:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520131642] [2025-03-04 10:07:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520131642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141031896] [2025-03-04 10:07:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:40,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:40,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:40,533 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:40,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:07:40,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:07:40,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:07:40,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:40,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:40,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:40,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:40,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141031896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:40,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:40,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-04 10:07:40,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74943938] [2025-03-04 10:07:40,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:40,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:40,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:40,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:40,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 168 transitions, 838 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:40,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:40,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:40,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:42,537 INFO L124 PetriNetUnfolderBase]: 13579/29975 cut-off events. [2025-03-04 10:07:42,537 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-04 10:07:42,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48831 conditions, 29975 events. 13579/29975 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 325546 event pairs, 8484 based on Foata normal form. 0/23078 useless extension candidates. Maximal degree in co-relation 16575. Up to 18179 conditions per place. [2025-03-04 10:07:42,728 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 114 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2025-03-04 10:07:42,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 1082 flow [2025-03-04 10:07:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:42,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-03-04 10:07:42,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-04 10:07:42,729 INFO L175 Difference]: Start difference. First operand has 150 places, 168 transitions, 838 flow. Second operand 4 states and 316 transitions. [2025-03-04 10:07:42,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 1082 flow [2025-03-04 10:07:42,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 171 transitions, 1080 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 10:07:42,733 INFO L231 Difference]: Finished difference. Result has 154 places, 170 transitions, 860 flow [2025-03-04 10:07:42,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=154, PETRI_TRANSITIONS=170} [2025-03-04 10:07:42,733 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places. [2025-03-04 10:07:42,733 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 170 transitions, 860 flow [2025-03-04 10:07:42,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:42,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:42,734 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:42,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:07:42,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:07:42,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:42,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:42,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1564224270, now seen corresponding path program 2 times [2025-03-04 10:07:42,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377103083] [2025-03-04 10:07:42,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:42,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:07:42,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:07:42,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:42,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377103083] [2025-03-04 10:07:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377103083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190048763] [2025-03-04 10:07:43,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:43,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:43,116 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:43,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:07:43,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:07:43,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:07:43,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:43,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:43,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:07:43,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:43,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2025-03-04 10:07:43,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 10:07:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:43,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-03-04 10:07:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:43,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:43,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190048763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:43,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:43,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 10:07:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37866092] [2025-03-04 10:07:43,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:43,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:07:43,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:43,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:07:43,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:07:44,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 120 [2025-03-04 10:07:44,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 170 transitions, 860 flow. Second operand has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:44,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:44,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 120 [2025-03-04 10:07:44,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:48,426 INFO L124 PetriNetUnfolderBase]: 19966/43725 cut-off events. [2025-03-04 10:07:48,426 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-03-04 10:07:48,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71581 conditions, 43725 events. 19966/43725 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 2152. Compared 495368 event pairs, 12606 based on Foata normal form. 0/34239 useless extension candidates. Maximal degree in co-relation 24272. Up to 9045 conditions per place. [2025-03-04 10:07:48,812 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 191 selfloop transitions, 69 changer transitions 0/312 dead transitions. [2025-03-04 10:07:48,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 312 transitions, 1955 flow [2025-03-04 10:07:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:07:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:07:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1464 transitions. [2025-03-04 10:07:48,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-04 10:07:48,815 INFO L175 Difference]: Start difference. First operand has 154 places, 170 transitions, 860 flow. Second operand 21 states and 1464 transitions. [2025-03-04 10:07:48,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 312 transitions, 1955 flow [2025-03-04 10:07:48,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 312 transitions, 1942 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:48,820 INFO L231 Difference]: Finished difference. Result has 179 places, 209 transitions, 1381 flow [2025-03-04 10:07:48,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1381, PETRI_PLACES=179, PETRI_TRANSITIONS=209} [2025-03-04 10:07:48,821 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-04 10:07:48,821 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 209 transitions, 1381 flow [2025-03-04 10:07:48,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:48,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:48,821 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:48,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:49,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:07:49,022 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:49,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:49,022 INFO L85 PathProgramCache]: Analyzing trace with hash 136986471, now seen corresponding path program 1 times [2025-03-04 10:07:49,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:49,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382334958] [2025-03-04 10:07:49,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:49,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:49,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:49,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:49,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:49,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:49,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382334958] [2025-03-04 10:07:49,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382334958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:49,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782941391] [2025-03-04 10:07:49,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:49,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:49,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:49,120 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:49,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:07:49,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:49,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:49,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:49,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:49,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:49,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:49,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782941391] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:49,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:49,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:07:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130472171] [2025-03-04 10:07:49,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:49,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:49,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:49,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:49,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:49,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:49,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 209 transitions, 1381 flow. Second operand has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:49,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:49,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:49,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:56,008 INFO L124 PetriNetUnfolderBase]: 40096/87930 cut-off events. [2025-03-04 10:07:56,008 INFO L125 PetriNetUnfolderBase]: For 1026/1026 co-relation queries the response was YES. [2025-03-04 10:07:56,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143609 conditions, 87930 events. 40096/87930 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 4153. Compared 1089435 event pairs, 25272 based on Foata normal form. 9/68571 useless extension candidates. Maximal degree in co-relation 143497. Up to 27126 conditions per place. [2025-03-04 10:07:56,873 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 162 selfloop transitions, 65 changer transitions 0/281 dead transitions. [2025-03-04 10:07:56,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2202 flow [2025-03-04 10:07:56,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:07:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:07:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2025-03-04 10:07:56,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-04 10:07:56,875 INFO L175 Difference]: Start difference. First operand has 179 places, 209 transitions, 1381 flow. Second operand 8 states and 642 transitions. [2025-03-04 10:07:56,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2202 flow [2025-03-04 10:07:56,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 281 transitions, 2012 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-04 10:07:56,883 INFO L231 Difference]: Finished difference. Result has 179 places, 217 transitions, 1491 flow [2025-03-04 10:07:56,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=179, PETRI_TRANSITIONS=217} [2025-03-04 10:07:56,884 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-04 10:07:56,884 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 217 transitions, 1491 flow [2025-03-04 10:07:56,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:56,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:56,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:56,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:07:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:57,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:57,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 137130916, now seen corresponding path program 1 times [2025-03-04 10:07:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631634391] [2025-03-04 10:07:57,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:57,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:57,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:57,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:57,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:07:57,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631634391] [2025-03-04 10:07:57,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631634391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:57,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:57,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:57,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510319746] [2025-03-04 10:07:57,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:57,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:57,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:57,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:57,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:57,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 217 transitions, 1491 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:57,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:57,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:57,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:04,193 INFO L124 PetriNetUnfolderBase]: 40690/89784 cut-off events. [2025-03-04 10:08:04,193 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2025-03-04 10:08:04,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146214 conditions, 89784 events. 40690/89784 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 4175. Compared 1119479 event pairs, 25452 based on Foata normal form. 18/69174 useless extension candidates. Maximal degree in co-relation 146113. Up to 54369 conditions per place. [2025-03-04 10:08:05,117 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 149 selfloop transitions, 13 changer transitions 0/216 dead transitions. [2025-03-04 10:08:05,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 216 transitions, 1805 flow [2025-03-04 10:08:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:05,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:08:05,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:08:05,118 INFO L175 Difference]: Start difference. First operand has 179 places, 217 transitions, 1491 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:08:05,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 216 transitions, 1805 flow [2025-03-04 10:08:05,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 216 transitions, 1728 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:05,126 INFO L231 Difference]: Finished difference. Result has 180 places, 215 transitions, 1426 flow [2025-03-04 10:08:05,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1426, PETRI_PLACES=180, PETRI_TRANSITIONS=215} [2025-03-04 10:08:05,126 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 66 predicate places. [2025-03-04 10:08:05,126 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 215 transitions, 1426 flow [2025-03-04 10:08:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:05,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:05,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:05,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:08:05,127 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:08:05,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1499805378, now seen corresponding path program 1 times [2025-03-04 10:08:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822381738] [2025-03-04 10:08:05,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:05,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:05,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:05,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:05,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:05,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822381738] [2025-03-04 10:08:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822381738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159215398] [2025-03-04 10:08:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:05,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:05,793 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:05,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:08:05,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:05,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:05,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:05,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:05,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:08:05,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:05,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:08:05,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:05,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:08:05,970 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:08:05,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 10:08:06,042 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 10:08:06,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-04 10:08:06,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:08:06,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:06,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:06,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:06,190 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-04 10:08:06,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-04 10:08:06,350 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 10:08:06,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-04 10:08:06,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:06,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:06,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:06,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:06,501 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-04 10:08:06,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-04 10:08:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:06,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:07,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4738 treesize of output 4704 [2025-03-04 10:08:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:07,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159215398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:07,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:07,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 10:08:07,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778125826] [2025-03-04 10:08:07,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:08:07,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:07,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:08:07,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:08:10,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 120 [2025-03-04 10:08:10,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 215 transitions, 1426 flow. Second operand has 23 states, 23 states have (on average 57.73913043478261) internal successors, (1328), 23 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:10,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:10,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 120 [2025-03-04 10:08:10,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:15,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:08:24,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:08:28,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]