./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --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/goblint-regression/28-race_reach_71-funloop_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:03:37,875 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:03:37,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:03:37,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:03:37,933 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:03:37,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:03:37,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:03:37,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:03:37,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:03:37,950 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:03:37,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:03:37,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:03:37,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:03:37,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:03:37,951 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:03:37,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:37,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:03:37,952 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:03:37,952 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-03-04 10:03:38,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:03:38,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:03:38,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:03:38,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:03:38,178 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:03:38,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-04 10:03:39,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59124d97e/d243105e7f4d443c8957484ee05ae084/FLAG2101cabac [2025-03-04 10:03:39,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:03:39,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-03-04 10:03:39,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59124d97e/d243105e7f4d443c8957484ee05ae084/FLAG2101cabac [2025-03-04 10:03:39,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59124d97e/d243105e7f4d443c8957484ee05ae084 [2025-03-04 10:03:39,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:03:39,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:03:39,876 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:39,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:03:39,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:03:39,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2629a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39, skipping insertion in model container [2025-03-04 10:03:39,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:03:40,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:40,235 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:03:40,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:40,317 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:03:40,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40 WrapperNode [2025-03-04 10:03:40,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:40,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:40,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:03:40,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:03:40,323 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:03:40" (1/1) ... [2025-03-04 10:03:40,333 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:03:40" (1/1) ... [2025-03-04 10:03:40,353 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 314 [2025-03-04 10:03:40,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:40,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:03:40,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:03:40,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:03:40,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,364 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,376 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 75, 5, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 5, 0]. The 7 writes are split as follows [0, 6, 0, 1]. [2025-03-04 10:03:40,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,385 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:03:40,391 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:03:40,391 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:03:40,391 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:03:40,392 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (1/1) ... [2025-03-04 10:03:40,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:40,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:40,416 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:03:40,418 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:03:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:03:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:03:40,434 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:03:40,435 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:03:40,436 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:03:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:03:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:03:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:03:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:03:40,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:03:40,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:03:40,437 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:03:40,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:03:40,551 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:03:40,893 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 10:03:40,894 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 10:03:40,950 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:03:40,950 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:03:41,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:03:41,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:03:41,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:41 BoogieIcfgContainer [2025-03-04 10:03:41,201 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:03:41,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:03:41,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:03:41,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:03:41,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:03:39" (1/3) ... [2025-03-04 10:03:41,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758bbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:41, skipping insertion in model container [2025-03-04 10:03:41,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:40" (2/3) ... [2025-03-04 10:03:41,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7758bbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:41, skipping insertion in model container [2025-03-04 10:03:41,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:41" (3/3) ... [2025-03-04 10:03:41,209 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-03-04 10:03:41,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:03:41,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 150 locations, 1 initial locations, 17 loop locations, and 38 error locations. [2025-03-04 10:03:41,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:03:41,261 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:03:41,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 193 transitions, 393 flow [2025-03-04 10:03:41,359 INFO L124 PetriNetUnfolderBase]: 70/318 cut-off events. [2025-03-04 10:03:41,361 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:03:41,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 318 events. 70/318 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1910 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 186. Up to 8 conditions per place. [2025-03-04 10:03:41,369 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 193 transitions, 393 flow [2025-03-04 10:03:41,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 193 transitions, 393 flow [2025-03-04 10:03:41,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:41,396 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;@771a02fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:41,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:03:41,401 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:41,402 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 10:03:41,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:41,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:41,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:03:41,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:41,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:41,407 INFO L85 PathProgramCache]: Analyzing trace with hash 25391297, now seen corresponding path program 1 times [2025-03-04 10:03:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870872070] [2025-03-04 10:03:41,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:41,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:03:41,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:03:41,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:41,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:41,648 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:03:41,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:41,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870872070] [2025-03-04 10:03:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870872070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:41,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:41,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379068081] [2025-03-04 10:03:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:41,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:41,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:41,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:41,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:41,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193 [2025-03-04 10:03:41,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 193 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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:03:41,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:41,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193 [2025-03-04 10:03:41,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:42,174 INFO L124 PetriNetUnfolderBase]: 993/3363 cut-off events. [2025-03-04 10:03:42,175 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:03:42,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 3363 events. 993/3363 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 29849 event pairs, 840 based on Foata normal form. 608/3486 useless extension candidates. Maximal degree in co-relation 5082. Up to 1874 conditions per place. [2025-03-04 10:03:42,196 INFO L140 encePairwiseOnDemand]: 154/193 looper letters, 68 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2025-03-04 10:03:42,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 155 transitions, 457 flow [2025-03-04 10:03:42,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-03-04 10:03:42,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6252158894645942 [2025-03-04 10:03:42,210 INFO L175 Difference]: Start difference. First operand has 153 places, 193 transitions, 393 flow. Second operand 3 states and 362 transitions. [2025-03-04 10:03:42,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 155 transitions, 457 flow [2025-03-04 10:03:42,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 155 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:42,218 INFO L231 Difference]: Finished difference. Result has 153 places, 155 transitions, 327 flow [2025-03-04 10:03:42,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=153, PETRI_TRANSITIONS=155} [2025-03-04 10:03:42,223 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 0 predicate places. [2025-03-04 10:03:42,224 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 155 transitions, 327 flow [2025-03-04 10:03:42,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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:03:42,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:42,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:03:42,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:03:42,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:42,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash 786998212, now seen corresponding path program 1 times [2025-03-04 10:03:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638125215] [2025-03-04 10:03:42,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:42,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:42,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:42,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:42,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638125215] [2025-03-04 10:03:42,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638125215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:42,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27200483] [2025-03-04 10:03:42,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:42,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:42,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:42,378 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:03:42,387 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:03:42,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:42,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:42,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:42,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:42,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:03:42,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:42,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27200483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:42,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:03:42,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933833708] [2025-03-04 10:03:42,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:42,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:03:42,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:42,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:03:42,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:03:42,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193 [2025-03-04 10:03:42,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 155 transitions, 327 flow. Second operand has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:03:42,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:42,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193 [2025-03-04 10:03:42,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:42,932 INFO L124 PetriNetUnfolderBase]: 993/3366 cut-off events. [2025-03-04 10:03:42,933 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:03:42,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 3366 events. 993/3366 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 29876 event pairs, 840 based on Foata normal form. 0/2881 useless extension candidates. Maximal degree in co-relation 5247. Up to 1874 conditions per place. [2025-03-04 10:03:42,953 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 68 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-03-04 10:03:42,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 158 transitions, 485 flow [2025-03-04 10:03:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:03:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:03:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 586 transitions. [2025-03-04 10:03:42,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060449050086355 [2025-03-04 10:03:42,956 INFO L175 Difference]: Start difference. First operand has 153 places, 155 transitions, 327 flow. Second operand 6 states and 586 transitions. [2025-03-04 10:03:42,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 158 transitions, 485 flow [2025-03-04 10:03:42,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 158 transitions, 481 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:42,959 INFO L231 Difference]: Finished difference. Result has 160 places, 158 transitions, 359 flow [2025-03-04 10:03:42,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=359, PETRI_PLACES=160, PETRI_TRANSITIONS=158} [2025-03-04 10:03:42,960 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 7 predicate places. [2025-03-04 10:03:42,961 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 158 transitions, 359 flow [2025-03-04 10:03:42,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.28571428571429) internal successors, (604), 7 states have internal predecessors, (604), 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:03:42,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:42,961 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:03:42,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:03:43,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:43,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:43,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash -893806207, now seen corresponding path program 2 times [2025-03-04 10:03:43,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:43,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787619104] [2025-03-04 10:03:43,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:43,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:43,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 10:03:43,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 10:03:43,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:43,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:43,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:03:43,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:43,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787619104] [2025-03-04 10:03:43,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787619104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:43,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:43,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:43,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300348731] [2025-03-04 10:03:43,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:43,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:43,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:43,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:43,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:43,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 193 [2025-03-04 10:03:43,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 158 transitions, 359 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:03:43,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:43,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 193 [2025-03-04 10:03:43,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:43,608 INFO L124 PetriNetUnfolderBase]: 1046/3446 cut-off events. [2025-03-04 10:03:43,608 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:03:43,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 3446 events. 1046/3446 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 30470 event pairs, 840 based on Foata normal form. 0/2998 useless extension candidates. Maximal degree in co-relation 5416. Up to 1870 conditions per place. [2025-03-04 10:03:43,622 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 95 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-03-04 10:03:43,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 178 transitions, 593 flow [2025-03-04 10:03:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-03-04 10:03:43,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5837651122625216 [2025-03-04 10:03:43,623 INFO L175 Difference]: Start difference. First operand has 160 places, 158 transitions, 359 flow. Second operand 3 states and 338 transitions. [2025-03-04 10:03:43,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 178 transitions, 593 flow [2025-03-04 10:03:43,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 178 transitions, 579 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:43,627 INFO L231 Difference]: Finished difference. Result has 159 places, 156 transitions, 345 flow [2025-03-04 10:03:43,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=159, PETRI_TRANSITIONS=156} [2025-03-04 10:03:43,628 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 6 predicate places. [2025-03-04 10:03:43,628 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 156 transitions, 345 flow [2025-03-04 10:03:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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:03:43,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:43,629 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:03:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:03:43,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:43,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:43,629 INFO L85 PathProgramCache]: Analyzing trace with hash -893806206, now seen corresponding path program 1 times [2025-03-04 10:03:43,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:43,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488662842] [2025-03-04 10:03:43,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:43,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:43,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:43,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:43,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:43,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488662842] [2025-03-04 10:03:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488662842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:43,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050924238] [2025-03-04 10:03:43,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:43,736 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:03:43,738 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:03:43,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:43,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:43,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:43,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:03:43,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:43,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:43,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:43,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050924238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:43,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:43,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:03:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204573912] [2025-03-04 10:03:43,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:03:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:03:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:03:43,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 193 [2025-03-04 10:03:43,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 156 transitions, 345 flow. Second operand has 13 states, 13 states have (on average 86.15384615384616) internal successors, (1120), 13 states have internal predecessors, (1120), 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:03:43,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:43,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 193 [2025-03-04 10:03:43,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:44,199 INFO L124 PetriNetUnfolderBase]: 993/3348 cut-off events. [2025-03-04 10:03:44,199 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-03-04 10:03:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5299 conditions, 3348 events. 993/3348 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 29570 event pairs, 840 based on Foata normal form. 6/2894 useless extension candidates. Maximal degree in co-relation 5247. Up to 1874 conditions per place. [2025-03-04 10:03:44,213 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 68 selfloop transitions, 11 changer transitions 0/162 dead transitions. [2025-03-04 10:03:44,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 162 transitions, 539 flow [2025-03-04 10:03:44,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:03:44,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:03:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1105 transitions. [2025-03-04 10:03:44,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47711571675302245 [2025-03-04 10:03:44,219 INFO L175 Difference]: Start difference. First operand has 159 places, 156 transitions, 345 flow. Second operand 12 states and 1105 transitions. [2025-03-04 10:03:44,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 162 transitions, 539 flow [2025-03-04 10:03:44,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:44,223 INFO L231 Difference]: Finished difference. Result has 174 places, 162 transitions, 425 flow [2025-03-04 10:03:44,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=425, PETRI_PLACES=174, PETRI_TRANSITIONS=162} [2025-03-04 10:03:44,224 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 21 predicate places. [2025-03-04 10:03:44,224 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 162 transitions, 425 flow [2025-03-04 10:03:44,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 86.15384615384616) internal successors, (1120), 13 states have internal predecessors, (1120), 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:03:44,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:44,225 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-04 10:03:44,231 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:03:44,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:03:44,426 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:44,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:44,427 INFO L85 PathProgramCache]: Analyzing trace with hash 824009378, now seen corresponding path program 2 times [2025-03-04 10:03:44,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:44,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-04 10:03:44,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:44,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:44,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:03:44,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-04 10:03:44,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:03:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:44,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-04 10:03:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003794939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:44,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:44,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:44,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359973365] [2025-03-04 10:03:44,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:44,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:44,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:44,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:44,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:44,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 193 [2025-03-04 10:03:44,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 162 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:03:44,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:44,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 193 [2025-03-04 10:03:44,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:44,818 INFO L124 PetriNetUnfolderBase]: 971/3151 cut-off events. [2025-03-04 10:03:44,818 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:03:44,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5083 conditions, 3151 events. 971/3151 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 28022 event pairs, 0 based on Foata normal form. 1/2748 useless extension candidates. Maximal degree in co-relation 5007. Up to 1843 conditions per place. [2025-03-04 10:03:44,833 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 101 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-03-04 10:03:44,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 185 transitions, 677 flow [2025-03-04 10:03:44,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:44,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2025-03-04 10:03:44,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993091537132987 [2025-03-04 10:03:44,836 INFO L175 Difference]: Start difference. First operand has 174 places, 162 transitions, 425 flow. Second operand 3 states and 347 transitions. [2025-03-04 10:03:44,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 185 transitions, 677 flow [2025-03-04 10:03:44,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 185 transitions, 629 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-04 10:03:44,841 INFO L231 Difference]: Finished difference. Result has 172 places, 162 transitions, 387 flow [2025-03-04 10:03:44,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=172, PETRI_TRANSITIONS=162} [2025-03-04 10:03:44,842 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 19 predicate places. [2025-03-04 10:03:44,842 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 162 transitions, 387 flow [2025-03-04 10:03:44,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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:03:44,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:44,843 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:03:44,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:03:44,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash -905777005, now seen corresponding path program 1 times [2025-03-04 10:03:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049851585] [2025-03-04 10:03:44,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:44,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:03:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:03:44,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:44,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:03:44,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:44,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049851585] [2025-03-04 10:03:44,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049851585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:44,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:44,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:03:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433053101] [2025-03-04 10:03:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:44,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:03:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:44,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:03:44,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:03:45,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 193 [2025-03-04 10:03:45,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 162 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 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:03:45,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:45,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 193 [2025-03-04 10:03:45,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:45,299 INFO L124 PetriNetUnfolderBase]: 951/3121 cut-off events. [2025-03-04 10:03:45,299 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 10:03:45,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5053 conditions, 3121 events. 951/3121 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 27762 event pairs, 17 based on Foata normal form. 22/2755 useless extension candidates. Maximal degree in co-relation 5000. Up to 1711 conditions per place. [2025-03-04 10:03:45,315 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 121 selfloop transitions, 3 changer transitions 0/206 dead transitions. [2025-03-04 10:03:45,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 206 transitions, 721 flow [2025-03-04 10:03:45,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:03:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:03:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2025-03-04 10:03:45,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5841968911917098 [2025-03-04 10:03:45,317 INFO L175 Difference]: Start difference. First operand has 172 places, 162 transitions, 387 flow. Second operand 4 states and 451 transitions. [2025-03-04 10:03:45,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 206 transitions, 721 flow [2025-03-04 10:03:45,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 206 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:45,320 INFO L231 Difference]: Finished difference. Result has 172 places, 161 transitions, 385 flow [2025-03-04 10:03:45,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=385, PETRI_PLACES=172, PETRI_TRANSITIONS=161} [2025-03-04 10:03:45,321 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, 19 predicate places. [2025-03-04 10:03:45,321 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 161 transitions, 385 flow [2025-03-04 10:03:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 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:03:45,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:45,321 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:03:45,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:03:45,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-04 10:03:45,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:45,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1985684730, now seen corresponding path program 1 times [2025-03-04 10:03:45,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439914524] [2025-03-04 10:03:45,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:45,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:03:45,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:03:45,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:45,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:45,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:03:45,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:03:45,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:03:45,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:45,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:45,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:03:45,397 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:03:45,398 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-03-04 10:03:45,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-03-04 10:03:45,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-03-04 10:03:45,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-03-04 10:03:45,400 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-03-04 10:03:45,401 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-03-04 10:03:45,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-03-04 10:03:45,402 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-03-04 10:03:45,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-03-04 10:03:45,403 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (29 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-03-04 10:03:45,404 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-03-04 10:03:45,405 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-03-04 10:03:45,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:03:45,405 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 10:03:45,409 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:03:45,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:03:45,445 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:03:45,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 255 transitions, 526 flow [2025-03-04 10:03:45,477 INFO L124 PetriNetUnfolderBase]: 113/517 cut-off events. [2025-03-04 10:03:45,477 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:03:45,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 517 events. 113/517 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3371 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 320. Up to 12 conditions per place. [2025-03-04 10:03:45,480 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 255 transitions, 526 flow [2025-03-04 10:03:45,483 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 255 transitions, 526 flow [2025-03-04 10:03:45,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:45,484 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;@771a02fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:45,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 10:03:45,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:45,495 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-04 10:03:45,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:45,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:45,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:03:45,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:03:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 33241217, now seen corresponding path program 1 times [2025-03-04 10:03:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:45,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115691277] [2025-03-04 10:03:45,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:45,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:03:45,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:03:45,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:45,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:45,521 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:03:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115691277] [2025-03-04 10:03:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115691277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769040152] [2025-03-04 10:03:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:45,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:45,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2025-03-04 10:03:45,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 255 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:03:45,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:45,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2025-03-04 10:03:45,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:50,622 INFO L124 PetriNetUnfolderBase]: 43639/96917 cut-off events. [2025-03-04 10:03:50,622 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-04 10:03:50,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160090 conditions, 96917 events. 43639/96917 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1171366 event pairs, 38368 based on Foata normal form. 20304/104495 useless extension candidates. Maximal degree in co-relation 154529. Up to 63030 conditions per place. [2025-03-04 10:03:51,121 INFO L140 encePairwiseOnDemand]: 204/255 looper letters, 92 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2025-03-04 10:03:51,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 204 transitions, 612 flow [2025-03-04 10:03:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:51,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-03-04 10:03:51,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6183006535947713 [2025-03-04 10:03:51,123 INFO L175 Difference]: Start difference. First operand has 202 places, 255 transitions, 526 flow. Second operand 3 states and 473 transitions. [2025-03-04 10:03:51,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 204 transitions, 612 flow [2025-03-04 10:03:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 204 transitions, 612 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:51,126 INFO L231 Difference]: Finished difference. Result has 201 places, 204 transitions, 434 flow [2025-03-04 10:03:51,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=201, PETRI_TRANSITIONS=204} [2025-03-04 10:03:51,127 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, -1 predicate places. [2025-03-04 10:03:51,127 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 204 transitions, 434 flow [2025-03-04 10:03:51,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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:03:51,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:51,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:03:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:03:51,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:03:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1030345987, now seen corresponding path program 1 times [2025-03-04 10:03:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811101273] [2025-03-04 10:03:51,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:51,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:51,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:51,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:51,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811101273] [2025-03-04 10:03:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811101273] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:03:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596284317] [2025-03-04 10:03:51,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:51,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:51,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:51,165 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:03:51,168 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:03:51,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:03:51,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:03:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:51,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:03:51,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:03:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:51,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:03:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596284317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:03:51,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:03:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:03:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039057828] [2025-03-04 10:03:51,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:03:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:03:51,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:51,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:03:51,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:03:51,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2025-03-04 10:03:51,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 204 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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:03:51,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:51,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2025-03-04 10:03:51,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:56,157 INFO L124 PetriNetUnfolderBase]: 43639/96920 cut-off events. [2025-03-04 10:03:56,157 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2025-03-04 10:03:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160106 conditions, 96920 events. 43639/96920 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 2883. Compared 1171382 event pairs, 38368 based on Foata normal form. 0/84194 useless extension candidates. Maximal degree in co-relation 160093. Up to 63030 conditions per place. [2025-03-04 10:03:56,752 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 92 selfloop transitions, 5 changer transitions 0/207 dead transitions. [2025-03-04 10:03:56,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 640 flow [2025-03-04 10:03:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:03:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:03:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2025-03-04 10:03:56,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49673202614379086 [2025-03-04 10:03:56,754 INFO L175 Difference]: Start difference. First operand has 201 places, 204 transitions, 434 flow. Second operand 6 states and 760 transitions. [2025-03-04 10:03:56,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 207 transitions, 640 flow [2025-03-04 10:03:56,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 207 transitions, 636 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:56,758 INFO L231 Difference]: Finished difference. Result has 208 places, 207 transitions, 466 flow [2025-03-04 10:03:56,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=466, PETRI_PLACES=208, PETRI_TRANSITIONS=207} [2025-03-04 10:03:56,758 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 6 predicate places. [2025-03-04 10:03:56,758 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 207 transitions, 466 flow [2025-03-04 10:03:56,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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:03:56,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:56,759 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:03:56,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:03:56,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:03:56,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:03:56,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1224783615, now seen corresponding path program 2 times [2025-03-04 10:03:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481316374] [2025-03-04 10:03:56,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:03:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:56,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-04 10:03:56,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-04 10:03:56,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:03:56,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:56,999 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:03:57,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481316374] [2025-03-04 10:03:57,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481316374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:57,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:57,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:57,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267962629] [2025-03-04 10:03:57,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:57,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:57,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:57,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:57,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:57,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 255 [2025-03-04 10:03:57,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 207 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:57,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:57,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 255 [2025-03-04 10:03:57,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:02,513 INFO L124 PetriNetUnfolderBase]: 46055/100497 cut-off events. [2025-03-04 10:04:02,514 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-04 10:04:02,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167111 conditions, 100497 events. 46055/100497 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 3029. Compared 1206692 event pairs, 38347 based on Foata normal form. 0/87900 useless extension candidates. Maximal degree in co-relation 167076. Up to 62944 conditions per place. [2025-03-04 10:04:03,221 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 141 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2025-03-04 10:04:03,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 249 transitions, 836 flow [2025-03-04 10:04:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2025-03-04 10:04:03,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:04:03,223 INFO L175 Difference]: Start difference. First operand has 208 places, 207 transitions, 466 flow. Second operand 3 states and 459 transitions. [2025-03-04 10:04:03,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 249 transitions, 836 flow [2025-03-04 10:04:03,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 249 transitions, 822 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:03,226 INFO L231 Difference]: Finished difference. Result has 207 places, 205 transitions, 452 flow [2025-03-04 10:04:03,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=207, PETRI_TRANSITIONS=205} [2025-03-04 10:04:03,227 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 5 predicate places. [2025-03-04 10:04:03,227 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 205 transitions, 452 flow [2025-03-04 10:04:03,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:04:03,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:03,229 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-04 10:04:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:04:03,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:04:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:03,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1224783614, now seen corresponding path program 1 times [2025-03-04 10:04:03,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:03,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135347447] [2025-03-04 10:04:03,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:03,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:03,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:03,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:03,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:03,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135347447] [2025-03-04 10:04:03,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135347447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:04:03,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395495866] [2025-03-04 10:04:03,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:03,298 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:04:03,300 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:04:03,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:03,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:04:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:04:03,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:03,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:04:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:03,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395495866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:04:03,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:04:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:04:03,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972317065] [2025-03-04 10:04:03,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:04:03,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:04:03,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:03,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:04:03,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:04:03,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 255 [2025-03-04 10:04:03,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 205 transitions, 452 flow. Second operand has 13 states, 13 states have (on average 111.15384615384616) internal successors, (1445), 13 states have internal predecessors, (1445), 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:04:03,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:03,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 255 [2025-03-04 10:04:03,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:09,250 INFO L124 PetriNetUnfolderBase]: 43639/96619 cut-off events. [2025-03-04 10:04:09,250 INFO L125 PetriNetUnfolderBase]: For 1251/1251 co-relation queries the response was YES. [2025-03-04 10:04:09,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160777 conditions, 96619 events. 43639/96619 cut-off events. For 1251/1251 co-relation queries the response was YES. Maximal size of possible extension queue 2875. Compared 1164585 event pairs, 38368 based on Foata normal form. 6/84207 useless extension candidates. Maximal degree in co-relation 160724. Up to 63030 conditions per place. [2025-03-04 10:04:09,896 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 92 selfloop transitions, 11 changer transitions 0/211 dead transitions. [2025-03-04 10:04:09,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 694 flow [2025-03-04 10:04:09,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:04:09,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:04:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1429 transitions. [2025-03-04 10:04:09,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4669934640522876 [2025-03-04 10:04:09,900 INFO L175 Difference]: Start difference. First operand has 207 places, 205 transitions, 452 flow. Second operand 12 states and 1429 transitions. [2025-03-04 10:04:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 694 flow [2025-03-04 10:04:09,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:09,947 INFO L231 Difference]: Finished difference. Result has 222 places, 211 transitions, 532 flow [2025-03-04 10:04:09,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=532, PETRI_PLACES=222, PETRI_TRANSITIONS=211} [2025-03-04 10:04:09,947 INFO L279 CegarLoopForPetriNet]: 202 programPoint places, 20 predicate places. [2025-03-04 10:04:09,947 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 211 transitions, 532 flow [2025-03-04 10:04:09,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 111.15384615384616) internal successors, (1445), 13 states have internal predecessors, (1445), 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:04:09,948 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:09,948 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-04 10:04:09,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:04:10,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:10,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-04 10:04:10,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:10,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1394185790, now seen corresponding path program 2 times [2025-03-04 10:04:10,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:10,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763712231] [2025-03-04 10:04:10,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:04:10,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:10,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-04 10:04:10,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-04 10:04:10,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:04:10,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-04 10:04:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:10,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763712231] [2025-03-04 10:04:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763712231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:10,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381207707] [2025-03-04 10:04:10,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:10,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:10,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 255 [2025-03-04 10:04:10,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 211 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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:04:10,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:10,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 255 [2025-03-04 10:04:10,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand