./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_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_11-ptr_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 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:57:45,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:57:45,135 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:57:45,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:57:45,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:57:45,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:57:45,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:57:45,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:57:45,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:57:45,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:57:45,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:57:45,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:57:45,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:57:45,156 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:45,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:45,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:57:45,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:57:45,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:57:45,157 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 -> 265daba2b5ad7b4578f16c23ab641f7a5441c3a3894a2482737cba7b750ee6df [2025-01-10 00:57:45,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:57:45,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:57:45,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:57:45,420 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:57:45,420 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:57:45,421 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_11-ptr_racing.i [2025-01-10 00:57:46,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47b40c475/c86297470d0a4a55adf393046d0f2237/FLAGcc1a1ffa1 [2025-01-10 00:57:47,025 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:57:47,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_11-ptr_racing.i [2025-01-10 00:57:47,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47b40c475/c86297470d0a4a55adf393046d0f2237/FLAGcc1a1ffa1 [2025-01-10 00:57:47,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47b40c475/c86297470d0a4a55adf393046d0f2237 [2025-01-10 00:57:47,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:57:47,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:57:47,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:47,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:57:47,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:57:47,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5a168d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47, skipping insertion in model container [2025-01-10 00:57:47,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:57:47,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:47,531 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:57:47,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:57:47,603 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:57:47,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47 WrapperNode [2025-01-10 00:57:47,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:57:47,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:47,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:57:47,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:57:47,612 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:57:47" (1/1) ... [2025-01-10 00:57:47,633 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:57:47" (1/1) ... [2025-01-10 00:57:47,648 INFO L138 Inliner]: procedures = 171, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 82 [2025-01-10 00:57:47,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:57:47,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:57:47,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:57:47,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:57:47,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,683 INFO L175 MemorySlicer]: Split 25 memory accesses to 6 slices as follows [2, 5, 5, 5, 2, 6]. 24 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 5, 5, 5, 0, 1]. The 3 writes are split as follows [0, 0, 0, 0, 1, 2]. [2025-01-10 00:57:47,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:57:47,711 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:57:47,711 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:57:47,711 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:57:47,712 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (1/1) ... [2025-01-10 00:57:47,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:57:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:57:47,743 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:57:47,746 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:57:47,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:57:47,761 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:57:47,762 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:57:47,762 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:57:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:57:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:57:47,763 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:57:47,878 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:57:47,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:57:48,106 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:57:48,106 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:57:48,257 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:57:48,257 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 00:57:48,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:48 BoogieIcfgContainer [2025-01-10 00:57:48,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:57:48,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:57:48,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:57:48,263 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:57:48,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:57:47" (1/3) ... [2025-01-10 00:57:48,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3501b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:48, skipping insertion in model container [2025-01-10 00:57:48,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:57:47" (2/3) ... [2025-01-10 00:57:48,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3501b8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:57:48, skipping insertion in model container [2025-01-10 00:57:48,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:57:48" (3/3) ... [2025-01-10 00:57:48,265 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_11-ptr_racing.i [2025-01-10 00:57:48,276 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:57:48,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_11-ptr_racing.i that has 2 procedures, 64 locations, 1 initial locations, 6 loop locations, and 16 error locations. [2025-01-10 00:57:48,278 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:57:48,327 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:57:48,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 75 transitions, 157 flow [2025-01-10 00:57:48,388 INFO L124 PetriNetUnfolderBase]: 15/109 cut-off events. [2025-01-10 00:57:48,390 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:48,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 109 events. 15/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 471 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 70. Up to 4 conditions per place. [2025-01-10 00:57:48,395 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 75 transitions, 157 flow [2025-01-10 00:57:48,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 75 transitions, 157 flow [2025-01-10 00:57:48,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:48,420 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;@3888a6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:48,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-10 00:57:48,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:48,430 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:57:48,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:48,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:48,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:57:48,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-10 00:57:48,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 365881, now seen corresponding path program 1 times [2025-01-10 00:57:48,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:48,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182231888] [2025-01-10 00:57:48,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:48,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:48,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:57:48,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:57:48,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:48,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:48,652 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:57:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182231888] [2025-01-10 00:57:48,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182231888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:48,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:48,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937922395] [2025-01-10 00:57:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:48,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:48,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:48,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 00:57:48,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:57:48,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:48,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 00:57:48,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:48,915 INFO L124 PetriNetUnfolderBase]: 181/665 cut-off events. [2025-01-10 00:57:48,915 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:57:48,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 665 events. 181/665 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3861 event pairs, 156 based on Foata normal form. 105/703 useless extension candidates. Maximal degree in co-relation 1020. Up to 353 conditions per place. [2025-01-10 00:57:48,922 INFO L140 encePairwiseOnDemand]: 61/75 looper letters, 41 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2025-01-10 00:57:48,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 241 flow [2025-01-10 00:57:48,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2025-01-10 00:57:48,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6844444444444444 [2025-01-10 00:57:48,936 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 157 flow. Second operand 3 states and 154 transitions. [2025-01-10 00:57:48,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 241 flow [2025-01-10 00:57:48,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:48,948 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 135 flow [2025-01-10 00:57:48,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-01-10 00:57:48,954 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -1 predicate places. [2025-01-10 00:57:48,955 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 135 flow [2025-01-10 00:57:48,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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:57:48,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:48,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:57:48,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:57:48,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-10 00:57:48,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash 365882, now seen corresponding path program 1 times [2025-01-10 00:57:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:48,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967677864] [2025-01-10 00:57:48,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:48,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:57:48,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:57:48,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:49,101 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:57:49,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:49,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967677864] [2025-01-10 00:57:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967677864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:49,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:49,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879308688] [2025-01-10 00:57:49,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:49,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:49,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:49,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:49,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:49,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 00:57:49,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:57:49,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:49,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 00:57:49,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:49,247 INFO L124 PetriNetUnfolderBase]: 168/586 cut-off events. [2025-01-10 00:57:49,247 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:57:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 586 events. 168/586 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3404 event pairs, 0 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 936. Up to 355 conditions per place. [2025-01-10 00:57:49,254 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 41 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-10 00:57:49,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 247 flow [2025-01-10 00:57:49,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-10 00:57:49,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-01-10 00:57:49,257 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 135 flow. Second operand 3 states and 147 transitions. [2025-01-10 00:57:49,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 247 flow [2025-01-10 00:57:49,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:49,261 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 141 flow [2025-01-10 00:57:49,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2025-01-10 00:57:49,263 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 0 predicate places. [2025-01-10 00:57:49,263 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 141 flow [2025-01-10 00:57:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:57:49,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:49,263 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:57:49,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:57:49,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-10 00:57:49,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1392064968, now seen corresponding path program 1 times [2025-01-10 00:57:49,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31335467] [2025-01-10 00:57:49,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:49,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:57:49,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:57:49,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:49,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:49,464 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:57:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:49,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31335467] [2025-01-10 00:57:49,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31335467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:49,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:49,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735393889] [2025-01-10 00:57:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:49,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:49,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:49,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 00:57:49,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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:57:49,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:49,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 00:57:49,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:49,631 INFO L124 PetriNetUnfolderBase]: 36/121 cut-off events. [2025-01-10 00:57:49,631 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:57:49,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 121 events. 36/121 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 346 event pairs, 0 based on Foata normal form. 26/139 useless extension candidates. Maximal degree in co-relation 217. Up to 75 conditions per place. [2025-01-10 00:57:49,636 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 29 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2025-01-10 00:57:49,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 170 flow [2025-01-10 00:57:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2025-01-10 00:57:49,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-01-10 00:57:49,637 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 141 flow. Second operand 4 states and 165 transitions. [2025-01-10 00:57:49,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 170 flow [2025-01-10 00:57:49,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:57:49,638 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 78 flow [2025-01-10 00:57:49,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, 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:57:49,639 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, -26 predicate places. [2025-01-10 00:57:49,639 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 78 flow [2025-01-10 00:57:49,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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:57:49,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:49,639 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 00:57:49,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:57:49,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2025-01-10 00:57:49,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:49,640 INFO L85 PathProgramCache]: Analyzing trace with hash -204340702, now seen corresponding path program 1 times [2025-01-10 00:57:49,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:49,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102563373] [2025-01-10 00:57:49,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:49,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:49,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:49,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:49,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:49,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:57:49,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:57:49,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:57:49,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:57:49,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:49,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:57:49,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:57:49,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:57:49,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2025-01-10 00:57:49,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (17 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2025-01-10 00:57:49,701 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 25 remaining) [2025-01-10 00:57:49,702 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 25 remaining) [2025-01-10 00:57:49,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 25 remaining) [2025-01-10 00:57:49,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 25 remaining) [2025-01-10 00:57:49,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 25 remaining) [2025-01-10 00:57:49,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:57:49,703 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 00:57:49,705 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:57:49,706 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:57:49,738 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:57:49,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 112 transitions, 240 flow [2025-01-10 00:57:49,752 INFO L124 PetriNetUnfolderBase]: 27/192 cut-off events. [2025-01-10 00:57:49,752 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:57:49,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 27/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 940 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 115. Up to 6 conditions per place. [2025-01-10 00:57:49,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 112 transitions, 240 flow [2025-01-10 00:57:49,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 112 transitions, 240 flow [2025-01-10 00:57:49,758 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:49,761 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;@3888a6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:49,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-01-10 00:57:49,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:49,762 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:57:49,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:49,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:49,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:57:49,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:49,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash 477097, now seen corresponding path program 1 times [2025-01-10 00:57:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:49,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256048845] [2025-01-10 00:57:49,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:49,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:57:49,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:57:49,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:49,787 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:57:49,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:49,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256048845] [2025-01-10 00:57:49,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256048845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:49,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:49,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:49,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217833637] [2025-01-10 00:57:49,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:49,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:49,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:49,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:49,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:49,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 112 [2025-01-10 00:57:49,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 112 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:57:49,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:49,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 112 [2025-01-10 00:57:49,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:50,841 INFO L124 PetriNetUnfolderBase]: 5103/11295 cut-off events. [2025-01-10 00:57:50,841 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 00:57:50,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 11295 events. 5103/11295 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 98096 event pairs, 4416 based on Foata normal form. 2239/12636 useless extension candidates. Maximal degree in co-relation 12477. Up to 7045 conditions per place. [2025-01-10 00:57:50,907 INFO L140 encePairwiseOnDemand]: 92/112 looper letters, 67 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-01-10 00:57:50,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 117 transitions, 388 flow [2025-01-10 00:57:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2025-01-10 00:57:50,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2025-01-10 00:57:50,912 INFO L175 Difference]: Start difference. First operand has 99 places, 112 transitions, 240 flow. Second operand 3 states and 243 transitions. [2025-01-10 00:57:50,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 117 transitions, 388 flow [2025-01-10 00:57:50,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 117 transitions, 388 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:50,917 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 206 flow [2025-01-10 00:57:50,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-01-10 00:57:50,918 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, -1 predicate places. [2025-01-10 00:57:50,918 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 206 flow [2025-01-10 00:57:50,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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:57:50,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:50,919 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:57:50,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:57:50,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash 477098, now seen corresponding path program 1 times [2025-01-10 00:57:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213782427] [2025-01-10 00:57:50,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:50,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:57:50,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:57:50,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:50,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:50,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:50,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:50,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213782427] [2025-01-10 00:57:50,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213782427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:50,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:50,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:50,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699449368] [2025-01-10 00:57:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:50,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:50,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:50,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:50,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:51,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-01-10 00:57:51,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:57:51,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:51,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-01-10 00:57:51,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:51,791 INFO L124 PetriNetUnfolderBase]: 4766/11141 cut-off events. [2025-01-10 00:57:51,791 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-01-10 00:57:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18979 conditions, 11141 events. 4766/11141 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 101376 event pairs, 2232 based on Foata normal form. 1/10124 useless extension candidates. Maximal degree in co-relation 16425. Up to 7553 conditions per place. [2025-01-10 00:57:51,844 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 56 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-01-10 00:57:51,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 350 flow [2025-01-10 00:57:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:57:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:57:51,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-01-10 00:57:51,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2025-01-10 00:57:51,845 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 206 flow. Second operand 3 states and 213 transitions. [2025-01-10 00:57:51,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 350 flow [2025-01-10 00:57:51,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:51,860 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 216 flow [2025-01-10 00:57:51,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2025-01-10 00:57:51,861 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 0 predicate places. [2025-01-10 00:57:51,861 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 216 flow [2025-01-10 00:57:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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:57:51,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:51,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:57:51,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:57:51,862 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:51,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1756478043, now seen corresponding path program 1 times [2025-01-10 00:57:51,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:51,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348762493] [2025-01-10 00:57:51,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:51,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:51,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:57:51,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:57:51,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:51,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:51,951 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:57:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:51,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348762493] [2025-01-10 00:57:51,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348762493] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:51,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:51,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:57:51,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821908080] [2025-01-10 00:57:51,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:51,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:51,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:51,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:51,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:51,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 112 [2025-01-10 00:57:51,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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:57:51,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:51,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 112 [2025-01-10 00:57:51,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:52,907 INFO L124 PetriNetUnfolderBase]: 4754/10554 cut-off events. [2025-01-10 00:57:52,908 INFO L125 PetriNetUnfolderBase]: For 461/461 co-relation queries the response was YES. [2025-01-10 00:57:52,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18718 conditions, 10554 events. 4754/10554 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 94236 event pairs, 0 based on Foata normal form. 13/10025 useless extension candidates. Maximal degree in co-relation 1445. Up to 7153 conditions per place. [2025-01-10 00:57:52,974 INFO L140 encePairwiseOnDemand]: 108/112 looper letters, 80 selfloop transitions, 4 changer transitions 0/133 dead transitions. [2025-01-10 00:57:52,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 133 transitions, 464 flow [2025-01-10 00:57:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2025-01-10 00:57:52,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6450892857142857 [2025-01-10 00:57:52,977 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 216 flow. Second operand 4 states and 289 transitions. [2025-01-10 00:57:52,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 133 transitions, 464 flow [2025-01-10 00:57:52,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 133 transitions, 462 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:57:52,982 INFO L231 Difference]: Finished difference. Result has 102 places, 95 transitions, 233 flow [2025-01-10 00:57:52,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=102, PETRI_TRANSITIONS=95} [2025-01-10 00:57:52,984 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 3 predicate places. [2025-01-10 00:57:52,984 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 95 transitions, 233 flow [2025-01-10 00:57:52,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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:57:52,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:52,985 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-01-10 00:57:52,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:57:52,985 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:52,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:52,985 INFO L85 PathProgramCache]: Analyzing trace with hash 379601535, now seen corresponding path program 1 times [2025-01-10 00:57:52,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:52,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409849162] [2025-01-10 00:57:52,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:52,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:52,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:57:52,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:57:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:53,120 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:57:53,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409849162] [2025-01-10 00:57:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409849162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:53,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:53,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132008753] [2025-01-10 00:57:53,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:53,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:53,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:53,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 112 [2025-01-10 00:57:53,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 95 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:53,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:53,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 112 [2025-01-10 00:57:53,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:53,816 INFO L124 PetriNetUnfolderBase]: 4766/10615 cut-off events. [2025-01-10 00:57:53,817 INFO L125 PetriNetUnfolderBase]: For 965/965 co-relation queries the response was YES. [2025-01-10 00:57:53,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19171 conditions, 10615 events. 4766/10615 cut-off events. For 965/965 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 93395 event pairs, 1340 based on Foata normal form. 169/10090 useless extension candidates. Maximal degree in co-relation 1391. Up to 5710 conditions per place. [2025-01-10 00:57:53,856 INFO L140 encePairwiseOnDemand]: 107/112 looper letters, 128 selfloop transitions, 6 changer transitions 0/182 dead transitions. [2025-01-10 00:57:53,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 182 transitions, 671 flow [2025-01-10 00:57:53,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:57:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:57:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2025-01-10 00:57:53,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6473214285714286 [2025-01-10 00:57:53,861 INFO L175 Difference]: Start difference. First operand has 102 places, 95 transitions, 233 flow. Second operand 6 states and 435 transitions. [2025-01-10 00:57:53,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 182 transitions, 671 flow [2025-01-10 00:57:53,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 182 transitions, 662 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-10 00:57:53,864 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 237 flow [2025-01-10 00:57:53,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2025-01-10 00:57:53,865 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 6 predicate places. [2025-01-10 00:57:53,865 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 237 flow [2025-01-10 00:57:53,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:53,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:53,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:53,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:57:53,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:53,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:53,865 INFO L85 PathProgramCache]: Analyzing trace with hash 425575406, now seen corresponding path program 1 times [2025-01-10 00:57:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230821012] [2025-01-10 00:57:53,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:53,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:57:53,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:57:53,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:53,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:53,892 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:57:53,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:53,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230821012] [2025-01-10 00:57:53,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230821012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:53,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:53,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:53,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308291570] [2025-01-10 00:57:53,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:53,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:57:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:53,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:57:53,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:57:53,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 112 [2025-01-10 00:57:53,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:53,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:53,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 112 [2025-01-10 00:57:53,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:54,415 INFO L124 PetriNetUnfolderBase]: 4333/9735 cut-off events. [2025-01-10 00:57:54,415 INFO L125 PetriNetUnfolderBase]: For 1407/1407 co-relation queries the response was YES. [2025-01-10 00:57:54,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18067 conditions, 9735 events. 4333/9735 cut-off events. For 1407/1407 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 85325 event pairs, 141 based on Foata normal form. 13/9213 useless extension candidates. Maximal degree in co-relation 11947. Up to 6459 conditions per place. [2025-01-10 00:57:54,451 INFO L140 encePairwiseOnDemand]: 109/112 looper letters, 79 selfloop transitions, 3 changer transitions 0/131 dead transitions. [2025-01-10 00:57:54,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 131 transitions, 471 flow [2025-01-10 00:57:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:57:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:57:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-01-10 00:57:54,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6495535714285714 [2025-01-10 00:57:54,452 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 237 flow. Second operand 4 states and 291 transitions. [2025-01-10 00:57:54,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 131 transitions, 471 flow [2025-01-10 00:57:54,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 131 transitions, 457 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 00:57:54,458 INFO L231 Difference]: Finished difference. Result has 103 places, 94 transitions, 223 flow [2025-01-10 00:57:54,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=223, PETRI_PLACES=103, PETRI_TRANSITIONS=94} [2025-01-10 00:57:54,459 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 4 predicate places. [2025-01-10 00:57:54,459 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 94 transitions, 223 flow [2025-01-10 00:57:54,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 4 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:57:54,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:54,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:54,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:57:54,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:54,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:54,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2130479305, now seen corresponding path program 1 times [2025-01-10 00:57:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356929527] [2025-01-10 00:57:54,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:54,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:54,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:57:54,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:57:54,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:54,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:54,604 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:57:54,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:54,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356929527] [2025-01-10 00:57:54,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356929527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:54,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:54,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:57:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090630702] [2025-01-10 00:57:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:57:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:54,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:57:54,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:57:54,662 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 112 [2025-01-10 00:57:54,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 94 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 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:57:54,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:54,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 112 [2025-01-10 00:57:54,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:55,345 INFO L124 PetriNetUnfolderBase]: 5459/11789 cut-off events. [2025-01-10 00:57:55,345 INFO L125 PetriNetUnfolderBase]: For 1297/1297 co-relation queries the response was YES. [2025-01-10 00:57:55,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21468 conditions, 11789 events. 5459/11789 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 99941 event pairs, 3040 based on Foata normal form. 0/11078 useless extension candidates. Maximal degree in co-relation 20798. Up to 6475 conditions per place. [2025-01-10 00:57:55,392 INFO L140 encePairwiseOnDemand]: 100/112 looper letters, 119 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-01-10 00:57:55,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 651 flow [2025-01-10 00:57:55,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:57:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:57:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 357 transitions. [2025-01-10 00:57:55,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-01-10 00:57:55,397 INFO L175 Difference]: Start difference. First operand has 103 places, 94 transitions, 223 flow. Second operand 5 states and 357 transitions. [2025-01-10 00:57:55,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 651 flow [2025-01-10 00:57:55,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 169 transitions, 641 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:57:55,399 INFO L231 Difference]: Finished difference. Result has 107 places, 99 transitions, 283 flow [2025-01-10 00:57:55,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=107, PETRI_TRANSITIONS=99} [2025-01-10 00:57:55,400 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 8 predicate places. [2025-01-10 00:57:55,400 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 99 transitions, 283 flow [2025-01-10 00:57:55,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 6 states have internal predecessors, (278), 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:57:55,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:55,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:55,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:57:55,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2130479306, now seen corresponding path program 1 times [2025-01-10 00:57:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506913669] [2025-01-10 00:57:55,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:55,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:55,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:57:55,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:57:55,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:55,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:55,546 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:57:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506913669] [2025-01-10 00:57:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506913669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:55,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:57:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576327430] [2025-01-10 00:57:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:55,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:57:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:55,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:57:55,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:57:55,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 112 [2025-01-10 00:57:55,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 99 transitions, 283 flow. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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:57:55,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:55,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 112 [2025-01-10 00:57:55,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:57:56,342 INFO L124 PetriNetUnfolderBase]: 4647/9558 cut-off events. [2025-01-10 00:57:56,342 INFO L125 PetriNetUnfolderBase]: For 2294/2294 co-relation queries the response was YES. [2025-01-10 00:57:56,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19548 conditions, 9558 events. 4647/9558 cut-off events. For 2294/2294 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 76644 event pairs, 269 based on Foata normal form. 840/10106 useless extension candidates. Maximal degree in co-relation 18954. Up to 5489 conditions per place. [2025-01-10 00:57:56,401 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 109 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-01-10 00:57:56,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 157 transitions, 653 flow [2025-01-10 00:57:56,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:57:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:57:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 399 transitions. [2025-01-10 00:57:56,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-10 00:57:56,403 INFO L175 Difference]: Start difference. First operand has 107 places, 99 transitions, 283 flow. Second operand 6 states and 399 transitions. [2025-01-10 00:57:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 157 transitions, 653 flow [2025-01-10 00:57:56,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 157 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:57:56,412 INFO L231 Difference]: Finished difference. Result has 107 places, 94 transitions, 283 flow [2025-01-10 00:57:56,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=107, PETRI_TRANSITIONS=94} [2025-01-10 00:57:56,412 INFO L279 CegarLoopForPetriNet]: 99 programPoint places, 8 predicate places. [2025-01-10 00:57:56,412 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 94 transitions, 283 flow [2025-01-10 00:57:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 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:57:56,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:56,413 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2025-01-10 00:57:56,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:57:56,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-01-10 00:57:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1117253810, now seen corresponding path program 1 times [2025-01-10 00:57:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:56,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041861063] [2025-01-10 00:57:56,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:56,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:57:56,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:57:56,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:56,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:57:56,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:57:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:57:56,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:57:56,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:56,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:57:56,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:57:56,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (25 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (24 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 33 remaining) [2025-01-10 00:57:56,446 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 33 remaining) [2025-01-10 00:57:56,447 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 33 remaining) [2025-01-10 00:57:56,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:57:56,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:57:56,448 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:57:56,451 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:57:56,475 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 00:57:56,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 149 transitions, 325 flow [2025-01-10 00:57:56,497 INFO L124 PetriNetUnfolderBase]: 42/296 cut-off events. [2025-01-10 00:57:56,498 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 00:57:56,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 296 events. 42/296 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1542 event pairs, 1 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 203. Up to 12 conditions per place. [2025-01-10 00:57:56,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 149 transitions, 325 flow [2025-01-10 00:57:56,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 149 transitions, 325 flow [2025-01-10 00:57:56,502 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:57:56,503 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;@3888a6a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:57:56,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-01-10 00:57:56,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:57:56,504 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-01-10 00:57:56,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:57:56,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:57:56,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:57:56,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-01-10 00:57:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:57:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 625054, now seen corresponding path program 1 times [2025-01-10 00:57:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:57:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395442029] [2025-01-10 00:57:56,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:57:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:57:56,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:57:56,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:57:56,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:57:56,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:57:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:57:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:57:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395442029] [2025-01-10 00:57:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395442029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:57:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:57:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:57:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489221313] [2025-01-10 00:57:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:57:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:57:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:57:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:57:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:57:56,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 149 [2025-01-10 00:57:56,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 149 transitions, 325 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:57:56,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:57:56,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 149 [2025-01-10 00:57:56,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:07,404 INFO L124 PetriNetUnfolderBase]: 104120/184334 cut-off events. [2025-01-10 00:58:07,405 INFO L125 PetriNetUnfolderBase]: For 1847/1847 co-relation queries the response was YES. [2025-01-10 00:58:07,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329846 conditions, 184334 events. 104120/184334 cut-off events. For 1847/1847 co-relation queries the response was YES. Maximal size of possible extension queue 3774. Compared 1918898 event pairs, 89797 based on Foata normal form. 41132/213601 useless extension candidates. Maximal degree in co-relation 145838. Up to 124602 conditions per place. [2025-01-10 00:58:08,657 INFO L140 encePairwiseOnDemand]: 123/149 looper letters, 93 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-01-10 00:58:08,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 160 transitions, 537 flow [2025-01-10 00:58:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2025-01-10 00:58:08,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7427293064876958 [2025-01-10 00:58:08,659 INFO L175 Difference]: Start difference. First operand has 131 places, 149 transitions, 325 flow. Second operand 3 states and 332 transitions. [2025-01-10 00:58:08,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 160 transitions, 537 flow [2025-01-10 00:58:08,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 160 transitions, 537 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:58:08,666 INFO L231 Difference]: Finished difference. Result has 130 places, 124 transitions, 279 flow [2025-01-10 00:58:08,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=130, PETRI_TRANSITIONS=124} [2025-01-10 00:58:08,667 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, -1 predicate places. [2025-01-10 00:58:08,667 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 124 transitions, 279 flow [2025-01-10 00:58:08,667 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:08,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:08,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:58:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:58:08,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-01-10 00:58:08,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:08,668 INFO L85 PathProgramCache]: Analyzing trace with hash 625055, now seen corresponding path program 1 times [2025-01-10 00:58:08,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:08,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966423271] [2025-01-10 00:58:08,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:08,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:58:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:58:08,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:08,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:08,713 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:08,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:08,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966423271] [2025-01-10 00:58:08,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966423271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:08,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:08,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:58:08,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277332945] [2025-01-10 00:58:08,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:08,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:58:08,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:08,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:58:08,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:58:08,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 149 [2025-01-10 00:58:08,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 124 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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:08,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:08,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 149 [2025-01-10 00:58:08,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:58:19,105 INFO L124 PetriNetUnfolderBase]: 97063/178093 cut-off events. [2025-01-10 00:58:19,105 INFO L125 PetriNetUnfolderBase]: For 3845/3845 co-relation queries the response was YES. [2025-01-10 00:58:19,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316541 conditions, 178093 events. 97063/178093 cut-off events. For 3845/3845 co-relation queries the response was YES. Maximal size of possible extension queue 3806. Compared 1915645 event pairs, 63133 based on Foata normal form. 1/164955 useless extension candidates. Maximal degree in co-relation 270154. Up to 134378 conditions per place. [2025-01-10 00:58:20,231 INFO L140 encePairwiseOnDemand]: 145/149 looper letters, 70 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-01-10 00:58:20,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 138 transitions, 451 flow [2025-01-10 00:58:20,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:58:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:58:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-01-10 00:58:20,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6219239373601789 [2025-01-10 00:58:20,232 INFO L175 Difference]: Start difference. First operand has 130 places, 124 transitions, 279 flow. Second operand 3 states and 278 transitions. [2025-01-10 00:58:20,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 138 transitions, 451 flow [2025-01-10 00:58:20,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 138 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:58:20,644 INFO L231 Difference]: Finished difference. Result has 131 places, 125 transitions, 289 flow [2025-01-10 00:58:20,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=289, PETRI_PLACES=131, PETRI_TRANSITIONS=125} [2025-01-10 00:58:20,645 INFO L279 CegarLoopForPetriNet]: 131 programPoint places, 0 predicate places. [2025-01-10 00:58:20,645 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 125 transitions, 289 flow [2025-01-10 00:58:20,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:58:20,645 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 00:58:20,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:58:20,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 38 more)] === [2025-01-10 00:58:20,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:58:20,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1746561879, now seen corresponding path program 1 times [2025-01-10 00:58:20,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:58:20,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521418415] [2025-01-10 00:58:20,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:58:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:58:20,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 00:58:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 00:58:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:58:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:58:20,712 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,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:58:20,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521418415] [2025-01-10 00:58:20,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521418415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:58:20,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:58:20,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:58:20,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910874996] [2025-01-10 00:58:20,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:58:20,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:58:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:58:20,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:58:20,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:58:20,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 149 [2025-01-10 00:58:20,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 125 transitions, 289 flow. Second operand has 5 states, 5 states have (on average 68.4) internal successors, (342), 5 states have internal predecessors, (342), 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,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:58:20,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 149 [2025-01-10 00:58:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand