./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:16:36,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:16:36,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:16:36,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:16:36,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:16:36,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:16:36,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:16:36,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:16:36,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:16:36,389 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:16:36,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:16:36,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:16:36,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:16:36,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:16:36,390 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:16:36,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:16:36,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:16:36,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:16:36,392 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:16:36,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:16:36,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:16:36,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:16:36,393 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-03-09 01:16:36,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:16:36,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:16:36,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:16:36,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:16:36,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:16:36,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-09 01:16:37,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8234fc1/f61b9089e58746979446ef6f4893dc2c/FLAGc98e268af [2025-03-09 01:16:38,151 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:16:38,152 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-03-09 01:16:38,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8234fc1/f61b9089e58746979446ef6f4893dc2c/FLAGc98e268af [2025-03-09 01:16:38,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8234fc1/f61b9089e58746979446ef6f4893dc2c [2025-03-09 01:16:38,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:16:38,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:16:38,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:16:38,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:16:38,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:16:38,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ab0ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38, skipping insertion in model container [2025-03-09 01:16:38,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:16:38,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:16:38,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:16:38,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:16:38,919 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:16:38,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38 WrapperNode [2025-03-09 01:16:38,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:16:38,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:16:38,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:16:38,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:16:38,925 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:16:38" (1/1) ... [2025-03-09 01:16:38,935 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:16:38" (1/1) ... [2025-03-09 01:16:38,955 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 256 [2025-03-09 01:16:38,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:16:38,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:16:38,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:16:38,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:16:38,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,989 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 5, 70, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 5 writes are split as follows [0, 0, 4, 1]. [2025-03-09 01:16:38,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:38,998 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:39,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:39,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:39,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:39,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:16:39,004 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:16:39,004 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:16:39,004 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:16:39,005 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (1/1) ... [2025-03-09 01:16:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:16:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:16:39,030 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:16:39,034 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:16:39,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 01:16:39,050 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 01:16:39,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:16:39,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:16:39,051 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:16:39,155 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:16:39,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:16:39,452 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-09 01:16:39,453 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-09 01:16:39,527 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:16:39,527 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:16:39,769 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:16:39,770 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:16:39,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:16:39 BoogieIcfgContainer [2025-03-09 01:16:39,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:16:39,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:16:39,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:16:39,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:16:39,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:16:38" (1/3) ... [2025-03-09 01:16:39,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7870803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:16:39, skipping insertion in model container [2025-03-09 01:16:39,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:16:38" (2/3) ... [2025-03-09 01:16:39,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7870803a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:16:39, skipping insertion in model container [2025-03-09 01:16:39,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:16:39" (3/3) ... [2025-03-09 01:16:39,779 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-03-09 01:16:39,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:16:39,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 109 locations, 1 initial locations, 13 loop locations, and 27 error locations. [2025-03-09 01:16:39,794 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:16:39,845 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 01:16:39,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 139 transitions, 285 flow [2025-03-09 01:16:39,951 INFO L124 PetriNetUnfolderBase]: 44/210 cut-off events. [2025-03-09 01:16:39,953 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 01:16:39,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 210 events. 44/210 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1030 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 132. Up to 8 conditions per place. [2025-03-09 01:16:39,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 139 transitions, 285 flow [2025-03-09 01:16:39,962 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 139 transitions, 285 flow [2025-03-09 01:16:39,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:16:39,979 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;@41fdf049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:16:39,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-09 01:16:39,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:16:39,987 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 01:16:39,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:16:39,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:39,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:16:39,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:39,992 INFO L85 PathProgramCache]: Analyzing trace with hash 20567146, now seen corresponding path program 1 times [2025-03-09 01:16:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060422185] [2025-03-09 01:16:39,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:39,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:40,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:16:40,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:16:40,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:40,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:40,201 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:16:40,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:40,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060422185] [2025-03-09 01:16:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060422185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:40,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800213387] [2025-03-09 01:16:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:40,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:40,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:40,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:40,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 139 [2025-03-09 01:16:40,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 139 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:16:40,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:40,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 139 [2025-03-09 01:16:40,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:40,576 INFO L124 PetriNetUnfolderBase]: 625/2048 cut-off events. [2025-03-09 01:16:40,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:16:40,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3241 conditions, 2048 events. 625/2048 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15692 event pairs, 525 based on Foata normal form. 345/2086 useless extension candidates. Maximal degree in co-relation 3137. Up to 1187 conditions per place. [2025-03-09 01:16:40,594 INFO L140 encePairwiseOnDemand]: 112/139 looper letters, 53 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-03-09 01:16:40,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 345 flow [2025-03-09 01:16:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:40,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-03-09 01:16:40,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163069544364509 [2025-03-09 01:16:40,607 INFO L175 Difference]: Start difference. First operand has 112 places, 139 transitions, 285 flow. Second operand 3 states and 257 transitions. [2025-03-09 01:16:40,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 345 flow [2025-03-09 01:16:40,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 345 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:16:40,615 INFO L231 Difference]: Finished difference. Result has 113 places, 114 transitions, 245 flow [2025-03-09 01:16:40,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=245, PETRI_PLACES=113, PETRI_TRANSITIONS=114} [2025-03-09 01:16:40,620 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 1 predicate places. [2025-03-09 01:16:40,620 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 114 transitions, 245 flow [2025-03-09 01:16:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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:16:40,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:40,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:16:40,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:16:40,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:40,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 637479174, now seen corresponding path program 1 times [2025-03-09 01:16:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:40,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660571671] [2025-03-09 01:16:40,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:40,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:16:40,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:16:40,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:40,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:40,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660571671] [2025-03-09 01:16:40,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660571671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:16:40,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873003032] [2025-03-09 01:16:40,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:16:40,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:16:40,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:16:40,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:16:40,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:16:40,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:40,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:40,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:16:40,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:16:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:40,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:16:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873003032] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:16:40,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:16:40,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:16:40,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075804794] [2025-03-09 01:16:40,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:16:40,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:16:40,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:40,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:16:40,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:16:40,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 139 [2025-03-09 01:16:40,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 114 transitions, 245 flow. Second operand has 7 states, 7 states have (on average 60.285714285714285) internal successors, (422), 7 states have internal predecessors, (422), 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:16:40,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:40,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 139 [2025-03-09 01:16:40,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:41,131 INFO L124 PetriNetUnfolderBase]: 625/2051 cut-off events. [2025-03-09 01:16:41,132 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:16:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 2051 events. 625/2051 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15703 event pairs, 525 based on Foata normal form. 0/1744 useless extension candidates. Maximal degree in co-relation 3245. Up to 1187 conditions per place. [2025-03-09 01:16:41,140 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 53 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2025-03-09 01:16:41,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 117 transitions, 373 flow [2025-03-09 01:16:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:16:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:16:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 415 transitions. [2025-03-09 01:16:41,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49760191846522783 [2025-03-09 01:16:41,143 INFO L175 Difference]: Start difference. First operand has 113 places, 114 transitions, 245 flow. Second operand 6 states and 415 transitions. [2025-03-09 01:16:41,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 117 transitions, 373 flow [2025-03-09 01:16:41,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 117 transitions, 369 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:16:41,148 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 277 flow [2025-03-09 01:16:41,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-03-09 01:16:41,149 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 8 predicate places. [2025-03-09 01:16:41,149 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 277 flow [2025-03-09 01:16:41,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 60.285714285714285) internal successors, (422), 7 states have internal predecessors, (422), 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:16:41,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:41,150 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-09 01:16:41,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:16:41,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:41,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:41,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1304945814, now seen corresponding path program 2 times [2025-03-09 01:16:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7885492] [2025-03-09 01:16:41,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:16:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:41,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-09 01:16:41,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-09 01:16:41,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:16:41,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:16:41,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:41,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7885492] [2025-03-09 01:16:41,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7885492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:41,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:41,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:41,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690557721] [2025-03-09 01:16:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:41,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:41,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:41,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:41,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:41,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 139 [2025-03-09 01:16:41,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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:16:41,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:41,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 139 [2025-03-09 01:16:41,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:41,685 INFO L124 PetriNetUnfolderBase]: 669/2154 cut-off events. [2025-03-09 01:16:41,685 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:16:41,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 2154 events. 669/2154 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16806 event pairs, 525 based on Foata normal form. 0/1850 useless extension candidates. Maximal degree in co-relation 3429. Up to 1184 conditions per place. [2025-03-09 01:16:41,696 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 80 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-03-09 01:16:41,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 137 transitions, 481 flow [2025-03-09 01:16:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2025-03-09 01:16:41,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875299760191847 [2025-03-09 01:16:41,698 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 277 flow. Second operand 3 states and 245 transitions. [2025-03-09 01:16:41,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 137 transitions, 481 flow [2025-03-09 01:16:41,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 137 transitions, 467 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:16:41,701 INFO L231 Difference]: Finished difference. Result has 119 places, 115 transitions, 263 flow [2025-03-09 01:16:41,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2025-03-09 01:16:41,702 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 7 predicate places. [2025-03-09 01:16:41,702 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 263 flow [2025-03-09 01:16:41,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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:16:41,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:41,702 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-09 01:16:41,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:16:41,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:41,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1304945813, now seen corresponding path program 1 times [2025-03-09 01:16:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704536211] [2025-03-09 01:16:41,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:41,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:41,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:16:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:16:41,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:41,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:41,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:41,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704536211] [2025-03-09 01:16:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704536211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:16:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293088417] [2025-03-09 01:16:41,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:41,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:16:41,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:16:41,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:16:41,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:16:41,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:16:41,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:41,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:41,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:16:41,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:16:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:41,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:16:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293088417] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:16:41,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:16:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:16:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139432856] [2025-03-09 01:16:41,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:16:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:16:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:41,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:16:41,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:16:41,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 139 [2025-03-09 01:16:41,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 263 flow. Second operand has 13 states, 13 states have (on average 60.15384615384615) internal successors, (782), 13 states have internal predecessors, (782), 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:16:41,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:41,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 139 [2025-03-09 01:16:41,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:42,262 INFO L124 PetriNetUnfolderBase]: 625/2053 cut-off events. [2025-03-09 01:16:42,262 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-09 01:16:42,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3308 conditions, 2053 events. 625/2053 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15662 event pairs, 525 based on Foata normal form. 6/1757 useless extension candidates. Maximal degree in co-relation 3256. Up to 1187 conditions per place. [2025-03-09 01:16:42,274 INFO L140 encePairwiseOnDemand]: 136/139 looper letters, 53 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2025-03-09 01:16:42,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 121 transitions, 427 flow [2025-03-09 01:16:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:16:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:16:42,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 778 transitions. [2025-03-09 01:16:42,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46642685851318944 [2025-03-09 01:16:42,279 INFO L175 Difference]: Start difference. First operand has 119 places, 115 transitions, 263 flow. Second operand 12 states and 778 transitions. [2025-03-09 01:16:42,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 121 transitions, 427 flow [2025-03-09 01:16:42,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:16:42,284 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 343 flow [2025-03-09 01:16:42,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=343, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2025-03-09 01:16:42,287 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 22 predicate places. [2025-03-09 01:16:42,287 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 343 flow [2025-03-09 01:16:42,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 60.15384615384615) internal successors, (782), 13 states have internal predecessors, (782), 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:16:42,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:42,287 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-09 01:16:42,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:16:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:16:42,488 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:42,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1499067883, now seen corresponding path program 2 times [2025-03-09 01:16:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851844082] [2025-03-09 01:16:42,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:16:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:42,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 01:16:42,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-09 01:16:42,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:16:42,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:16:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:42,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851844082] [2025-03-09 01:16:42,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851844082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:42,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:42,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320280552] [2025-03-09 01:16:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:42,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:42,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:42,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:42,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 139 [2025-03-09 01:16:42,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:16:42,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:42,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 139 [2025-03-09 01:16:42,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:42,825 INFO L124 PetriNetUnfolderBase]: 619/1919 cut-off events. [2025-03-09 01:16:42,825 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 01:16:42,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3191 conditions, 1919 events. 619/1919 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14891 event pairs, 0 based on Foata normal form. 1/1655 useless extension candidates. Maximal degree in co-relation 3115. Up to 1183 conditions per place. [2025-03-09 01:16:42,835 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 86 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-03-09 01:16:42,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 144 transitions, 565 flow [2025-03-09 01:16:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-09 01:16:42,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6091127098321343 [2025-03-09 01:16:42,838 INFO L175 Difference]: Start difference. First operand has 134 places, 121 transitions, 343 flow. Second operand 3 states and 254 transitions. [2025-03-09 01:16:42,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 144 transitions, 565 flow [2025-03-09 01:16:42,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 144 transitions, 517 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:16:42,842 INFO L231 Difference]: Finished difference. Result has 132 places, 121 transitions, 305 flow [2025-03-09 01:16:42,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=132, PETRI_TRANSITIONS=121} [2025-03-09 01:16:42,842 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2025-03-09 01:16:42,843 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 121 transitions, 305 flow [2025-03-09 01:16:42,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:16:42,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:42,843 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:16:42,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:16:42,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:42,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:42,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1888001072, now seen corresponding path program 1 times [2025-03-09 01:16:42,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:42,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113876409] [2025-03-09 01:16:42,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:42,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:42,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:16:42,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:16:42,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:42,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:16:42,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:42,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113876409] [2025-03-09 01:16:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113876409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:42,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:42,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:16:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794009303] [2025-03-09 01:16:42,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:42,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:16:42,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:42,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:16:42,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:16:43,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 139 [2025-03-09 01:16:43,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 121 transitions, 305 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:16:43,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:43,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 139 [2025-03-09 01:16:43,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:43,286 INFO L124 PetriNetUnfolderBase]: 599/1889 cut-off events. [2025-03-09 01:16:43,286 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-09 01:16:43,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 1889 events. 599/1889 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 14473 event pairs, 17 based on Foata normal form. 22/1661 useless extension candidates. Maximal degree in co-relation 3108. Up to 1051 conditions per place. [2025-03-09 01:16:43,297 INFO L140 encePairwiseOnDemand]: 135/139 looper letters, 106 selfloop transitions, 3 changer transitions 0/165 dead transitions. [2025-03-09 01:16:43,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 165 transitions, 609 flow [2025-03-09 01:16:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:16:43,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:16:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2025-03-09 01:16:43,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5971223021582733 [2025-03-09 01:16:43,299 INFO L175 Difference]: Start difference. First operand has 132 places, 121 transitions, 305 flow. Second operand 4 states and 332 transitions. [2025-03-09 01:16:43,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 165 transitions, 609 flow [2025-03-09 01:16:43,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 165 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:16:43,304 INFO L231 Difference]: Finished difference. Result has 132 places, 120 transitions, 303 flow [2025-03-09 01:16:43,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=132, PETRI_TRANSITIONS=120} [2025-03-09 01:16:43,306 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, 20 predicate places. [2025-03-09 01:16:43,306 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 120 transitions, 303 flow [2025-03-09 01:16:43,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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:16:43,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:43,306 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:16:43,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:16:43,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-03-09 01:16:43,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:43,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1601509563, now seen corresponding path program 1 times [2025-03-09 01:16:43,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:43,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259880012] [2025-03-09 01:16:43,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:43,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:43,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:16:43,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:16:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:16:43,335 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:16:43,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:16:43,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:16:43,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:16:43,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:16:43,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:16:43,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-03-09 01:16:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 39 remaining) [2025-03-09 01:16:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 39 remaining) [2025-03-09 01:16:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 39 remaining) [2025-03-09 01:16:43,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (33 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (22 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 39 remaining) [2025-03-09 01:16:43,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 39 remaining) [2025-03-09 01:16:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 39 remaining) [2025-03-09 01:16:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 39 remaining) [2025-03-09 01:16:43,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 39 remaining) [2025-03-09 01:16:43,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:16:43,373 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-09 01:16:43,374 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:16:43,374 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 01:16:43,423 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:16:43,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 201 transitions, 418 flow [2025-03-09 01:16:43,448 INFO L124 PetriNetUnfolderBase]: 74/355 cut-off events. [2025-03-09 01:16:43,449 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:16:43,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 355 events. 74/355 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2056 event pairs, 0 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 212. Up to 12 conditions per place. [2025-03-09 01:16:43,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 201 transitions, 418 flow [2025-03-09 01:16:43,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 201 transitions, 418 flow [2025-03-09 01:16:43,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:16:43,458 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;@41fdf049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:16:43,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-09 01:16:43,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:16:43,460 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 01:16:43,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:16:43,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:43,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:16:43,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:16:43,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash 26754730, now seen corresponding path program 1 times [2025-03-09 01:16:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:43,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826856505] [2025-03-09 01:16:43,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:43,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:43,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:16:43,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:16:43,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:43,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:43,491 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:16:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826856505] [2025-03-09 01:16:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826856505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691329319] [2025-03-09 01:16:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:43,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:43,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:43,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2025-03-09 01:16:43,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 201 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:16:43,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:43,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2025-03-09 01:16:43,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:46,819 INFO L124 PetriNetUnfolderBase]: 27581/60624 cut-off events. [2025-03-09 01:16:46,819 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-09 01:16:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100664 conditions, 60624 events. 27581/60624 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 676634 event pairs, 24192 based on Foata normal form. 12028/64403 useless extension candidates. Maximal degree in co-relation 97140. Up to 39922 conditions per place. [2025-03-09 01:16:47,144 INFO L140 encePairwiseOnDemand]: 162/201 looper letters, 77 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-03-09 01:16:47,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 163 transitions, 500 flow [2025-03-09 01:16:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:47,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-09 01:16:47,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6102819237147595 [2025-03-09 01:16:47,147 INFO L175 Difference]: Start difference. First operand has 161 places, 201 transitions, 418 flow. Second operand 3 states and 368 transitions. [2025-03-09 01:16:47,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 163 transitions, 500 flow [2025-03-09 01:16:47,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 01:16:47,151 INFO L231 Difference]: Finished difference. Result has 161 places, 163 transitions, 352 flow [2025-03-09 01:16:47,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=161, PETRI_TRANSITIONS=163} [2025-03-09 01:16:47,152 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 0 predicate places. [2025-03-09 01:16:47,152 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 352 flow [2025-03-09 01:16:47,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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:16:47,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:47,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:16:47,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:16:47,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:16:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 829294479, now seen corresponding path program 1 times [2025-03-09 01:16:47,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:47,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221963579] [2025-03-09 01:16:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:47,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:47,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:16:47,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:16:47,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:47,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:47,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221963579] [2025-03-09 01:16:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221963579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:16:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888759230] [2025-03-09 01:16:47,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:47,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:47,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:16:47,200 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:16:47,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:16:47,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:16:47,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:16:47,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:47,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:47,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 01:16:47,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:16:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:47,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:16:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:47,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888759230] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:16:47,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:16:47,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 01:16:47,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9912599] [2025-03-09 01:16:47,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:16:47,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:16:47,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:47,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:16:47,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:16:47,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2025-03-09 01:16:47,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 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:16:47,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:47,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2025-03-09 01:16:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:50,550 INFO L124 PetriNetUnfolderBase]: 27581/60627 cut-off events. [2025-03-09 01:16:50,550 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-09 01:16:50,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100680 conditions, 60627 events. 27581/60627 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 676571 event pairs, 24192 based on Foata normal form. 0/52378 useless extension candidates. Maximal degree in co-relation 100667. Up to 39922 conditions per place. [2025-03-09 01:16:50,877 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 77 selfloop transitions, 5 changer transitions 0/166 dead transitions. [2025-03-09 01:16:50,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 166 transitions, 528 flow [2025-03-09 01:16:50,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:16:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:16:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 589 transitions. [2025-03-09 01:16:50,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48839137645107794 [2025-03-09 01:16:50,880 INFO L175 Difference]: Start difference. First operand has 161 places, 163 transitions, 352 flow. Second operand 6 states and 589 transitions. [2025-03-09 01:16:50,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 166 transitions, 528 flow [2025-03-09 01:16:50,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 166 transitions, 524 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:16:50,883 INFO L231 Difference]: Finished difference. Result has 168 places, 166 transitions, 384 flow [2025-03-09 01:16:50,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=168, PETRI_TRANSITIONS=166} [2025-03-09 01:16:50,886 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 7 predicate places. [2025-03-09 01:16:50,886 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 166 transitions, 384 flow [2025-03-09 01:16:50,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 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:16:50,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:50,887 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-09 01:16:50,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:16:51,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:51,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:16:51,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 758501354, now seen corresponding path program 2 times [2025-03-09 01:16:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:51,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701938426] [2025-03-09 01:16:51,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:16:51,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:51,098 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-09 01:16:51,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-03-09 01:16:51,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:16:51,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 01:16:51,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:51,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701938426] [2025-03-09 01:16:51,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701938426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:51,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:51,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840994582] [2025-03-09 01:16:51,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:51,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:51,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:51,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:51,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:51,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 201 [2025-03-09 01:16:51,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 166 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:16:51,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:51,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 201 [2025-03-09 01:16:51,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:54,617 INFO L124 PetriNetUnfolderBase]: 29604/64162 cut-off events. [2025-03-09 01:16:54,617 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2025-03-09 01:16:54,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107288 conditions, 64162 events. 29604/64162 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 1845. Compared 716459 event pairs, 24171 based on Foata normal form. 0/55664 useless extension candidates. Maximal degree in co-relation 107253. Up to 39875 conditions per place. [2025-03-09 01:16:55,137 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 126 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-03-09 01:16:55,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 208 transitions, 724 flow [2025-03-09 01:16:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:16:55,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:16:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2025-03-09 01:16:55,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6069651741293532 [2025-03-09 01:16:55,139 INFO L175 Difference]: Start difference. First operand has 168 places, 166 transitions, 384 flow. Second operand 3 states and 366 transitions. [2025-03-09 01:16:55,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 208 transitions, 724 flow [2025-03-09 01:16:55,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 208 transitions, 710 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-09 01:16:55,144 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 370 flow [2025-03-09 01:16:55,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2025-03-09 01:16:55,145 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 6 predicate places. [2025-03-09 01:16:55,145 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 370 flow [2025-03-09 01:16:55,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:16:55,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:55,145 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-03-09 01:16:55,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:16:55,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:16:55,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:55,146 INFO L85 PathProgramCache]: Analyzing trace with hash 758501355, now seen corresponding path program 1 times [2025-03-09 01:16:55,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:55,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149420253] [2025-03-09 01:16:55,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:55,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:55,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:16:55,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:16:55,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:55,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:55,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:55,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149420253] [2025-03-09 01:16:55,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149420253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:16:55,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387673313] [2025-03-09 01:16:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:16:55,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:55,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:16:55,213 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:16:55,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:16:55,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:16:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:16:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:16:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:55,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:16:55,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:16:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:55,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:16:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:16:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387673313] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:16:55,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:16:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-09 01:16:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190958608] [2025-03-09 01:16:55,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:16:55,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:16:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:55,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:16:55,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:16:55,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2025-03-09 01:16:55,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 370 flow. Second operand has 13 states, 13 states have (on average 85.15384615384616) internal successors, (1107), 13 states have internal predecessors, (1107), 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:16:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2025-03-09 01:16:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:16:58,917 INFO L124 PetriNetUnfolderBase]: 27581/60621 cut-off events. [2025-03-09 01:16:58,917 INFO L125 PetriNetUnfolderBase]: For 757/757 co-relation queries the response was YES. [2025-03-09 01:16:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101229 conditions, 60621 events. 27581/60621 cut-off events. For 757/757 co-relation queries the response was YES. Maximal size of possible extension queue 1746. Compared 676443 event pairs, 24192 based on Foata normal form. 6/52391 useless extension candidates. Maximal degree in co-relation 101176. Up to 39922 conditions per place. [2025-03-09 01:16:59,307 INFO L140 encePairwiseOnDemand]: 198/201 looper letters, 77 selfloop transitions, 11 changer transitions 0/170 dead transitions. [2025-03-09 01:16:59,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 170 transitions, 582 flow [2025-03-09 01:16:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:16:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:16:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1102 transitions. [2025-03-09 01:16:59,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45688225538971805 [2025-03-09 01:16:59,310 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 370 flow. Second operand 12 states and 1102 transitions. [2025-03-09 01:16:59,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 170 transitions, 582 flow [2025-03-09 01:16:59,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 170 transitions, 578 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:16:59,314 INFO L231 Difference]: Finished difference. Result has 182 places, 170 transitions, 450 flow [2025-03-09 01:16:59,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=450, PETRI_PLACES=182, PETRI_TRANSITIONS=170} [2025-03-09 01:16:59,316 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 21 predicate places. [2025-03-09 01:16:59,316 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 170 transitions, 450 flow [2025-03-09 01:16:59,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 85.15384615384616) internal successors, (1107), 13 states have internal predecessors, (1107), 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:16:59,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:16:59,317 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-03-09 01:16:59,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:16:59,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:16:59,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:16:59,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:16:59,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1714733621, now seen corresponding path program 2 times [2025-03-09 01:16:59,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:16:59,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38412988] [2025-03-09 01:16:59,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:16:59,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:16:59,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-09 01:16:59,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-03-09 01:16:59,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:16:59,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:16:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:16:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:16:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38412988] [2025-03-09 01:16:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38412988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:16:59,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:16:59,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:16:59,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141798575] [2025-03-09 01:16:59,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:16:59,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:16:59,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:16:59,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:16:59,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:16:59,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 201 [2025-03-09 01:16:59,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 170 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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:16:59,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:16:59,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 201 [2025-03-09 01:16:59,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:17:03,488 INFO L124 PetriNetUnfolderBase]: 27992/60209 cut-off events. [2025-03-09 01:17:03,488 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-03-09 01:17:03,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101304 conditions, 60209 events. 27992/60209 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 1809. Compared 667436 event pairs, 12096 based on Foata normal form. 1/52186 useless extension candidates. Maximal degree in co-relation 101227. Up to 40894 conditions per place. [2025-03-09 01:17:03,947 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 111 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2025-03-09 01:17:03,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 194 transitions, 724 flow [2025-03-09 01:17:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:17:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:17:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2025-03-09 01:17:03,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5870646766169154 [2025-03-09 01:17:03,948 INFO L175 Difference]: Start difference. First operand has 182 places, 170 transitions, 450 flow. Second operand 3 states and 354 transitions. [2025-03-09 01:17:03,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 194 transitions, 724 flow [2025-03-09 01:17:03,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 194 transitions, 676 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-03-09 01:17:03,951 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 416 flow [2025-03-09 01:17:03,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=416, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2025-03-09 01:17:03,952 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 19 predicate places. [2025-03-09 01:17:03,952 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 416 flow [2025-03-09 01:17:03,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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:17:03,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:17:03,952 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:17:03,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:17:03,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:17:03,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:17:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 616262708, now seen corresponding path program 1 times [2025-03-09 01:17:03,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:17:03,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592378883] [2025-03-09 01:17:03,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:17:03,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:17:03,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:17:03,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:17:03,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:17:03,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:17:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 01:17:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:17:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592378883] [2025-03-09 01:17:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592378883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:17:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:17:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:17:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155726783] [2025-03-09 01:17:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:17:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:17:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:17:04,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:17:04,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:17:04,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 201 [2025-03-09 01:17:04,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 416 flow. Second operand has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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:17:04,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:17:04,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 201 [2025-03-09 01:17:04,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:17:07,806 INFO L124 PetriNetUnfolderBase]: 27287/56522 cut-off events. [2025-03-09 01:17:07,806 INFO L125 PetriNetUnfolderBase]: For 1279/1279 co-relation queries the response was YES. [2025-03-09 01:17:08,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97739 conditions, 56522 events. 27287/56522 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 1715. Compared 610261 event pairs, 2081 based on Foata normal form. 528/50135 useless extension candidates. Maximal degree in co-relation 97685. Up to 34503 conditions per place. [2025-03-09 01:17:08,242 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 198 selfloop transitions, 5 changer transitions 0/283 dead transitions. [2025-03-09 01:17:08,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 283 transitions, 1044 flow [2025-03-09 01:17:08,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:17:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:17:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 605 transitions. [2025-03-09 01:17:08,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6019900497512438 [2025-03-09 01:17:08,244 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 416 flow. Second operand 5 states and 605 transitions. [2025-03-09 01:17:08,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 283 transitions, 1044 flow [2025-03-09 01:17:08,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 283 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:17:08,249 INFO L231 Difference]: Finished difference. Result has 183 places, 171 transitions, 427 flow [2025-03-09 01:17:08,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=183, PETRI_TRANSITIONS=171} [2025-03-09 01:17:08,249 INFO L279 CegarLoopForPetriNet]: 161 programPoint places, 22 predicate places. [2025-03-09 01:17:08,250 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 171 transitions, 427 flow [2025-03-09 01:17:08,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 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:17:08,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:17:08,250 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 01:17:08,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:17:08,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-03-09 01:17:08,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:17:08,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1877581972, now seen corresponding path program 1 times [2025-03-09 01:17:08,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:17:08,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100422446] [2025-03-09 01:17:08,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:17:08,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:17:08,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:17:08,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:17:08,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:17:08,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:17:08,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 01:17:08,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:17:08,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:17:08,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:17:08,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 01:17:08,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 01:17:08,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 01:17:08,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-03-09 01:17:08,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (33 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-03-09 01:17:08,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-03-09 01:17:08,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-03-09 01:17:08,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-03-09 01:17:08,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:17:08,300 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-09 01:17:08,300 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 01:17:08,300 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 01:17:08,329 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:17:08,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 263 transitions, 553 flow [2025-03-09 01:17:08,357 INFO L124 PetriNetUnfolderBase]: 107/521 cut-off events. [2025-03-09 01:17:08,358 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:17:08,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 521 events. 107/521 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3229 event pairs, 1 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 364. Up to 16 conditions per place. [2025-03-09 01:17:08,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 263 transitions, 553 flow [2025-03-09 01:17:08,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 263 transitions, 553 flow [2025-03-09 01:17:08,371 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:17:08,371 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;@41fdf049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:17:08,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-09 01:17:08,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:17:08,372 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 01:17:08,372 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:17:08,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:17:08,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 01:17:08,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-03-09 01:17:08,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:17:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash 34850922, now seen corresponding path program 1 times [2025-03-09 01:17:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:17:08,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881575716] [2025-03-09 01:17:08,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:17:08,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:17:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:17:08,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:17:08,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:17:08,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:17:08,397 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:17:08,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:17:08,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881575716] [2025-03-09 01:17:08,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881575716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:17:08,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:17:08,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:17:08,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476047721] [2025-03-09 01:17:08,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:17:08,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:17:08,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:17:08,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:17:08,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:17:08,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 263 [2025-03-09 01:17:08,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 263 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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:17:08,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:17:08,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 263 [2025-03-09 01:17:08,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand