./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed 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_01-simple_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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:15:20,112 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:15:20,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:15:20,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:15:20,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:15:20,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:15:20,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:15:20,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:15:20,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:15:20,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:15:20,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:15:20,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:15:20,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:15:20,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:15:20,193 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:15:20,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:15:20,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:15:20,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:15:20,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:15:20,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:15:20,195 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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-03-09 01:15:20,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:15:20,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:15:20,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:15:20,404 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:15:20,404 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:15:20,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-09 01:15:21,532 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b030198c/84ce50a681c248ea9e822c9c0a04ce3e/FLAG960b9e261 [2025-03-09 01:15:21,817 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:15:21,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-09 01:15:21,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b030198c/84ce50a681c248ea9e822c9c0a04ce3e/FLAG960b9e261 [2025-03-09 01:15:22,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b030198c/84ce50a681c248ea9e822c9c0a04ce3e [2025-03-09 01:15:22,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:15:22,101 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:15:22,102 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:15:22,102 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:15:22,106 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:15:22,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79e9fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22, skipping insertion in model container [2025-03-09 01:15:22,107 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:15:22,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:15:22,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:15:22,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:15:22,424 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:15:22,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22 WrapperNode [2025-03-09 01:15:22,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:15:22,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:15:22,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:15:22,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:15:22,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,460 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2025-03-09 01:15:22,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:15:22,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:15:22,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:15:22,462 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:15:22,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,488 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-03-09 01:15:22,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,492 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:15:22,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:15:22,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:15:22,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:15:22,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (1/1) ... [2025-03-09 01:15:22,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:15:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:15:22,529 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-09 01:15:22,533 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-09 01:15:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:15:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:15:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:15:22,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:15:22,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 01:15:22,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:15:22,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:15:22,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:15:22,556 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:15:22,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:15:22,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:15:22,558 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:15:22,684 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:15:22,686 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:15:22,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 01:15:22,844 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 01:15:22,887 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:15:22,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:15:23,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:15:23,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:15:23,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:15:23 BoogieIcfgContainer [2025-03-09 01:15:23,001 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:15:23,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:15:23,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:15:23,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:15:23,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:15:22" (1/3) ... [2025-03-09 01:15:23,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da5ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:15:23, skipping insertion in model container [2025-03-09 01:15:23,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:15:22" (2/3) ... [2025-03-09 01:15:23,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42da5ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:15:23, skipping insertion in model container [2025-03-09 01:15:23,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:15:23" (3/3) ... [2025-03-09 01:15:23,018 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-03-09 01:15:23,030 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:15:23,031 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 48 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-03-09 01:15:23,031 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:15:23,072 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:15:23,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 59 transitions, 125 flow [2025-03-09 01:15:23,135 INFO L124 PetriNetUnfolderBase]: 15/90 cut-off events. [2025-03-09 01:15:23,137 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:15:23,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 15/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 337 event pairs, 0 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 54. Up to 4 conditions per place. [2025-03-09 01:15:23,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 59 transitions, 125 flow [2025-03-09 01:15:23,146 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 59 transitions, 125 flow [2025-03-09 01:15:23,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:23,168 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;@5b34ad59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:23,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:15:23,172 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:23,173 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:23,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:23,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:23,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:23,174 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-09 01:15:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash 284059, now seen corresponding path program 1 times [2025-03-09 01:15:23,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580680081] [2025-03-09 01:15:23,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:23,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:23,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:23,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:23,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:23,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:23,420 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-09 01:15:23,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:23,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580680081] [2025-03-09 01:15:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580680081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792507556] [2025-03-09 01:15:23,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:23,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:23,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2025-03-09 01:15:23,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-09 01:15:23,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:23,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2025-03-09 01:15:23,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:23,606 INFO L124 PetriNetUnfolderBase]: 136/438 cut-off events. [2025-03-09 01:15:23,606 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:15:23,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 438 events. 136/438 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2200 event pairs, 117 based on Foata normal form. 79/501 useless extension candidates. Maximal degree in co-relation 701. Up to 272 conditions per place. [2025-03-09 01:15:23,616 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 34 selfloop transitions, 2 changer transitions 1/55 dead transitions. [2025-03-09 01:15:23,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 191 flow [2025-03-09 01:15:23,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:15:23,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615819209039548 [2025-03-09 01:15:23,627 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 125 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:15:23,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 191 flow [2025-03-09 01:15:23,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:23,635 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 101 flow [2025-03-09 01:15:23,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-03-09 01:15:23,640 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-03-09 01:15:23,640 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 101 flow [2025-03-09 01:15:23,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-09 01:15:23,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:23,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:23,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:15:23,641 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-09 01:15:23,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:23,642 INFO L85 PathProgramCache]: Analyzing trace with hash 284060, now seen corresponding path program 1 times [2025-03-09 01:15:23,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:23,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891195747] [2025-03-09 01:15:23,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:23,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:23,747 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-09 01:15:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891195747] [2025-03-09 01:15:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891195747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:23,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121802220] [2025-03-09 01:15:23,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:23,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:23,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:23,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:23,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:23,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-09 01:15:23,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 01:15:23,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:23,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-09 01:15:23,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:23,885 INFO L124 PetriNetUnfolderBase]: 117/393 cut-off events. [2025-03-09 01:15:23,885 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-09 01:15:23,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 393 events. 117/393 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1900 event pairs, 96 based on Foata normal form. 1/368 useless extension candidates. Maximal degree in co-relation 646. Up to 251 conditions per place. [2025-03-09 01:15:23,887 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 34 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-09 01:15:23,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 193 flow [2025-03-09 01:15:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2025-03-09 01:15:23,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5706214689265536 [2025-03-09 01:15:23,891 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 101 flow. Second operand 3 states and 101 transitions. [2025-03-09 01:15:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 193 flow [2025-03-09 01:15:23,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:23,894 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2025-03-09 01:15:23,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-03-09 01:15:23,895 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2025-03-09 01:15:23,895 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2025-03-09 01:15:23,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 01:15:23,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:23,896 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:15:23,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:15:23,896 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-09 01:15:23,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:23,898 INFO L85 PathProgramCache]: Analyzing trace with hash 349862725, now seen corresponding path program 1 times [2025-03-09 01:15:23,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:23,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194916283] [2025-03-09 01:15:23,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:23,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:23,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:15:23,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:15:23,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:23,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:24,075 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-09 01:15:24,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:24,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194916283] [2025-03-09 01:15:24,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194916283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:24,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173229949] [2025-03-09 01:15:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:24,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:15:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:24,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:15:24,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:15:24,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2025-03-09 01:15:24,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-09 01:15:24,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:24,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2025-03-09 01:15:24,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:24,168 INFO L124 PetriNetUnfolderBase]: 27/94 cut-off events. [2025-03-09 01:15:24,168 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:15:24,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 94 events. 27/94 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 209 event pairs, 16 based on Foata normal form. 20/114 useless extension candidates. Maximal degree in co-relation 174. Up to 57 conditions per place. [2025-03-09 01:15:24,170 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 23 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-03-09 01:15:24,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 126 flow [2025-03-09 01:15:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-03-09 01:15:24,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4533898305084746 [2025-03-09 01:15:24,172 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 4 states and 107 transitions. [2025-03-09 01:15:24,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 126 flow [2025-03-09 01:15:24,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 120 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:15:24,173 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 52 flow [2025-03-09 01:15:24,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-03-09 01:15:24,174 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -23 predicate places. [2025-03-09 01:15:24,174 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 52 flow [2025-03-09 01:15:24,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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-09 01:15:24,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:24,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 01:15:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:15:24,176 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-09 01:15:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2039157170, now seen corresponding path program 1 times [2025-03-09 01:15:24,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:24,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270066761] [2025-03-09 01:15:24,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:24,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:15:24,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:15:24,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:24,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:24,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:15:24,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:15:24,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:15:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:24,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:15:24,227 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:15:24,228 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 01:15:24,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-09 01:15:24,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-09 01:15:24,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-09 01:15:24,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-09 01:15:24,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 01:15:24,231 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 01:15:24,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:15:24,231 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 01:15:24,234 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:15:24,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:15:24,250 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:15:24,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 83 transitions, 182 flow [2025-03-09 01:15:24,262 INFO L124 PetriNetUnfolderBase]: 27/157 cut-off events. [2025-03-09 01:15:24,262 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:15:24,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 157 events. 27/157 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 664 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 94. Up to 6 conditions per place. [2025-03-09 01:15:24,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 83 transitions, 182 flow [2025-03-09 01:15:24,264 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 83 transitions, 182 flow [2025-03-09 01:15:24,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:24,267 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;@5b34ad59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:24,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:15:24,268 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:24,268 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:24,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:24,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:24,269 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:24,269 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-09 01:15:24,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:24,269 INFO L85 PathProgramCache]: Analyzing trace with hash 366478, now seen corresponding path program 1 times [2025-03-09 01:15:24,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850248985] [2025-03-09 01:15:24,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:24,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:24,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:24,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:24,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:24,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:24,300 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-09 01:15:24,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:24,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850248985] [2025-03-09 01:15:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850248985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:24,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:24,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533193738] [2025-03-09 01:15:24,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:24,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:24,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:24,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:24,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:24,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 83 [2025-03-09 01:15:24,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:15:24,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:24,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 83 [2025-03-09 01:15:24,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:24,834 INFO L124 PetriNetUnfolderBase]: 2991/6082 cut-off events. [2025-03-09 01:15:24,835 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-09 01:15:24,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10967 conditions, 6082 events. 2991/6082 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 45790 event pairs, 2583 based on Foata normal form. 1295/7123 useless extension candidates. Maximal degree in co-relation 8045. Up to 4189 conditions per place. [2025-03-09 01:15:24,863 INFO L140 encePairwiseOnDemand]: 63/83 looper letters, 54 selfloop transitions, 2 changer transitions 1/82 dead transitions. [2025-03-09 01:15:24,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 294 flow [2025-03-09 01:15:24,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:24,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2025-03-09 01:15:24,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506024096385542 [2025-03-09 01:15:24,865 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 182 flow. Second operand 3 states and 162 transitions. [2025-03-09 01:15:24,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 294 flow [2025-03-09 01:15:24,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:24,867 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 146 flow [2025-03-09 01:15:24,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-03-09 01:15:24,868 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-03-09 01:15:24,868 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 146 flow [2025-03-09 01:15:24,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:15:24,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:24,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:24,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:15:24,868 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-09 01:15:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash 366479, now seen corresponding path program 1 times [2025-03-09 01:15:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:24,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778170874] [2025-03-09 01:15:24,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:24,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:24,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:24,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:24,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:24,942 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-09 01:15:24,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:24,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778170874] [2025-03-09 01:15:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778170874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:24,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:24,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:24,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000587840] [2025-03-09 01:15:24,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:24,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:24,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:24,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:24,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:24,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-09 01:15:24,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-09 01:15:24,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:24,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-09 01:15:24,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:25,402 INFO L124 PetriNetUnfolderBase]: 2594/5534 cut-off events. [2025-03-09 01:15:25,402 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-09 01:15:25,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9894 conditions, 5534 events. 2594/5534 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 43171 event pairs, 1197 based on Foata normal form. 1/5304 useless extension candidates. Maximal degree in co-relation 9006. Up to 4168 conditions per place. [2025-03-09 01:15:25,428 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 46 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-03-09 01:15:25,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 264 flow [2025-03-09 01:15:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-03-09 01:15:25,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5381526104417671 [2025-03-09 01:15:25,430 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 146 flow. Second operand 3 states and 134 transitions. [2025-03-09 01:15:25,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 264 flow [2025-03-09 01:15:25,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 74 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:25,435 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 156 flow [2025-03-09 01:15:25,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2025-03-09 01:15:25,435 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-03-09 01:15:25,436 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 156 flow [2025-03-09 01:15:25,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-09 01:15:25,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:25,436 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:15:25,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:15:25,436 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-09 01:15:25,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash -840660830, now seen corresponding path program 1 times [2025-03-09 01:15:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:25,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164639870] [2025-03-09 01:15:25,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:25,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:25,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:15:25,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:15:25,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:25,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:25,524 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-09 01:15:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164639870] [2025-03-09 01:15:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164639870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:25,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:15:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390224063] [2025-03-09 01:15:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:25,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:15:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:25,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:15:25,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:15:25,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-09 01:15:25,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-09 01:15:25,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:25,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-09 01:15:25,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:25,937 INFO L124 PetriNetUnfolderBase]: 2585/5591 cut-off events. [2025-03-09 01:15:25,937 INFO L125 PetriNetUnfolderBase]: For 320/320 co-relation queries the response was YES. [2025-03-09 01:15:25,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10142 conditions, 5591 events. 2585/5591 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 45699 event pairs, 88 based on Foata normal form. 10/5386 useless extension candidates. Maximal degree in co-relation 9043. Up to 3921 conditions per place. [2025-03-09 01:15:25,965 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 64 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-03-09 01:15:25,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 354 flow [2025-03-09 01:15:25,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:25,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2025-03-09 01:15:25,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5451807228915663 [2025-03-09 01:15:25,967 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 156 flow. Second operand 4 states and 181 transitions. [2025-03-09 01:15:25,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 354 flow [2025-03-09 01:15:25,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:15:25,972 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 173 flow [2025-03-09 01:15:25,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2025-03-09 01:15:25,974 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 2 predicate places. [2025-03-09 01:15:25,975 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 173 flow [2025-03-09 01:15:25,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-09 01:15:25,975 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:25,975 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-09 01:15:25,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:15:25,976 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-09 01:15:25,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:25,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1041290092, now seen corresponding path program 1 times [2025-03-09 01:15:25,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:25,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-09 01:15:25,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:25,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:25,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:15:25,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:15:25,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:25,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:26,097 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-09 01:15:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:26,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-09 01:15:26,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677339549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:26,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:26,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:26,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954471075] [2025-03-09 01:15:26,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:26,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:15:26,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:26,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:15:26,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:15:26,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-03-09 01:15:26,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-09 01:15:26,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:26,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-03-09 01:15:26,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:26,587 INFO L124 PetriNetUnfolderBase]: 2405/5087 cut-off events. [2025-03-09 01:15:26,587 INFO L125 PetriNetUnfolderBase]: For 648/656 co-relation queries the response was YES. [2025-03-09 01:15:26,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9580 conditions, 5087 events. 2405/5087 cut-off events. For 648/656 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 38701 event pairs, 1078 based on Foata normal form. 100/5034 useless extension candidates. Maximal degree in co-relation 7807. Up to 3081 conditions per place. [2025-03-09 01:15:26,614 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 80 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2025-03-09 01:15:26,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 431 flow [2025-03-09 01:15:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:15:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:15:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-09 01:15:26,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5445783132530121 [2025-03-09 01:15:26,616 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 173 flow. Second operand 5 states and 226 transitions. [2025-03-09 01:15:26,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 431 flow [2025-03-09 01:15:26,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 111 transitions, 422 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:26,621 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 168 flow [2025-03-09 01:15:26,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2025-03-09 01:15:26,622 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2025-03-09 01:15:26,622 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 168 flow [2025-03-09 01:15:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 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-09 01:15:26,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:26,622 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-03-09 01:15:26,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:15:26,622 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-09 01:15:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:26,623 INFO L85 PathProgramCache]: Analyzing trace with hash 2079745864, now seen corresponding path program 1 times [2025-03-09 01:15:26,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:26,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647554741] [2025-03-09 01:15:26,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:26,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:26,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:15:26,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:15:26,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:26,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:26,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:15:26,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:15:26,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:15:26,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:26,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:26,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:15:26,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 01:15:26,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 01:15:26,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:15:26,663 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-09 01:15:26,663 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:15:26,663 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:15:26,691 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:15:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 107 transitions, 241 flow [2025-03-09 01:15:26,711 INFO L124 PetriNetUnfolderBase]: 42/245 cut-off events. [2025-03-09 01:15:26,712 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:15:26,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 245 events. 42/245 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1100 event pairs, 1 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 168. Up to 12 conditions per place. [2025-03-09 01:15:26,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 107 transitions, 241 flow [2025-03-09 01:15:26,715 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 107 transitions, 241 flow [2025-03-09 01:15:26,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:26,716 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;@5b34ad59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:26,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:15:26,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:26,718 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:26,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:26,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:26,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:26,719 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-09 01:15:26,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 472729, now seen corresponding path program 1 times [2025-03-09 01:15:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104025749] [2025-03-09 01:15:26,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:26,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:26,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:26,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:26,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:26,748 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-09 01:15:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104025749] [2025-03-09 01:15:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104025749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:26,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435145265] [2025-03-09 01:15:26,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:26,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:26,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:26,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:26,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 107 [2025-03-09 01:15:26,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 241 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-09 01:15:26,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:26,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 107 [2025-03-09 01:15:26,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:31,161 INFO L124 PetriNetUnfolderBase]: 47447/78741 cut-off events. [2025-03-09 01:15:31,162 INFO L125 PetriNetUnfolderBase]: For 1236/1236 co-relation queries the response was YES. [2025-03-09 01:15:31,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145974 conditions, 78741 events. 47447/78741 cut-off events. For 1236/1236 co-relation queries the response was YES. Maximal size of possible extension queue 1965. Compared 701585 event pairs, 40780 based on Foata normal form. 18521/94212 useless extension candidates. Maximal degree in co-relation 53259. Up to 57237 conditions per place. [2025-03-09 01:15:31,527 INFO L140 encePairwiseOnDemand]: 81/107 looper letters, 74 selfloop transitions, 2 changer transitions 1/109 dead transitions. [2025-03-09 01:15:31,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 109 transitions, 399 flow [2025-03-09 01:15:31,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:31,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-03-09 01:15:31,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6697819314641744 [2025-03-09 01:15:31,529 INFO L175 Difference]: Start difference. First operand has 89 places, 107 transitions, 241 flow. Second operand 3 states and 215 transitions. [2025-03-09 01:15:31,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 109 transitions, 399 flow [2025-03-09 01:15:31,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 109 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:15:31,533 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 193 flow [2025-03-09 01:15:31,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-03-09 01:15:31,535 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -1 predicate places. [2025-03-09 01:15:31,535 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 193 flow [2025-03-09 01:15:31,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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-09 01:15:31,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:31,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:31,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:15:31,536 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-09 01:15:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 472730, now seen corresponding path program 1 times [2025-03-09 01:15:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236522591] [2025-03-09 01:15:31,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:31,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:31,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:31,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:31,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:31,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:31,589 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-09 01:15:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236522591] [2025-03-09 01:15:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236522591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:31,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:31,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982389084] [2025-03-09 01:15:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:31,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:31,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:31,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:31,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:31,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 107 [2025-03-09 01:15:31,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 193 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-09 01:15:31,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:31,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 107 [2025-03-09 01:15:31,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:35,271 INFO L124 PetriNetUnfolderBase]: 40912/70009 cut-off events. [2025-03-09 01:15:35,271 INFO L125 PetriNetUnfolderBase]: For 2390/2390 co-relation queries the response was YES. [2025-03-09 01:15:35,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129369 conditions, 70009 events. 40912/70009 cut-off events. For 2390/2390 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 638845 event pairs, 26434 based on Foata normal form. 1/67202 useless extension candidates. Maximal degree in co-relation 117632. Up to 57216 conditions per place. [2025-03-09 01:15:35,590 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 57 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-09 01:15:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 92 transitions, 333 flow [2025-03-09 01:15:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:15:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:15:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-09 01:15:35,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5171339563862928 [2025-03-09 01:15:35,591 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 193 flow. Second operand 3 states and 166 transitions. [2025-03-09 01:15:35,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 92 transitions, 333 flow [2025-03-09 01:15:35,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:35,698 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 203 flow [2025-03-09 01:15:35,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-03-09 01:15:35,699 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -1 predicate places. [2025-03-09 01:15:35,699 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 203 flow [2025-03-09 01:15:35,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-09 01:15:35,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:35,699 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 01:15:35,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:15:35,699 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-09 01:15:35,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:35,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1495929577, now seen corresponding path program 1 times [2025-03-09 01:15:35,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:35,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382040463] [2025-03-09 01:15:35,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:35,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:35,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 01:15:35,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 01:15:35,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:35,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:35,791 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-09 01:15:35,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:35,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382040463] [2025-03-09 01:15:35,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382040463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:35,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:35,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:15:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400845113] [2025-03-09 01:15:35,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:35,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:15:35,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:35,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:15:35,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:15:35,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 107 [2025-03-09 01:15:35,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-09 01:15:35,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:35,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 107 [2025-03-09 01:15:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:39,710 INFO L124 PetriNetUnfolderBase]: 40903/69770 cut-off events. [2025-03-09 01:15:39,710 INFO L125 PetriNetUnfolderBase]: For 4649/4649 co-relation queries the response was YES. [2025-03-09 01:15:39,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131111 conditions, 69770 events. 40903/69770 cut-off events. For 4649/4649 co-relation queries the response was YES. Maximal size of possible extension queue 1855. Compared 634153 event pairs, 24781 based on Foata normal form. 10/68262 useless extension candidates. Maximal degree in co-relation 13160. Up to 56969 conditions per place. [2025-03-09 01:15:39,983 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 76 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2025-03-09 01:15:39,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 113 transitions, 429 flow [2025-03-09 01:15:39,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2025-03-09 01:15:39,985 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163551401869159 [2025-03-09 01:15:39,985 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 203 flow. Second operand 4 states and 221 transitions. [2025-03-09 01:15:39,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 113 transitions, 429 flow [2025-03-09 01:15:39,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 113 transitions, 427 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:15:39,989 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 226 flow [2025-03-09 01:15:39,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-03-09 01:15:39,990 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2025-03-09 01:15:39,990 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 226 flow [2025-03-09 01:15:39,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 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-09 01:15:39,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:39,991 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-09 01:15:39,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:15:39,991 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-09 01:15:39,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1111200115, now seen corresponding path program 1 times [2025-03-09 01:15:39,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:39,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583898378] [2025-03-09 01:15:39,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:39,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:15:40,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:15:40,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:40,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:40,099 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-09 01:15:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583898378] [2025-03-09 01:15:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583898378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:15:40,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542986165] [2025-03-09 01:15:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:40,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:15:40,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:40,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:15:40,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:15:40,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 107 [2025-03-09 01:15:40,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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-09 01:15:40,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:40,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 107 [2025-03-09 01:15:40,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:44,116 INFO L124 PetriNetUnfolderBase]: 40912/69207 cut-off events. [2025-03-09 01:15:44,117 INFO L125 PetriNetUnfolderBase]: For 9936/9936 co-relation queries the response was YES. [2025-03-09 01:15:44,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131790 conditions, 69207 events. 40912/69207 cut-off events. For 9936/9936 co-relation queries the response was YES. Maximal size of possible extension queue 1889. Compared 626290 event pairs, 11140 based on Foata normal form. 1100/69268 useless extension candidates. Maximal degree in co-relation 10042. Up to 42229 conditions per place. [2025-03-09 01:15:44,604 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 129 selfloop transitions, 7 changer transitions 0/168 dead transitions. [2025-03-09 01:15:44,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 168 transitions, 662 flow [2025-03-09 01:15:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:15:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:15:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 341 transitions. [2025-03-09 01:15:44,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5311526479750779 [2025-03-09 01:15:44,606 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 226 flow. Second operand 6 states and 341 transitions. [2025-03-09 01:15:44,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 168 transitions, 662 flow [2025-03-09 01:15:44,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 168 transitions, 653 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:15:44,610 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 233 flow [2025-03-09 01:15:44,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2025-03-09 01:15:44,610 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 5 predicate places. [2025-03-09 01:15:44,611 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 233 flow [2025-03-09 01:15:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 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-09 01:15:44,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:44,611 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:15:44,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:15:44,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-09 01:15:44,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1928623631, now seen corresponding path program 1 times [2025-03-09 01:15:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51056459] [2025-03-09 01:15:44,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:44,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:15:44,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:15:44,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:44,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:44,645 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-09 01:15:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51056459] [2025-03-09 01:15:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51056459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:15:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910096078] [2025-03-09 01:15:44,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:15:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:44,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:15:44,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:15:44,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 107 [2025-03-09 01:15:44,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-09 01:15:44,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:44,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 107 [2025-03-09 01:15:44,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:15:48,439 INFO L124 PetriNetUnfolderBase]: 37941/66035 cut-off events. [2025-03-09 01:15:48,439 INFO L125 PetriNetUnfolderBase]: For 19317/19457 co-relation queries the response was YES. [2025-03-09 01:15:48,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129748 conditions, 66035 events. 37941/66035 cut-off events. For 19317/19457 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 610597 event pairs, 23002 based on Foata normal form. 10/64115 useless extension candidates. Maximal degree in co-relation 10767. Up to 52827 conditions per place. [2025-03-09 01:15:48,756 INFO L140 encePairwiseOnDemand]: 104/107 looper letters, 75 selfloop transitions, 3 changer transitions 0/111 dead transitions. [2025-03-09 01:15:48,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 441 flow [2025-03-09 01:15:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:15:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:15:48,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-03-09 01:15:48,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210280373831776 [2025-03-09 01:15:48,758 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 233 flow. Second operand 4 states and 223 transitions. [2025-03-09 01:15:48,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 441 flow [2025-03-09 01:15:48,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 423 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-09 01:15:48,771 INFO L231 Difference]: Finished difference. Result has 92 places, 83 transitions, 215 flow [2025-03-09 01:15:48,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=107, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=92, PETRI_TRANSITIONS=83} [2025-03-09 01:15:48,772 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 3 predicate places. [2025-03-09 01:15:48,772 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 83 transitions, 215 flow [2025-03-09 01:15:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 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-09 01:15:48,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:48,773 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1] [2025-03-09 01:15:48,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:15:48,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2025-03-09 01:15:48,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:48,773 INFO L85 PathProgramCache]: Analyzing trace with hash 952331119, now seen corresponding path program 1 times [2025-03-09 01:15:48,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:48,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403287922] [2025-03-09 01:15:48,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:48,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:15:48,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:15:48,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:48,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:48,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:15:48,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:15:48,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:15:48,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:48,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:15:48,807 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:15:48,807 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:15:48,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2025-03-09 01:15:48,809 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-03-09 01:15:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:15:48,810 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-09 01:15:48,810 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:15:48,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 01:15:48,832 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 01:15:48,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 131 transitions, 302 flow [2025-03-09 01:15:48,858 INFO L124 PetriNetUnfolderBase]: 65/377 cut-off events. [2025-03-09 01:15:48,859 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-09 01:15:48,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 377 events. 65/377 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1825 event pairs, 6 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 269. Up to 32 conditions per place. [2025-03-09 01:15:48,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 131 transitions, 302 flow [2025-03-09 01:15:48,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 131 transitions, 302 flow [2025-03-09 01:15:48,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:15:48,865 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;@5b34ad59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:15:48,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-09 01:15:48,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:15:48,866 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-09 01:15:48,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:15:48,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:15:48,866 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:15:48,867 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-09 01:15:48,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:15:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 602812, now seen corresponding path program 1 times [2025-03-09 01:15:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:15:48,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166577675] [2025-03-09 01:15:48,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:15:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:15:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:15:48,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:15:48,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:15:48,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:15:48,889 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-09 01:15:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:15:48,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166577675] [2025-03-09 01:15:48,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166577675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:15:48,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:15:48,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:15:48,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142177757] [2025-03-09 01:15:48,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:15:48,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:15:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:15:48,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:15:48,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:15:48,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 131 [2025-03-09 01:15:48,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:15:48,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:15:48,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 131 [2025-03-09 01:15:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand