./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:13,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:13,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:58:13,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:13,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:13,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:13,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:13,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:13,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:13,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:13,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:13,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:13,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:13,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:13,905 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:13,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:13,905 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:13,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:13,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:13,906 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:13,907 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:13,907 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:13,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:13,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:13,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:13,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:13,909 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:13,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:13,910 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-jdk21/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 -> cb010ae024b402436affeb854f96a5f9e0df3d8ec2cfe8b3a7f33676b7169a2c [2025-01-10 00:58:14,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:14,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:14,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:14,247 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:14,249 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:14,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-01-10 00:58:15,533 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d98d353b0/d6e63cfc71014401b395865cb9fcbd76/FLAG915a80690 [2025-01-10 00:58:15,915 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:15,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_21-deref_read_racing.i [2025-01-10 00:58:15,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d98d353b0/d6e63cfc71014401b395865cb9fcbd76/FLAG915a80690 [2025-01-10 00:58:16,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d98d353b0/d6e63cfc71014401b395865cb9fcbd76 [2025-01-10 00:58:16,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:16,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:16,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:16,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:16,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:16,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a2a01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16, skipping insertion in model container [2025-01-10 00:58:16,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:58:16,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:16,444 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:58:16,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:58:16,540 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:58:16,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16 WrapperNode [2025-01-10 00:58:16,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:16,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:16,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:58:16,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:58:16,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,588 INFO L138 Inliner]: procedures = 170, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2025-01-10 00:58:16,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:58:16,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:58:16,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:58:16,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:58:16,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,629 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-01-10 00:58:16,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:58:16,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:58:16,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:58:16,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:58:16,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (1/1) ... [2025-01-10 00:58:16,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:16,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:58:16,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:58:16,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:58:16,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:58:16,727 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:58:16,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:58:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:58:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:58:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:58:16,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:58:16,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:58:16,730 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:58:16,867 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:58:16,868 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:58:17,079 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:58:17,079 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:58:17,205 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:58:17,205 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:58:17,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:17 BoogieIcfgContainer [2025-01-10 00:58:17,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:58:17,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:58:17,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:58:17,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:58:17,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:16" (1/3) ... [2025-01-10 00:58:17,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ee5192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:17, skipping insertion in model container [2025-01-10 00:58:17,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:16" (2/3) ... [2025-01-10 00:58:17,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ee5192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:58:17, skipping insertion in model container [2025-01-10 00:58:17,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:58:17" (3/3) ... [2025-01-10 00:58:17,218 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_21-deref_read_racing.i [2025-01-10 00:58:17,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:58:17,233 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_21-deref_read_racing.i that has 2 procedures, 54 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-01-10 00:58:17,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:58:17,284 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:58:17,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 64 transitions, 132 flow [2025-01-10 00:58:17,364 INFO L124 PetriNetUnfolderBase]: 14/89 cut-off events. [2025-01-10 00:58:17,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 89 events. 14/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 297 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-01-10 00:58:17,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 64 transitions, 132 flow [2025-01-10 00:58:17,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 64 transitions, 132 flow [2025-01-10 00:58:17,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:17,400 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;@266d3c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:17,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 00:58:17,407 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:17,407 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:58:17,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:17,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:17,408 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:17,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 00:58:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:17,415 INFO L85 PathProgramCache]: Analyzing trace with hash 311620, now seen corresponding path program 1 times [2025-01-10 00:58:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:17,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356899129] [2025-01-10 00:58:17,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:17,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:17,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:17,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:17,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:17,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:17,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:17,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356899129] [2025-01-10 00:58:17,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356899129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:17,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:17,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:17,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707325468] [2025-01-10 00:58:17,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:17,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:17,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:17,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 64 [2025-01-10 00:58:17,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 64 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-10 00:58:17,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:17,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 64 [2025-01-10 00:58:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:17,944 INFO L124 PetriNetUnfolderBase]: 121/445 cut-off events. [2025-01-10 00:58:17,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 445 events. 121/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2443 event pairs, 100 based on Foata normal form. 83/466 useless extension candidates. Maximal degree in co-relation 701. Up to 254 conditions per place. [2025-01-10 00:58:17,952 INFO L140 encePairwiseOnDemand]: 50/64 looper letters, 35 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2025-01-10 00:58:17,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 210 flow [2025-01-10 00:58:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:17,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-01-10 00:58:17,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-01-10 00:58:17,967 INFO L175 Difference]: Start difference. First operand has 57 places, 64 transitions, 132 flow. Second operand 3 states and 142 transitions. [2025-01-10 00:58:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 210 flow [2025-01-10 00:58:17,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:17,976 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 120 flow [2025-01-10 00:58:17,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2025-01-10 00:58:17,984 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2025-01-10 00:58:17,986 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 120 flow [2025-01-10 00:58:17,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-01-10 00:58:17,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:17,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:17,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:58:17,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 00:58:17,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:17,989 INFO L85 PathProgramCache]: Analyzing trace with hash 36515229, now seen corresponding path program 1 times [2025-01-10 00:58:17,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:17,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614229992] [2025-01-10 00:58:17,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:17,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:18,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:18,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614229992] [2025-01-10 00:58:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614229992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:18,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:58:18,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153849523] [2025-01-10 00:58:18,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:18,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:18,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:18,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:18,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:18,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 64 [2025-01-10 00:58:18,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-01-10 00:58:18,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:18,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 64 [2025-01-10 00:58:18,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:18,291 INFO L124 PetriNetUnfolderBase]: 33/141 cut-off events. [2025-01-10 00:58:18,291 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-01-10 00:58:18,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 141 events. 33/141 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 436 event pairs, 20 based on Foata normal form. 24/151 useless extension candidates. Maximal degree in co-relation 237. Up to 69 conditions per place. [2025-01-10 00:58:18,292 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 27 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2025-01-10 00:58:18,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 164 flow [2025-01-10 00:58:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-01-10 00:58:18,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57421875 [2025-01-10 00:58:18,296 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 120 flow. Second operand 4 states and 147 transitions. [2025-01-10 00:58:18,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 164 flow [2025-01-10 00:58:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:18,297 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 78 flow [2025-01-10 00:58:18,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-01-10 00:58:18,300 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2025-01-10 00:58:18,301 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 78 flow [2025-01-10 00:58:18,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 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-01-10 00:58:18,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:18,302 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:58:18,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:58:18,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2025-01-10 00:58:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:18,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1131972482, now seen corresponding path program 1 times [2025-01-10 00:58:18,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:18,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261938045] [2025-01-10 00:58:18,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:18,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:18,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:18,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:18,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:18,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:58:18,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:58:18,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:18,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:18,384 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:18,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-01-10 00:58:18,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (20 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (19 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (16 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 22 remaining) [2025-01-10 00:58:18,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 22 remaining) [2025-01-10 00:58:18,390 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 22 remaining) [2025-01-10 00:58:18,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:58:18,392 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-10 00:58:18,394 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:18,395 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:58:18,425 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:58:18,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 100 transitions, 210 flow [2025-01-10 00:58:18,455 INFO L124 PetriNetUnfolderBase]: 24/151 cut-off events. [2025-01-10 00:58:18,455 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:58:18,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 151 events. 24/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 635 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2025-01-10 00:58:18,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 100 transitions, 210 flow [2025-01-10 00:58:18,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 100 transitions, 210 flow [2025-01-10 00:58:18,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:18,466 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;@266d3c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:18,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-01-10 00:58:18,468 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:18,468 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:58:18,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:18,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:18,468 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:18,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:18,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:18,471 INFO L85 PathProgramCache]: Analyzing trace with hash 410920, now seen corresponding path program 1 times [2025-01-10 00:58:18,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:18,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419722944] [2025-01-10 00:58:18,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:18,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:18,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:18,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:18,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:18,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:18,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419722944] [2025-01-10 00:58:18,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419722944] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050455132] [2025-01-10 00:58:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:18,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:18,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:18,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-01-10 00:58:18,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:18,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:18,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-01-10 00:58:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:19,499 INFO L124 PetriNetUnfolderBase]: 3157/7105 cut-off events. [2025-01-10 00:58:19,500 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 00:58:19,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12179 conditions, 7105 events. 3157/7105 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 60373 event pairs, 2992 based on Foata normal form. 1635/7956 useless extension candidates. Maximal degree in co-relation 8438. Up to 5018 conditions per place. [2025-01-10 00:58:19,592 INFO L140 encePairwiseOnDemand]: 80/100 looper letters, 48 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-01-10 00:58:19,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 97 transitions, 304 flow [2025-01-10 00:58:19,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2025-01-10 00:58:19,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-01-10 00:58:19,596 INFO L175 Difference]: Start difference. First operand has 89 places, 100 transitions, 210 flow. Second operand 3 states and 215 transitions. [2025-01-10 00:58:19,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 97 transitions, 304 flow [2025-01-10 00:58:19,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 304 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:19,600 INFO L231 Difference]: Finished difference. Result has 91 places, 84 transitions, 190 flow [2025-01-10 00:58:19,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=91, PETRI_TRANSITIONS=84} [2025-01-10 00:58:19,601 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 2 predicate places. [2025-01-10 00:58:19,602 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 84 transitions, 190 flow [2025-01-10 00:58:19,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:58:19,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:19,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:19,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:58:19,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:19,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:19,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1551958398, now seen corresponding path program 1 times [2025-01-10 00:58:19,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:19,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316303679] [2025-01-10 00:58:19,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:19,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:19,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:19,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316303679] [2025-01-10 00:58:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316303679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:58:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669520866] [2025-01-10 00:58:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:19,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:19,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:19,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:19,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-01-10 00:58:19,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 84 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-01-10 00:58:19,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:19,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-01-10 00:58:19,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:20,551 INFO L124 PetriNetUnfolderBase]: 3069/6658 cut-off events. [2025-01-10 00:58:20,552 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-01-10 00:58:20,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12007 conditions, 6658 events. 3069/6658 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 56244 event pairs, 140 based on Foata normal form. 24/6346 useless extension candidates. Maximal degree in co-relation 10887. Up to 4489 conditions per place. [2025-01-10 00:58:20,599 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 71 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-01-10 00:58:20,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 121 transitions, 412 flow [2025-01-10 00:58:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-01-10 00:58:20,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-01-10 00:58:20,603 INFO L175 Difference]: Start difference. First operand has 91 places, 84 transitions, 190 flow. Second operand 4 states and 264 transitions. [2025-01-10 00:58:20,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 121 transitions, 412 flow [2025-01-10 00:58:20,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:20,608 INFO L231 Difference]: Finished difference. Result has 94 places, 84 transitions, 200 flow [2025-01-10 00:58:20,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=94, PETRI_TRANSITIONS=84} [2025-01-10 00:58:20,609 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 5 predicate places. [2025-01-10 00:58:20,609 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 84 transitions, 200 flow [2025-01-10 00:58:20,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 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-01-10 00:58:20,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:20,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:20,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:58:20,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:20,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -599059638, now seen corresponding path program 1 times [2025-01-10 00:58:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:20,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352333138] [2025-01-10 00:58:20,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:20,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:20,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:20,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:20,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352333138] [2025-01-10 00:58:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352333138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764953947] [2025-01-10 00:58:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:20,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:20,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:20,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:20,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 100 [2025-01-10 00:58:20,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 84 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-01-10 00:58:20,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:20,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 100 [2025-01-10 00:58:20,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:21,285 INFO L124 PetriNetUnfolderBase]: 2805/6017 cut-off events. [2025-01-10 00:58:21,285 INFO L125 PetriNetUnfolderBase]: For 937/937 co-relation queries the response was YES. [2025-01-10 00:58:21,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11280 conditions, 6017 events. 2805/6017 cut-off events. For 937/937 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 48095 event pairs, 2805 based on Foata normal form. 0/5856 useless extension candidates. Maximal degree in co-relation 8108. Up to 4440 conditions per place. [2025-01-10 00:58:21,314 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 35 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2025-01-10 00:58:21,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 76 transitions, 256 flow [2025-01-10 00:58:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 00:58:21,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-01-10 00:58:21,316 INFO L175 Difference]: Start difference. First operand has 94 places, 84 transitions, 200 flow. Second operand 3 states and 163 transitions. [2025-01-10 00:58:21,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 76 transitions, 256 flow [2025-01-10 00:58:21,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 250 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:21,321 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 180 flow [2025-01-10 00:58:21,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2025-01-10 00:58:21,322 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -3 predicate places. [2025-01-10 00:58:21,322 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 180 flow [2025-01-10 00:58:21,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-01-10 00:58:21,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:21,323 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-10 00:58:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:58:21,323 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:21,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1241126707, now seen corresponding path program 1 times [2025-01-10 00:58:21,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:21,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510525670] [2025-01-10 00:58:21,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:21,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:21,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:21,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:21,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:21,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:21,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510525670] [2025-01-10 00:58:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510525670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500679006] [2025-01-10 00:58:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:21,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:21,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:21,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:21,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:21,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 100 [2025-01-10 00:58:21,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-01-10 00:58:21,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:21,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 100 [2025-01-10 00:58:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:21,672 INFO L124 PetriNetUnfolderBase]: 957/1910 cut-off events. [2025-01-10 00:58:21,673 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-01-10 00:58:21,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3709 conditions, 1910 events. 957/1910 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 12154 event pairs, 0 based on Foata normal form. 288/2146 useless extension candidates. Maximal degree in co-relation 3698. Up to 1224 conditions per place. [2025-01-10 00:58:21,680 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 63 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-01-10 00:58:21,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 342 flow [2025-01-10 00:58:21,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 303 transitions. [2025-01-10 00:58:21,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.606 [2025-01-10 00:58:21,682 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 180 flow. Second operand 5 states and 303 transitions. [2025-01-10 00:58:21,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 342 flow [2025-01-10 00:58:21,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 337 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:21,687 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 137 flow [2025-01-10 00:58:21,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-01-10 00:58:21,688 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -20 predicate places. [2025-01-10 00:58:21,688 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 137 flow [2025-01-10 00:58:21,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 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-01-10 00:58:21,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:21,690 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:21,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:58:21,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:21,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:21,690 INFO L85 PathProgramCache]: Analyzing trace with hash -599059637, now seen corresponding path program 1 times [2025-01-10 00:58:21,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:21,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654982299] [2025-01-10 00:58:21,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:21,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:21,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:21,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654982299] [2025-01-10 00:58:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654982299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226272816] [2025-01-10 00:58:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:21,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:21,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:21,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 100 [2025-01-10 00:58:21,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-01-10 00:58:21,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:21,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 100 [2025-01-10 00:58:21,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:22,000 INFO L124 PetriNetUnfolderBase]: 957/2016 cut-off events. [2025-01-10 00:58:22,000 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2025-01-10 00:58:22,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 2016 events. 957/2016 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 12307 event pairs, 957 based on Foata normal form. 0/1969 useless extension candidates. Maximal degree in co-relation 3804. Up to 1584 conditions per place. [2025-01-10 00:58:22,008 INFO L140 encePairwiseOnDemand]: 91/100 looper letters, 28 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-01-10 00:58:22,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 179 flow [2025-01-10 00:58:22,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 00:58:22,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-01-10 00:58:22,010 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 137 flow. Second operand 3 states and 156 transitions. [2025-01-10 00:58:22,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 179 flow [2025-01-10 00:58:22,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:22,012 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 118 flow [2025-01-10 00:58:22,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-01-10 00:58:22,013 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, -29 predicate places. [2025-01-10 00:58:22,013 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 118 flow [2025-01-10 00:58:22,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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-01-10 00:58:22,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:22,013 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:58:22,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:58:22,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-01-10 00:58:22,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash -179777229, now seen corresponding path program 1 times [2025-01-10 00:58:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454699861] [2025-01-10 00:58:22,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:22,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:22,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:22,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:22,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:22,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:58:22,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:58:22,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:58:22,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:22,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:58:22,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:58:22,047 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:58:22,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (28 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (27 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (24 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2025-01-10 00:58:22,048 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 30 remaining) [2025-01-10 00:58:22,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 30 remaining) [2025-01-10 00:58:22,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:58:22,051 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-10 00:58:22,052 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:58:22,052 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:58:22,085 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:58:22,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 136 transitions, 290 flow [2025-01-10 00:58:22,105 INFO L124 PetriNetUnfolderBase]: 34/213 cut-off events. [2025-01-10 00:58:22,105 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 00:58:22,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 213 events. 34/213 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 987 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2025-01-10 00:58:22,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 136 transitions, 290 flow [2025-01-10 00:58:22,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 136 transitions, 290 flow [2025-01-10 00:58:22,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:58:22,110 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;@266d3c37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:58:22,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-01-10 00:58:22,112 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:58:22,112 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:58:22,112 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:58:22,112 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:22,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:22,112 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:22,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:22,113 INFO L85 PathProgramCache]: Analyzing trace with hash 545968, now seen corresponding path program 1 times [2025-01-10 00:58:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:22,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580291180] [2025-01-10 00:58:22,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:22,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:22,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:22,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:22,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:22,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:22,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580291180] [2025-01-10 00:58:22,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580291180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:22,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178034221] [2025-01-10 00:58:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:22,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:22,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:22,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:22,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:22,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2025-01-10 00:58:22,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 136 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-01-10 00:58:22,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:22,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2025-01-10 00:58:22,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:29,325 INFO L124 PetriNetUnfolderBase]: 58597/104881 cut-off events. [2025-01-10 00:58:29,326 INFO L125 PetriNetUnfolderBase]: For 1036/1036 co-relation queries the response was YES. [2025-01-10 00:58:29,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186708 conditions, 104881 events. 58597/104881 cut-off events. For 1036/1036 co-relation queries the response was YES. Maximal size of possible extension queue 2586. Compared 1064472 event pairs, 56704 based on Foata normal form. 26991/122498 useless extension candidates. Maximal degree in co-relation 95464. Up to 81194 conditions per place. [2025-01-10 00:58:30,066 INFO L140 encePairwiseOnDemand]: 110/136 looper letters, 60 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-01-10 00:58:30,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 127 transitions, 396 flow [2025-01-10 00:58:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:30,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2025-01-10 00:58:30,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7034313725490197 [2025-01-10 00:58:30,068 INFO L175 Difference]: Start difference. First operand has 121 places, 136 transitions, 290 flow. Second operand 3 states and 287 transitions. [2025-01-10 00:58:30,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 127 transitions, 396 flow [2025-01-10 00:58:30,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 127 transitions, 394 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:30,075 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 256 flow [2025-01-10 00:58:30,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=120, 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=256, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2025-01-10 00:58:30,077 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places. [2025-01-10 00:58:30,078 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 256 flow [2025-01-10 00:58:30,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 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-01-10 00:58:30,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:30,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:58:30,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:30,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:30,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1722800131, now seen corresponding path program 1 times [2025-01-10 00:58:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671036720] [2025-01-10 00:58:30,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:30,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:30,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:30,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:30,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:30,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671036720] [2025-01-10 00:58:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671036720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:30,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:30,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:58:30,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055213510] [2025-01-10 00:58:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:30,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:58:30,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:30,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:58:30,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:58:30,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2025-01-10 00:58:30,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-01-10 00:58:30,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:30,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2025-01-10 00:58:30,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:37,067 INFO L124 PetriNetUnfolderBase]: 58509/106530 cut-off events. [2025-01-10 00:58:37,068 INFO L125 PetriNetUnfolderBase]: For 6023/6023 co-relation queries the response was YES. [2025-01-10 00:58:37,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193672 conditions, 106530 events. 58509/106530 cut-off events. For 6023/6023 co-relation queries the response was YES. Maximal size of possible extension queue 2714. Compared 1108380 event pairs, 34056 based on Foata normal form. 24/100462 useless extension candidates. Maximal degree in co-relation 16446. Up to 80665 conditions per place. [2025-01-10 00:58:37,882 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 84 selfloop transitions, 3 changer transitions 0/152 dead transitions. [2025-01-10 00:58:37,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 152 transitions, 508 flow [2025-01-10 00:58:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:58:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:58:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-01-10 00:58:37,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415441176470589 [2025-01-10 00:58:37,884 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 256 flow. Second operand 4 states and 349 transitions. [2025-01-10 00:58:37,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 152 transitions, 508 flow [2025-01-10 00:58:37,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 152 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:37,889 INFO L231 Difference]: Finished difference. Result has 126 places, 115 transitions, 272 flow [2025-01-10 00:58:37,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=126, PETRI_TRANSITIONS=115} [2025-01-10 00:58:37,890 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2025-01-10 00:58:37,890 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 115 transitions, 272 flow [2025-01-10 00:58:37,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-01-10 00:58:37,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:37,890 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:37,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:58:37,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:37,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:37,891 INFO L85 PathProgramCache]: Analyzing trace with hash -518799531, now seen corresponding path program 1 times [2025-01-10 00:58:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:37,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378554228] [2025-01-10 00:58:37,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:37,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:37,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:37,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:37,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:37,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:37,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378554228] [2025-01-10 00:58:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378554228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:37,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58758285] [2025-01-10 00:58:37,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:37,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:37,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:37,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:37,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:38,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 136 [2025-01-10 00:58:38,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-10 00:58:38,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:38,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 136 [2025-01-10 00:58:38,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:43,918 INFO L124 PetriNetUnfolderBase]: 53493/93021 cut-off events. [2025-01-10 00:58:43,918 INFO L125 PetriNetUnfolderBase]: For 11737/11737 co-relation queries the response was YES. [2025-01-10 00:58:44,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175485 conditions, 93021 events. 53493/93021 cut-off events. For 11737/11737 co-relation queries the response was YES. Maximal size of possible extension queue 2258. Compared 899548 event pairs, 53493 based on Foata normal form. 0/91041 useless extension candidates. Maximal degree in co-relation 130155. Up to 74136 conditions per place. [2025-01-10 00:58:44,624 INFO L140 encePairwiseOnDemand]: 123/136 looper letters, 48 selfloop transitions, 1 changer transitions 0/103 dead transitions. [2025-01-10 00:58:44,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 103 transitions, 346 flow [2025-01-10 00:58:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:44,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-01-10 00:58:44,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 00:58:44,626 INFO L175 Difference]: Start difference. First operand has 126 places, 115 transitions, 272 flow. Second operand 3 states and 221 transitions. [2025-01-10 00:58:44,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 103 transitions, 346 flow [2025-01-10 00:58:44,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 103 transitions, 340 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:44,629 INFO L231 Difference]: Finished difference. Result has 114 places, 103 transitions, 244 flow [2025-01-10 00:58:44,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=114, PETRI_TRANSITIONS=103} [2025-01-10 00:58:44,630 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -7 predicate places. [2025-01-10 00:58:44,630 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 103 transitions, 244 flow [2025-01-10 00:58:44,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-10 00:58:44,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:44,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-10 00:58:44,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:58:44,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:44,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:44,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1550839349, now seen corresponding path program 1 times [2025-01-10 00:58:44,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:44,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155317927] [2025-01-10 00:58:44,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:44,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:44,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:44,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:44,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:44,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:44,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155317927] [2025-01-10 00:58:44,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155317927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:44,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:44,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:44,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343586148] [2025-01-10 00:58:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:44,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:44,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:44,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:44,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:44,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2025-01-10 00:58:44,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 103 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 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-01-10 00:58:44,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:44,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2025-01-10 00:58:44,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:50,893 INFO L124 PetriNetUnfolderBase]: 56397/99398 cut-off events. [2025-01-10 00:58:50,893 INFO L125 PetriNetUnfolderBase]: For 15466/15466 co-relation queries the response was YES. [2025-01-10 00:58:51,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188174 conditions, 99398 events. 56397/99398 cut-off events. For 15466/15466 co-relation queries the response was YES. Maximal size of possible extension queue 2549. Compared 995035 event pairs, 14540 based on Foata normal form. 288/98173 useless extension candidates. Maximal degree in co-relation 188162. Up to 71281 conditions per place. [2025-01-10 00:58:51,445 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 118 selfloop transitions, 4 changer transitions 0/175 dead transitions. [2025-01-10 00:58:51,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 175 transitions, 632 flow [2025-01-10 00:58:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:58:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:58:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2025-01-10 00:58:51,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602941176470588 [2025-01-10 00:58:51,447 INFO L175 Difference]: Start difference. First operand has 114 places, 103 transitions, 244 flow. Second operand 5 states and 449 transitions. [2025-01-10 00:58:51,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 175 transitions, 632 flow [2025-01-10 00:58:51,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 175 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:58:51,463 INFO L231 Difference]: Finished difference. Result has 118 places, 103 transitions, 257 flow [2025-01-10 00:58:51,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=118, PETRI_TRANSITIONS=103} [2025-01-10 00:58:51,464 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -3 predicate places. [2025-01-10 00:58:51,464 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 103 transitions, 257 flow [2025-01-10 00:58:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.2) internal successors, (336), 5 states have internal predecessors, (336), 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-01-10 00:58:51,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:51,465 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:58:51,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:58:51,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:51,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:51,465 INFO L85 PathProgramCache]: Analyzing trace with hash -518799530, now seen corresponding path program 1 times [2025-01-10 00:58:51,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:51,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135416536] [2025-01-10 00:58:51,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:58:51,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:58:51,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:51,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:51,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:51,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135416536] [2025-01-10 00:58:51,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135416536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:51,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016301338] [2025-01-10 00:58:51,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:51,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:51,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:51,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:51,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:51,565 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 136 [2025-01-10 00:58:51,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 103 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-10 00:58:51,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:51,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 136 [2025-01-10 00:58:51,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:56,831 INFO L124 PetriNetUnfolderBase]: 51645/86540 cut-off events. [2025-01-10 00:58:56,831 INFO L125 PetriNetUnfolderBase]: For 22037/22037 co-relation queries the response was YES. [2025-01-10 00:58:57,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170962 conditions, 86540 events. 51645/86540 cut-off events. For 22037/22037 co-relation queries the response was YES. Maximal size of possible extension queue 2070. Compared 794898 event pairs, 51645 based on Foata normal form. 0/84462 useless extension candidates. Maximal degree in co-relation 170948. Up to 71280 conditions per place. [2025-01-10 00:58:57,525 INFO L140 encePairwiseOnDemand]: 123/136 looper letters, 47 selfloop transitions, 1 changer transitions 1/91 dead transitions. [2025-01-10 00:58:57,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 91 transitions, 331 flow [2025-01-10 00:58:57,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:57,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2025-01-10 00:58:57,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-01-10 00:58:57,526 INFO L175 Difference]: Start difference. First operand has 118 places, 103 transitions, 257 flow. Second operand 3 states and 221 transitions. [2025-01-10 00:58:57,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 91 transitions, 331 flow [2025-01-10 00:58:57,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 91 transitions, 321 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:58:57,530 INFO L231 Difference]: Finished difference. Result has 105 places, 90 transitions, 223 flow [2025-01-10 00:58:57,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=105, PETRI_TRANSITIONS=90} [2025-01-10 00:58:57,531 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, -16 predicate places. [2025-01-10 00:58:57,531 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 90 transitions, 223 flow [2025-01-10 00:58:57,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-01-10 00:58:57,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:57,533 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2025-01-10 00:58:57,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:58:57,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-01-10 00:58:57,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:57,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1426714682, now seen corresponding path program 1 times [2025-01-10 00:58:57,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:57,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075761618] [2025-01-10 00:58:57,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:57,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:57,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:58:57,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:58:57,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:57,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:58:57,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:57,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075761618] [2025-01-10 00:58:57,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075761618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:57,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:57,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:58:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968000119] [2025-01-10 00:58:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:57,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:58:57,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:57,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:58:57,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:58:57,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 136 [2025-01-10 00:58:57,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 90 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-01-10 00:58:57,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:57,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 136 [2025-01-10 00:58:57,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand