./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_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_81-list_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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:04:01,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:04:01,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:04:01,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:04:01,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:04:01,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:04:01,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:04:01,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:04:01,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:04:01,630 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:04:01,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:04:01,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:04:01,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:04:01,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:04:01,632 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:04:01,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:04:01,632 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:04:01,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:04:01,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:04:01,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:04:01,633 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:04:01,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:01,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:04:01,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:04:01,635 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-03-04 10:04:01,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:04:01,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:04:01,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:04:01,857 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:04:01,857 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:04:01,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-03-04 10:04:03,039 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f86e4ba/a3519b4c40384af6aec3753ade2a6f5d/FLAGe43145745 [2025-03-04 10:04:03,336 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:04:03,338 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-03-04 10:04:03,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f86e4ba/a3519b4c40384af6aec3753ade2a6f5d/FLAGe43145745 [2025-03-04 10:04:03,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f86e4ba/a3519b4c40384af6aec3753ade2a6f5d [2025-03-04 10:04:03,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:04:03,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:04:03,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:03,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:04:03,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:04:03,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3645f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03, skipping insertion in model container [2025-03-04 10:04:03,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:04:03,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:03,682 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:04:03,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:03,756 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:04:03,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03 WrapperNode [2025-03-04 10:04:03,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:03,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:03,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:04:03,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:04:03,762 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:04:03" (1/1) ... [2025-03-04 10:04:03,775 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:04:03" (1/1) ... [2025-03-04 10:04:03,804 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2025-03-04 10:04:03,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:03,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:04:03,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:04:03,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:04:03,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,839 INFO L175 MemorySlicer]: Split 30 memory accesses to 6 slices as follows [2, 5, 5, 14, 2, 2]. 47 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 8, 1, 1]. [2025-03-04 10:04:03,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,849 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,860 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:04:03,860 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:04:03,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:04:03,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:04:03,861 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (1/1) ... [2025-03-04 10:04:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:03,891 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:04:03,894 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:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-03-04 10:04:03,911 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-03-04 10:04:03,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 10:04:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-04 10:04:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 10:04:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:04:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:04:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:04:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:04:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:04:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 10:04:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:04:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:04:03,917 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:04:04,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:04:04,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:04:04,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset; [2025-03-04 10:04:04,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043-1: SUMMARY for call ULTIMATE.dealloc(main_~#t2_ids~0#1.base, main_~#t2_ids~0#1.offset); srcloc: null [2025-03-04 10:04:04,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042: havoc main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset; [2025-03-04 10:04:04,392 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1042-1: SUMMARY for call ULTIMATE.dealloc(main_~#t1_ids~0#1.base, main_~#t1_ids~0#1.offset); srcloc: null [2025-03-04 10:04:04,393 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:04:04,393 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:04:04,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:04:04,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:04:04,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:04 BoogieIcfgContainer [2025-03-04 10:04:04,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:04:04,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:04:04,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:04:04,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:04:04,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:04:03" (1/3) ... [2025-03-04 10:04:04,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d930d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:04, skipping insertion in model container [2025-03-04 10:04:04,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:03" (2/3) ... [2025-03-04 10:04:04,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d930d5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:04, skipping insertion in model container [2025-03-04 10:04:04,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:04" (3/3) ... [2025-03-04 10:04:04,590 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-03-04 10:04:04,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:04:04,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 109 locations, 1 initial locations, 9 loop locations, and 38 error locations. [2025-03-04 10:04:04,602 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:04:04,681 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 10:04:04,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 129 transitions, 278 flow [2025-03-04 10:04:04,794 INFO L124 PetriNetUnfolderBase]: 38/264 cut-off events. [2025-03-04 10:04:04,796 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:04:04,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 264 events. 38/264 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1388 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2025-03-04 10:04:04,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 129 transitions, 278 flow [2025-03-04 10:04:04,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 129 transitions, 278 flow [2025-03-04 10:04:04,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:04:04,829 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;@71876106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:04:04,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-04 10:04:04,834 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:04:04,834 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 10:04:04,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:04:04,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:04,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:04,835 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:04,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash 21257, now seen corresponding path program 1 times [2025-03-04 10:04:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992768051] [2025-03-04 10:04:04,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:04,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:04,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:04,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:04,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:04,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:05,180 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:04:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992768051] [2025-03-04 10:04:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992768051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:05,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:05,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:05,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042801650] [2025-03-04 10:04:05,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:05,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:05,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:05,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 129 [2025-03-04 10:04:05,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 129 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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:05,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:05,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 129 [2025-03-04 10:04:05,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:06,062 INFO L124 PetriNetUnfolderBase]: 2588/6139 cut-off events. [2025-03-04 10:04:06,063 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-03-04 10:04:06,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10358 conditions, 6139 events. 2588/6139 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50118 event pairs, 2402 based on Foata normal form. 406/5568 useless extension candidates. Maximal degree in co-relation 9000. Up to 4126 conditions per place. [2025-03-04 10:04:06,111 INFO L140 encePairwiseOnDemand]: 112/129 looper letters, 50 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-04 10:04:06,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 113 transitions, 350 flow [2025-03-04 10:04:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-03-04 10:04:06,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6459948320413437 [2025-03-04 10:04:06,125 INFO L175 Difference]: Start difference. First operand has 115 places, 129 transitions, 278 flow. Second operand 3 states and 250 transitions. [2025-03-04 10:04:06,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 113 transitions, 350 flow [2025-03-04 10:04:06,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 113 transitions, 350 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:04:06,136 INFO L231 Difference]: Finished difference. Result has 114 places, 113 transitions, 250 flow [2025-03-04 10:04:06,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=114, PETRI_TRANSITIONS=113} [2025-03-04 10:04:06,141 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2025-03-04 10:04:06,142 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 113 transitions, 250 flow [2025-03-04 10:04:06,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 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:06,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:06,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:06,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:04:06,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:06,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 21258, now seen corresponding path program 1 times [2025-03-04 10:04:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436347702] [2025-03-04 10:04:06,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:06,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:06,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:06,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:06,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:06,328 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:04:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436347702] [2025-03-04 10:04:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436347702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:06,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:06,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280117492] [2025-03-04 10:04:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:06,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:06,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:06,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 129 [2025-03-04 10:04:06,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 113 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:06,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:06,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 129 [2025-03-04 10:04:06,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:06,924 INFO L124 PetriNetUnfolderBase]: 2588/6137 cut-off events. [2025-03-04 10:04:06,925 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2025-03-04 10:04:06,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10358 conditions, 6137 events. 2588/6137 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 50086 event pairs, 2402 based on Foata normal form. 2/5162 useless extension candidates. Maximal degree in co-relation 10346. Up to 4126 conditions per place. [2025-03-04 10:04:06,954 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 49 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 10:04:06,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 111 transitions, 348 flow [2025-03-04 10:04:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:06,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:06,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2025-03-04 10:04:06,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6175710594315246 [2025-03-04 10:04:06,958 INFO L175 Difference]: Start difference. First operand has 114 places, 113 transitions, 250 flow. Second operand 3 states and 239 transitions. [2025-03-04 10:04:06,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 111 transitions, 348 flow [2025-03-04 10:04:06,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 111 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:06,962 INFO L231 Difference]: Finished difference. Result has 112 places, 111 transitions, 246 flow [2025-03-04 10:04:06,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=112, PETRI_TRANSITIONS=111} [2025-03-04 10:04:06,963 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-03-04 10:04:06,963 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 246 flow [2025-03-04 10:04:06,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:06,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:06,964 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:04:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:04:06,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 633836362, now seen corresponding path program 1 times [2025-03-04 10:04:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375708680] [2025-03-04 10:04:06,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:06,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:07,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:07,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:07,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:07,065 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:04:07,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375708680] [2025-03-04 10:04:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375708680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:07,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:07,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:07,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82039188] [2025-03-04 10:04:07,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:07,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:07,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:07,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:07,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 129 [2025-03-04 10:04:07,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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:07,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:07,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 129 [2025-03-04 10:04:07,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:07,679 INFO L124 PetriNetUnfolderBase]: 2956/6653 cut-off events. [2025-03-04 10:04:07,679 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-03-04 10:04:07,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11474 conditions, 6653 events. 2956/6653 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 54760 event pairs, 2046 based on Foata normal form. 0/5743 useless extension candidates. Maximal degree in co-relation 11462. Up to 3553 conditions per place. [2025-03-04 10:04:07,710 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 83 selfloop transitions, 2 changer transitions 0/141 dead transitions. [2025-03-04 10:04:07,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 141 transitions, 476 flow [2025-03-04 10:04:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2025-03-04 10:04:07,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2025-03-04 10:04:07,711 INFO L175 Difference]: Start difference. First operand has 112 places, 111 transitions, 246 flow. Second operand 3 states and 267 transitions. [2025-03-04 10:04:07,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 141 transitions, 476 flow [2025-03-04 10:04:07,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 141 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:07,715 INFO L231 Difference]: Finished difference. Result has 110 places, 109 transitions, 242 flow [2025-03-04 10:04:07,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=109} [2025-03-04 10:04:07,716 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2025-03-04 10:04:07,716 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 109 transitions, 242 flow [2025-03-04 10:04:07,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 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:07,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:07,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:04:07,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:04:07,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:07,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:07,717 INFO L85 PathProgramCache]: Analyzing trace with hash 633836363, now seen corresponding path program 1 times [2025-03-04 10:04:07,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:07,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667290469] [2025-03-04 10:04:07,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:07,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:07,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:07,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:07,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:07,849 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:04:07,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:07,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667290469] [2025-03-04 10:04:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667290469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:07,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:07,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434766925] [2025-03-04 10:04:07,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:07,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:07,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:07,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:07,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:07,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 129 [2025-03-04 10:04:07,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 109 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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:07,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:07,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 129 [2025-03-04 10:04:07,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:08,377 INFO L124 PetriNetUnfolderBase]: 2511/5857 cut-off events. [2025-03-04 10:04:08,378 INFO L125 PetriNetUnfolderBase]: For 360/367 co-relation queries the response was YES. [2025-03-04 10:04:08,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10144 conditions, 5857 events. 2511/5857 cut-off events. For 360/367 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 47191 event pairs, 2165 based on Foata normal form. 1/5012 useless extension candidates. Maximal degree in co-relation 9103. Up to 3977 conditions per place. [2025-03-04 10:04:08,413 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 52 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2025-03-04 10:04:08,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 358 flow [2025-03-04 10:04:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-03-04 10:04:08,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6356589147286822 [2025-03-04 10:04:08,416 INFO L175 Difference]: Start difference. First operand has 110 places, 109 transitions, 242 flow. Second operand 3 states and 246 transitions. [2025-03-04 10:04:08,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 358 flow [2025-03-04 10:04:08,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:08,426 INFO L231 Difference]: Finished difference. Result has 111 places, 111 transitions, 259 flow [2025-03-04 10:04:08,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=111, PETRI_TRANSITIONS=111} [2025-03-04 10:04:08,427 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -4 predicate places. [2025-03-04 10:04:08,428 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 111 transitions, 259 flow [2025-03-04 10:04:08,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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:08,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:08,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:08,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:04:08,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:08,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1943534401, now seen corresponding path program 1 times [2025-03-04 10:04:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209803645] [2025-03-04 10:04:08,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:08,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:08,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:08,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:08,586 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:04:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209803645] [2025-03-04 10:04:08,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209803645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:08,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:08,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:08,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049166917] [2025-03-04 10:04:08,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:08,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:08,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:08,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:08,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:08,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 129 [2025-03-04 10:04:08,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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:08,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:08,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 129 [2025-03-04 10:04:08,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:09,117 INFO L124 PetriNetUnfolderBase]: 3564/8456 cut-off events. [2025-03-04 10:04:09,118 INFO L125 PetriNetUnfolderBase]: For 385/391 co-relation queries the response was YES. [2025-03-04 10:04:09,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14354 conditions, 8456 events. 3564/8456 cut-off events. For 385/391 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 74069 event pairs, 2834 based on Foata normal form. 193/7200 useless extension candidates. Maximal degree in co-relation 14287. Up to 5038 conditions per place. [2025-03-04 10:04:09,164 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 92 selfloop transitions, 4 changer transitions 0/152 dead transitions. [2025-03-04 10:04:09,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 152 transitions, 546 flow [2025-03-04 10:04:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-03-04 10:04:09,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7286821705426356 [2025-03-04 10:04:09,165 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 259 flow. Second operand 3 states and 282 transitions. [2025-03-04 10:04:09,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 152 transitions, 546 flow [2025-03-04 10:04:09,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 152 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:09,168 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 282 flow [2025-03-04 10:04:09,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2025-03-04 10:04:09,170 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2025-03-04 10:04:09,170 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 282 flow [2025-03-04 10:04:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:09,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:09,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:04:09,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:09,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1943534400, now seen corresponding path program 1 times [2025-03-04 10:04:09,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:09,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754660230] [2025-03-04 10:04:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:09,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:04:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:04:09,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:09,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:09,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:09,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754660230] [2025-03-04 10:04:09,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754660230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:09,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:09,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306240605] [2025-03-04 10:04:09,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:09,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:09,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:09,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 129 [2025-03-04 10:04:09,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:09,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 129 [2025-03-04 10:04:09,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:09,768 INFO L124 PetriNetUnfolderBase]: 4129/9111 cut-off events. [2025-03-04 10:04:09,768 INFO L125 PetriNetUnfolderBase]: For 1656/1849 co-relation queries the response was YES. [2025-03-04 10:04:09,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16945 conditions, 9111 events. 4129/9111 cut-off events. For 1656/1849 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 75587 event pairs, 2714 based on Foata normal form. 383/8224 useless extension candidates. Maximal degree in co-relation 15922. Up to 4677 conditions per place. [2025-03-04 10:04:09,806 INFO L140 encePairwiseOnDemand]: 123/129 looper letters, 94 selfloop transitions, 6 changer transitions 0/155 dead transitions. [2025-03-04 10:04:09,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 155 transitions, 582 flow [2025-03-04 10:04:09,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-03-04 10:04:09,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2025-03-04 10:04:09,861 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 282 flow. Second operand 3 states and 281 transitions. [2025-03-04 10:04:09,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 155 transitions, 582 flow [2025-03-04 10:04:09,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 155 transitions, 577 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:09,864 INFO L231 Difference]: Finished difference. Result has 116 places, 117 transitions, 326 flow [2025-03-04 10:04:09,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=116, PETRI_TRANSITIONS=117} [2025-03-04 10:04:09,864 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 1 predicate places. [2025-03-04 10:04:09,864 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 117 transitions, 326 flow [2025-03-04 10:04:09,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:09,864 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:09,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:04:09,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 119932846, now seen corresponding path program 1 times [2025-03-04 10:04:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929347144] [2025-03-04 10:04:09,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:09,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:09,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:04:09,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:04:09,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:09,977 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:04:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929347144] [2025-03-04 10:04:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929347144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:09,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:04:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010242962] [2025-03-04 10:04:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:04:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:09,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:04:09,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:04:10,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 129 [2025-03-04 10:04:10,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 117 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:10,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 129 [2025-03-04 10:04:10,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:10,428 INFO L124 PetriNetUnfolderBase]: 2268/5337 cut-off events. [2025-03-04 10:04:10,428 INFO L125 PetriNetUnfolderBase]: For 3507/4729 co-relation queries the response was YES. [2025-03-04 10:04:10,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10065 conditions, 5337 events. 2268/5337 cut-off events. For 3507/4729 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 42969 event pairs, 1996 based on Foata normal form. 53/4608 useless extension candidates. Maximal degree in co-relation 9811. Up to 3606 conditions per place. [2025-03-04 10:04:10,456 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 59 selfloop transitions, 4 changer transitions 0/120 dead transitions. [2025-03-04 10:04:10,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 120 transitions, 454 flow [2025-03-04 10:04:10,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:04:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:04:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2025-03-04 10:04:10,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988372093023255 [2025-03-04 10:04:10,458 INFO L175 Difference]: Start difference. First operand has 116 places, 117 transitions, 326 flow. Second operand 4 states and 309 transitions. [2025-03-04 10:04:10,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 120 transitions, 454 flow [2025-03-04 10:04:10,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 120 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:10,462 INFO L231 Difference]: Finished difference. Result has 118 places, 116 transitions, 322 flow [2025-03-04 10:04:10,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=118, PETRI_TRANSITIONS=116} [2025-03-04 10:04:10,463 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 3 predicate places. [2025-03-04 10:04:10,463 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 116 transitions, 322 flow [2025-03-04 10:04:10,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 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,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:10,463 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:10,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:04:10,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:10,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:10,464 INFO L85 PathProgramCache]: Analyzing trace with hash -577043760, now seen corresponding path program 1 times [2025-03-04 10:04:10,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:10,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007520215] [2025-03-04 10:04:10,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:10,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:10,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:10,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:10,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:10,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:04:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007520215] [2025-03-04 10:04:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007520215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:10,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:04:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771889757] [2025-03-04 10:04:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:10,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:04:10,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:10,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:04:10,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:04:10,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 129 [2025-03-04 10:04:10,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 116 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:10,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 129 [2025-03-04 10:04:10,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:10,945 INFO L124 PetriNetUnfolderBase]: 18/92 cut-off events. [2025-03-04 10:04:10,946 INFO L125 PetriNetUnfolderBase]: For 88/89 co-relation queries the response was YES. [2025-03-04 10:04:10,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 92 events. 18/92 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 319 event pairs, 12 based on Foata normal form. 12/83 useless extension candidates. Maximal degree in co-relation 183. Up to 39 conditions per place. [2025-03-04 10:04:10,946 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 18 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-04 10:04:10,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 150 flow [2025-03-04 10:04:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:04:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:04:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2025-03-04 10:04:10,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 10:04:10,949 INFO L175 Difference]: Start difference. First operand has 118 places, 116 transitions, 322 flow. Second operand 4 states and 258 transitions. [2025-03-04 10:04:10,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 150 flow [2025-03-04 10:04:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 122 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 10:04:10,952 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 72 flow [2025-03-04 10:04:10,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-03-04 10:04:10,952 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -81 predicate places. [2025-03-04 10:04:10,952 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 72 flow [2025-03-04 10:04:10,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:10,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:10,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:04:10,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-03-04 10:04:10,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -577048390, now seen corresponding path program 1 times [2025-03-04 10:04:10,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:10,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624353630] [2025-03-04 10:04:10,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:10,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:10,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:10,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:04:10,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:04:10,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:04:11,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:04:11,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:11,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:04:11,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:04:11,037 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:04:11,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-03-04 10:04:11,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-03-04 10:04:11,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-03-04 10:04:11,040 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-03-04 10:04:11,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-03-04 10:04:11,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-03-04 10:04:11,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-03-04 10:04:11,041 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-03-04 10:04:11,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:04:11,041 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:04:11,043 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:04:11,043 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:04:11,101 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-04 10:04:11,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 223 transitions, 490 flow [2025-03-04 10:04:11,176 INFO L124 PetriNetUnfolderBase]: 147/821 cut-off events. [2025-03-04 10:04:11,177 INFO L125 PetriNetUnfolderBase]: For 72/84 co-relation queries the response was YES. [2025-03-04 10:04:11,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 821 events. 147/821 cut-off events. For 72/84 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5923 event pairs, 2 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 521. Up to 32 conditions per place. [2025-03-04 10:04:11,183 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 223 transitions, 490 flow [2025-03-04 10:04:11,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 223 transitions, 490 flow [2025-03-04 10:04:11,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:04:11,193 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;@71876106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:04:11,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-03-04 10:04:11,195 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:04:11,195 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-03-04 10:04:11,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:04:11,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:11,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-03-04 10:04:11,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-03-04 10:04:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash 28329, now seen corresponding path program 1 times [2025-03-04 10:04:11,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106012927] [2025-03-04 10:04:11,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:11,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:11,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 10:04:11,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 10:04:11,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:11,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:11,242 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:04:11,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:11,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106012927] [2025-03-04 10:04:11,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106012927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:11,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:11,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:11,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320703579] [2025-03-04 10:04:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:11,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:11,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:11,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:11,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 223 [2025-03-04 10:04:11,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 223 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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:11,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:11,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 223 [2025-03-04 10:04:11,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand