./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_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_61-invariant_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 b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:03:36,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:03:36,958 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:03:36,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:03:36,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:03:36,986 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:03:36,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:03:36,987 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:03:36,987 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:03:36,987 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:03:36,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:03:36,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:03:36,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:03:36,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:03:36,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:03:36,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:03:36,990 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:36,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:03:36,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:03:36,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:03:36,991 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:03:36,991 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 -> b4399e58ed3ca9c75e2a61372e91a4308548a0e79a3eb4428d85990bd71242f7 [2025-03-04 10:03:37,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:03:37,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:03:37,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:03:37,227 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:03:37,228 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:03:37,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-03-04 10:03:38,420 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566f746ed/47a5895d46174d3dbe9920a516b50896/FLAG6745d1672 [2025-03-04 10:03:38,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:03:38,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_61-invariant_racing.i [2025-03-04 10:03:38,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566f746ed/47a5895d46174d3dbe9920a516b50896/FLAG6745d1672 [2025-03-04 10:03:38,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566f746ed/47a5895d46174d3dbe9920a516b50896 [2025-03-04 10:03:38,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:03:38,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:03:38,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:38,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:03:38,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:03:38,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:38" (1/1) ... [2025-03-04 10:03:38,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bda81df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:38, skipping insertion in model container [2025-03-04 10:03:38,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:03:38" (1/1) ... [2025-03-04 10:03:39,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:03:39,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:39,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:03:39,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:03:39,369 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:03:39,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39 WrapperNode [2025-03-04 10:03:39,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:03:39,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:39,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:03:39,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:03:39,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,395 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2025-03-04 10:03:39,396 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:03:39,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:03:39,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:03:39,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:03:39,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,414 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 5, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 1]. [2025-03-04 10:03:39,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,422 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:03:39,422 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:03:39,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:03:39,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:03:39,423 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (1/1) ... [2025-03-04 10:03:39,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:03:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:03:39,446 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:03:39,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:03:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:03:39,467 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:03:39,467 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:03:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:03:39,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:03:39,469 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:03:39,568 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:03:39,569 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:03:39,699 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 10:03:39,699 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L713-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 10:03:39,738 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:03:39,739 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:03:39,838 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:03:39,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:03:39,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:39 BoogieIcfgContainer [2025-03-04 10:03:39,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:03:39,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:03:39,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:03:39,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:03:39,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:03:38" (1/3) ... [2025-03-04 10:03:39,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cb2018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:39, skipping insertion in model container [2025-03-04 10:03:39,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:03:39" (2/3) ... [2025-03-04 10:03:39,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cb2018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:03:39, skipping insertion in model container [2025-03-04 10:03:39,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:03:39" (3/3) ... [2025-03-04 10:03:39,850 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_61-invariant_racing.i [2025-03-04 10:03:39,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:03:39,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_61-invariant_racing.i that has 2 procedures, 69 locations, 1 initial locations, 7 loop locations, and 6 error locations. [2025-03-04 10:03:39,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:03:39,901 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:03:39,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 87 transitions, 181 flow [2025-03-04 10:03:39,972 INFO L124 PetriNetUnfolderBase]: 28/135 cut-off events. [2025-03-04 10:03:39,974 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:03:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 135 events. 28/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 509 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2025-03-04 10:03:39,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 87 transitions, 181 flow [2025-03-04 10:03:39,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 87 transitions, 181 flow [2025-03-04 10:03:39,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:39,997 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;@382232a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:39,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:03:40,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:40,003 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 10:03:40,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:40,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:40,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:03:40,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:40,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:40,012 INFO L85 PathProgramCache]: Analyzing trace with hash 370522, now seen corresponding path program 1 times [2025-03-04 10:03:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:40,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136482357] [2025-03-04 10:03:40,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:40,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:03:40,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:03:40,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:40,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:40,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136482357] [2025-03-04 10:03:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136482357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:40,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:03:40,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809783861] [2025-03-04 10:03:40,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:40,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:40,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:40,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 87 [2025-03-04 10:03:40,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:40,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:40,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 87 [2025-03-04 10:03:40,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:40,492 INFO L124 PetriNetUnfolderBase]: 296/903 cut-off events. [2025-03-04 10:03:40,492 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:03:40,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1534 conditions, 903 events. 296/903 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5542 event pairs, 247 based on Foata normal form. 152/1020 useless extension candidates. Maximal degree in co-relation 1456. Up to 567 conditions per place. [2025-03-04 10:03:40,498 INFO L140 encePairwiseOnDemand]: 67/87 looper letters, 48 selfloop transitions, 2 changer transitions 1/81 dead transitions. [2025-03-04 10:03:40,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 271 flow [2025-03-04 10:03:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-03-04 10:03:40,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2025-03-04 10:03:40,508 INFO L175 Difference]: Start difference. First operand has 72 places, 87 transitions, 181 flow. Second operand 3 states and 165 transitions. [2025-03-04 10:03:40,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 271 flow [2025-03-04 10:03:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:40,516 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 145 flow [2025-03-04 10:03:40,518 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-04 10:03:40,521 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-03-04 10:03:40,521 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 145 flow [2025-03-04 10:03:40,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:40,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:40,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:03:40,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:03:40,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash 370523, now seen corresponding path program 1 times [2025-03-04 10:03:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741651279] [2025-03-04 10:03:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:40,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:03:40,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:03:40,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:40,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:40,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:40,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741651279] [2025-03-04 10:03:40,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741651279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:40,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:40,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:03:40,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735372377] [2025-03-04 10:03:40,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:40,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:40,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:40,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:40,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:40,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 87 [2025-03-04 10:03:40,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:40,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:40,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 87 [2025-03-04 10:03:40,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:40,818 INFO L124 PetriNetUnfolderBase]: 267/849 cut-off events. [2025-03-04 10:03:40,818 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:03:40,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 849 events. 267/849 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4966 event pairs, 216 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 1390. Up to 531 conditions per place. [2025-03-04 10:03:40,825 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 48 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-03-04 10:03:40,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 273 flow [2025-03-04 10:03:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-03-04 10:03:40,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578544061302682 [2025-03-04 10:03:40,827 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 145 flow. Second operand 3 states and 151 transitions. [2025-03-04 10:03:40,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 273 flow [2025-03-04 10:03:40,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:40,831 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 151 flow [2025-03-04 10:03:40,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-03-04 10:03:40,832 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-03-04 10:03:40,833 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 151 flow [2025-03-04 10:03:40,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:40,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:40,833 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:03:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:03:40,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:40,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:40,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1401174238, now seen corresponding path program 1 times [2025-03-04 10:03:40,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:40,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898127135] [2025-03-04 10:03:40,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:40,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:03:40,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:03:40,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:40,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898127135] [2025-03-04 10:03:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898127135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:40,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:40,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:03:40,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869916693] [2025-03-04 10:03:40,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:40,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:03:40,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:40,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:03:40,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:03:41,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 87 [2025-03-04 10:03:41,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:41,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:41,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 87 [2025-03-04 10:03:41,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:41,074 INFO L124 PetriNetUnfolderBase]: 43/153 cut-off events. [2025-03-04 10:03:41,074 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:03:41,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 153 events. 43/153 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 463 event pairs, 26 based on Foata normal form. 28/171 useless extension candidates. Maximal degree in co-relation 263. Up to 82 conditions per place. [2025-03-04 10:03:41,076 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 31 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-03-04 10:03:41,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 172 flow [2025-03-04 10:03:41,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:03:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:03:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-03-04 10:03:41,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46839080459770116 [2025-03-04 10:03:41,082 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 151 flow. Second operand 4 states and 163 transitions. [2025-03-04 10:03:41,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 172 flow [2025-03-04 10:03:41,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:03:41,083 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 74 flow [2025-03-04 10:03:41,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2025-03-04 10:03:41,084 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -34 predicate places. [2025-03-04 10:03:41,084 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 74 flow [2025-03-04 10:03:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 5 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:41,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:41,084 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 10:03:41,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:03:41,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:41,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash -486728080, now seen corresponding path program 1 times [2025-03-04 10:03:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:41,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262838636] [2025-03-04 10:03:41,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:41,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:41,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:41,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:41,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:41,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:03:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:03:41,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:03:41,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:41,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:41,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:03:41,130 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:03:41,130 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 10:03:41,131 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-04 10:03:41,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-04 10:03:41,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-04 10:03:41,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-04 10:03:41,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:03:41,132 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:03:41,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:03:41,132 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 10:03:41,135 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:03:41,135 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 10:03:41,158 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:03:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 122 transitions, 260 flow [2025-03-04 10:03:41,195 INFO L124 PetriNetUnfolderBase]: 47/230 cut-off events. [2025-03-04 10:03:41,195 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-04 10:03:41,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 230 events. 47/230 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1047 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 139. Up to 9 conditions per place. [2025-03-04 10:03:41,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 122 transitions, 260 flow [2025-03-04 10:03:41,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 122 transitions, 260 flow [2025-03-04 10:03:41,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:41,199 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;@382232a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:41,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:03:41,200 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:41,200 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 10:03:41,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:41,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:41,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:03:41,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:41,201 INFO L85 PathProgramCache]: Analyzing trace with hash 491668, now seen corresponding path program 1 times [2025-03-04 10:03:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016530171] [2025-03-04 10:03:41,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:41,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:41,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:03:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:03:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:41,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:41,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016530171] [2025-03-04 10:03:41,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016530171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:41,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:41,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:03:41,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859867361] [2025-03-04 10:03:41,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:41,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:41,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:41,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:41,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:41,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 122 [2025-03-04 10:03:41,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 122 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:41,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:41,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 122 [2025-03-04 10:03:41,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:42,526 INFO L124 PetriNetUnfolderBase]: 8837/17843 cut-off events. [2025-03-04 10:03:42,527 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2025-03-04 10:03:42,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31474 conditions, 17843 events. 8837/17843 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 161009 event pairs, 7397 based on Foata normal form. 3082/20322 useless extension candidates. Maximal degree in co-relation 12834. Up to 12263 conditions per place. [2025-03-04 10:03:42,602 INFO L140 encePairwiseOnDemand]: 96/122 looper letters, 76 selfloop transitions, 2 changer transitions 1/123 dead transitions. [2025-03-04 10:03:42,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 123 transitions, 420 flow [2025-03-04 10:03:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 247 transitions. [2025-03-04 10:03:42,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674863387978142 [2025-03-04 10:03:42,605 INFO L175 Difference]: Start difference. First operand has 101 places, 122 transitions, 260 flow. Second operand 3 states and 247 transitions. [2025-03-04 10:03:42,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 123 transitions, 420 flow [2025-03-04 10:03:42,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 123 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:03:42,612 INFO L231 Difference]: Finished difference. Result has 100 places, 96 transitions, 212 flow [2025-03-04 10:03:42,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=100, PETRI_TRANSITIONS=96} [2025-03-04 10:03:42,612 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -1 predicate places. [2025-03-04 10:03:42,612 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 96 transitions, 212 flow [2025-03-04 10:03:42,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:42,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:42,612 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:03:42,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:03:42,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash 491669, now seen corresponding path program 1 times [2025-03-04 10:03:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566076429] [2025-03-04 10:03:42,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:42,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:03:42,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:03:42,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:42,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:42,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566076429] [2025-03-04 10:03:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566076429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:42,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:42,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:03:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900043643] [2025-03-04 10:03:42,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:42,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:42,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:42,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:42,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:42,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2025-03-04 10:03:42,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 96 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:42,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:42,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2025-03-04 10:03:42,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:43,756 INFO L124 PetriNetUnfolderBase]: 7996/16771 cut-off events. [2025-03-04 10:03:43,756 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-04 10:03:43,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29319 conditions, 16771 events. 7996/16771 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 155003 event pairs, 7384 based on Foata normal form. 1/15956 useless extension candidates. Maximal degree in co-relation 27659. Up to 12228 conditions per place. [2025-03-04 10:03:43,828 INFO L140 encePairwiseOnDemand]: 118/122 looper letters, 64 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 10:03:43,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 111 transitions, 374 flow [2025-03-04 10:03:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:03:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:03:43,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-04 10:03:43,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5710382513661202 [2025-03-04 10:03:43,830 INFO L175 Difference]: Start difference. First operand has 100 places, 96 transitions, 212 flow. Second operand 3 states and 209 transitions. [2025-03-04 10:03:43,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 111 transitions, 374 flow [2025-03-04 10:03:43,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:43,850 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 222 flow [2025-03-04 10:03:43,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2025-03-04 10:03:43,852 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -1 predicate places. [2025-03-04 10:03:43,852 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 222 flow [2025-03-04 10:03:43,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:43,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:43,852 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:03:43,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:03:43,853 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1184710117, now seen corresponding path program 1 times [2025-03-04 10:03:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206345129] [2025-03-04 10:03:43,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:43,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:03:43,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:03:43,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:43,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206345129] [2025-03-04 10:03:43,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206345129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:43,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:43,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:03:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371300777] [2025-03-04 10:03:43,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:43,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:03:43,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:43,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:03:43,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:03:43,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2025-03-04 10:03:43,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:43,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:43,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2025-03-04 10:03:43,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:44,923 INFO L124 PetriNetUnfolderBase]: 7966/16876 cut-off events. [2025-03-04 10:03:44,923 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2025-03-04 10:03:44,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29692 conditions, 16876 events. 7966/16876 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 154581 event pairs, 6140 based on Foata normal form. 14/16292 useless extension candidates. Maximal degree in co-relation 24108. Up to 11658 conditions per place. [2025-03-04 10:03:44,993 INFO L140 encePairwiseOnDemand]: 118/122 looper letters, 90 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2025-03-04 10:03:44,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 496 flow [2025-03-04 10:03:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:03:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:03:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2025-03-04 10:03:44,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5799180327868853 [2025-03-04 10:03:44,995 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 222 flow. Second operand 4 states and 283 transitions. [2025-03-04 10:03:44,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 496 flow [2025-03-04 10:03:44,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:03:44,998 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 239 flow [2025-03-04 10:03:44,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-03-04 10:03:44,999 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2025-03-04 10:03:44,999 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 239 flow [2025-03-04 10:03:44,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:44,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:44,999 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-04 10:03:44,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:03:45,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:45,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash -392805120, now seen corresponding path program 1 times [2025-03-04 10:03:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253516605] [2025-03-04 10:03:45,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:45,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:45,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:03:45,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:03:45,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:45,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253516605] [2025-03-04 10:03:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253516605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:03:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090005192] [2025-03-04 10:03:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:03:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:45,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:03:45,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:03:45,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 122 [2025-03-04 10:03:45,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:45,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:45,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 122 [2025-03-04 10:03:45,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:03:46,158 INFO L124 PetriNetUnfolderBase]: 7319/15469 cut-off events. [2025-03-04 10:03:46,158 INFO L125 PetriNetUnfolderBase]: For 1838/1838 co-relation queries the response was YES. [2025-03-04 10:03:46,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27854 conditions, 15469 events. 7319/15469 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 141191 event pairs, 2654 based on Foata normal form. 196/15280 useless extension candidates. Maximal degree in co-relation 18827. Up to 9685 conditions per place. [2025-03-04 10:03:46,232 INFO L140 encePairwiseOnDemand]: 118/122 looper letters, 114 selfloop transitions, 5 changer transitions 0/164 dead transitions. [2025-03-04 10:03:46,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 164 transitions, 605 flow [2025-03-04 10:03:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:03:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:03:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 355 transitions. [2025-03-04 10:03:46,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5819672131147541 [2025-03-04 10:03:46,234 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 239 flow. Second operand 5 states and 355 transitions. [2025-03-04 10:03:46,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 164 transitions, 605 flow [2025-03-04 10:03:46,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 164 transitions, 596 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:03:46,238 INFO L231 Difference]: Finished difference. Result has 104 places, 97 transitions, 234 flow [2025-03-04 10:03:46,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=104, PETRI_TRANSITIONS=97} [2025-03-04 10:03:46,238 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2025-03-04 10:03:46,238 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 97 transitions, 234 flow [2025-03-04 10:03:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:46,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:46,239 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-03-04 10:03:46,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:03:46,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 707943661, now seen corresponding path program 1 times [2025-03-04 10:03:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343697440] [2025-03-04 10:03:46,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:46,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:03:46,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:03:46,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:46,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:46,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 10:03:46,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:03:46,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:03:46,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:46,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 10:03:46,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 10:03:46,261 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-04 10:03:46,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-04 10:03:46,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:03:46,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 10:03:46,262 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 10:03:46,262 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 10:03:46,288 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:03:46,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 157 transitions, 341 flow [2025-03-04 10:03:46,358 INFO L124 PetriNetUnfolderBase]: 69/346 cut-off events. [2025-03-04 10:03:46,358 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-03-04 10:03:46,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 346 events. 69/346 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1698 event pairs, 1 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 241. Up to 12 conditions per place. [2025-03-04 10:03:46,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 157 transitions, 341 flow [2025-03-04 10:03:46,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 157 transitions, 341 flow [2025-03-04 10:03:46,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:03:46,361 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;@382232a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:03:46,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-04 10:03:46,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:03:46,362 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 10:03:46,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:03:46,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:03:46,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:03:46,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:03:46,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:03:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 647569, now seen corresponding path program 1 times [2025-03-04 10:03:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:03:46,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441378752] [2025-03-04 10:03:46,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:03:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:03:46,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:03:46,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:03:46,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:03:46,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:03:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:03:46,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:03:46,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441378752] [2025-03-04 10:03:46,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441378752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:03:46,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:03:46,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:03:46,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013289501] [2025-03-04 10:03:46,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:03:46,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:03:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:03:46,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:03:46,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:03:46,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 157 [2025-03-04 10:03:46,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 157 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:03:46,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:03:46,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 157 [2025-03-04 10:03:46,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:05,075 INFO L124 PetriNetUnfolderBase]: 192014/322797 cut-off events. [2025-03-04 10:04:05,076 INFO L125 PetriNetUnfolderBase]: For 4143/4143 co-relation queries the response was YES. [2025-03-04 10:04:05,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583548 conditions, 322797 events. 192014/322797 cut-off events. For 4143/4143 co-relation queries the response was YES. Maximal size of possible extension queue 6644. Compared 3431483 event pairs, 160330 based on Foata normal form. 57131/370057 useless extension candidates. Maximal degree in co-relation 100240. Up to 233593 conditions per place. [2025-03-04 10:04:06,663 INFO L140 encePairwiseOnDemand]: 125/157 looper letters, 104 selfloop transitions, 2 changer transitions 1/165 dead transitions. [2025-03-04 10:04:06,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 165 transitions, 571 flow [2025-03-04 10:04:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2025-03-04 10:04:06,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6985138004246284 [2025-03-04 10:04:06,665 INFO L175 Difference]: Start difference. First operand has 130 places, 157 transitions, 341 flow. Second operand 3 states and 329 transitions. [2025-03-04 10:04:06,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 165 transitions, 571 flow [2025-03-04 10:04:06,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 165 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 10:04:06,669 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 281 flow [2025-03-04 10:04:06,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=157, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2025-03-04 10:04:06,670 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2025-03-04 10:04:06,670 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 281 flow [2025-03-04 10:04:06,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 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,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:06,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:04:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:04:06,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-04 10:04:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash 647570, now seen corresponding path program 1 times [2025-03-04 10:04:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402225849] [2025-03-04 10:04:06,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:04:06,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:04:06,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:06,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:06,711 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,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402225849] [2025-03-04 10:04:06,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402225849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:06,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:06,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171587733] [2025-03-04 10:04:06,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:06,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:06,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:06,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:06,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 157 [2025-03-04 10:04:06,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:06,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 157 [2025-03-04 10:04:06,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand