./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-complex/bounded_buffer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d 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/pthread-complex/bounded_buffer.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 6780d9b269575eab8bb01b5a192a21fa771f6fcc4c495cab5abe1df10d7681d5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:28:03,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:28:03,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:28:03,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:28:03,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:28:03,086 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:28:03,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:28:03,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:28:03,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:28:03,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:28:03,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:28:03,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:28:03,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:28:03,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:28:03,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:28:03,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:28:03,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:28:03,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:28:03,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:28:03,089 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 -> 6780d9b269575eab8bb01b5a192a21fa771f6fcc4c495cab5abe1df10d7681d5 [2025-02-08 08:28:03,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:28:03,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:28:03,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:28:03,374 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:28:03,374 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:28:03,375 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/bounded_buffer.i [2025-02-08 08:28:04,589 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68a00b36/907b76a841534217811662f558448c2e/FLAGa1490d6d9 [2025-02-08 08:28:04,951 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:28:04,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/bounded_buffer.i [2025-02-08 08:28:04,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68a00b36/907b76a841534217811662f558448c2e/FLAGa1490d6d9 [2025-02-08 08:28:05,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d68a00b36/907b76a841534217811662f558448c2e [2025-02-08 08:28:05,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:28:05,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:28:05,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:28:05,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:28:05,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:28:05,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33690365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05, skipping insertion in model container [2025-02-08 08:28:05,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:28:05,689 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,690 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,704 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,709 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,717 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,721 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:28:05,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:28:05,735 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:28:05,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:28:05,864 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:28:05,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05 WrapperNode [2025-02-08 08:28:05,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:28:05,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:28:05,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:28:05,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:28:05,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,916 INFO L138 Inliner]: procedures = 429, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2025-02-08 08:28:05,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:28:05,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:28:05,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:28:05,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:28:05,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,944 INFO L175 MemorySlicer]: Split 78 memory accesses to 6 slices as follows [2, 2, 6, 58, 5, 5]. 74 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 26 writes are split as follows [0, 1, 2, 17, 3, 3]. [2025-02-08 08:28:05,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,956 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:28:05,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:28:05,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:28:05,963 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:28:05,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (1/1) ... [2025-02-08 08:28:05,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:28:05,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:28:05,989 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-02-08 08:28:05,999 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-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure producer_routine [2025-02-08 08:28:06,016 INFO L138 BoogieDeclarations]: Found implementation of procedure producer_routine [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:28:06,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:28:06,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure consumer_routine [2025-02-08 08:28:06,017 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer_routine [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 08:28:06,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:28:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:28:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:28:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 08:28:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 08:28:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 08:28:06,019 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:28:06,182 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:28:06,183 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:28:06,427 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631: havoc #t~ret120#1; [2025-02-08 08:28:06,427 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-1: havoc #t~mem119#1.base, #t~mem119#1.offset; [2025-02-08 08:28:06,427 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-2: ~status~6#1 := #t~ret120#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-3: assume { :end_inline_bounded_buf_put } true;assume -2147483648 <= #t~ret120#1 && #t~ret120#1 <= 2147483647; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-4: havoc bounded_buf_put_#in~bbuf#1.base, bounded_buf_put_#in~bbuf#1.offset, bounded_buf_put_#in~item#1.base, bounded_buf_put_#in~item#1.offset; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-5: havoc bounded_buf_put_#t~mem60#1, bounded_buf_put_#t~short61#1, bounded_buf_put_#t~ret62#1, bounded_buf_put_#t~mem63#1, bounded_buf_put_#t~mem64#1, bounded_buf_put_#t~mem65#1, bounded_buf_put_#t~mem66#1, bounded_buf_put_#t~post67#1, bounded_buf_put_#t~mem68#1, bounded_buf_put_#t~mem69#1, bounded_buf_put_#t~mem70#1, bounded_buf_put_#t~ret71#1, bounded_buf_put_#t~ret72#1, bounded_buf_put_#t~mem73#1, bounded_buf_put_#t~post74#1, bounded_buf_put_#t~mem76#1.base, bounded_buf_put_#t~mem76#1.offset, bounded_buf_put_#t~mem75#1, bounded_buf_put_#t~mem77#1, bounded_buf_put_#t~mem78#1, bounded_buf_put_#t~mem79#1, bounded_buf_put_#t~ret80#1, bounded_buf_put_~bbuf#1.base, bounded_buf_put_~bbuf#1.offset, bounded_buf_put_~item#1.base, bounded_buf_put_~item#1.offset, bounded_buf_put_~status~2#1, bounded_buf_put_~status1~1#1, bounded_buf_put_~status2~1#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-6: #t~ret120#1 := bounded_buf_put_#res#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1632: assume 0 != ~status~6#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1632: assume !(0 != ~status~6#1); [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-1: havoc #t~post122#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-2: ~i~1#1 := 1 + #t~post122#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1627-3: #t~post122#1 := ~i~1#1; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: assume true; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636: assume !true; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: assume false; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-1: assume !false; [2025-02-08 08:28:06,428 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1636-2: havoc #t~nondet121#1; [2025-02-08 08:28:06,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc #t~mem125#1.base, #t~mem125#1.offset; [2025-02-08 08:28:06,569 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-1: havoc #t~mem125#1.base, #t~mem125#1.offset; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-2: ~ch~1#1 := (if (#t~mem125#1.base + #t~mem125#1.offset) % 256 <= 127 then (#t~mem125#1.base + #t~mem125#1.offset) % 256 else (#t~mem125#1.base + #t~mem125#1.offset) % 256 - 256); [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-3: SUMMARY for call #t~mem125#1.base, #t~mem125#1.offset := read~$Pointer$#1(~#temp~1#1.base, ~#temp~1#1.offset, 4); srcloc: null [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-3: assume !(1 == #valid[~#temp~1#1.base]); [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654-3: assume !(4 + ~#temp~1#1.offset <= #length[~#temp~1#1.base] && 0 <= ~#temp~1#1.offset); [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc ~#temp~1#1.base, ~#temp~1#1.offset; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646-1: SUMMARY for call ULTIMATE.dealloc(~#temp~1#1.base, ~#temp~1#1.offset); srcloc: null [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-1: havoc #t~post127#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-2: ~i~2#1 := 1 + #t~post127#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647-3: #t~post127#1 := ~i~2#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: assume true; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657: assume !true; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-1: assume false; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-1: assume !false; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1657-2: havoc #t~nondet126#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649: havoc #t~ret124#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-1: havoc #t~mem123#1.base, #t~mem123#1.offset; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-2: ~status~7#1 := #t~ret124#1; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-3: assume { :end_inline_bounded_buf_get } true;assume -2147483648 <= #t~ret124#1 && #t~ret124#1 <= 2147483647; [2025-02-08 08:28:06,570 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-4: havoc bounded_buf_get_#in~bbuf#1.base, bounded_buf_get_#in~bbuf#1.offset, bounded_buf_get_#in~item#1.base, bounded_buf_get_#in~item#1.offset; [2025-02-08 08:28:06,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-5: havoc bounded_buf_get_#t~mem81#1, bounded_buf_get_#t~short82#1, bounded_buf_get_#t~ret83#1, bounded_buf_get_#t~mem84#1, bounded_buf_get_#t~mem85#1, bounded_buf_get_#t~mem86#1, bounded_buf_get_#t~post87#1, bounded_buf_get_#t~mem88#1, bounded_buf_get_#t~mem89#1, bounded_buf_get_#t~ret90#1, bounded_buf_get_#t~ret91#1, bounded_buf_get_#t~mem92#1, bounded_buf_get_#t~post93#1, bounded_buf_get_#t~ret94#1, bounded_buf_get_#t~ret95#1, bounded_buf_get_#t~mem96#1, bounded_buf_get_#t~mem97#1, bounded_buf_get_#t~mem99#1.base, bounded_buf_get_#t~mem99#1.offset, bounded_buf_get_#t~mem98#1, bounded_buf_get_#t~mem100#1.base, bounded_buf_get_#t~mem100#1.offset, bounded_buf_get_#t~mem101#1, bounded_buf_get_#t~mem102#1, bounded_buf_get_#t~mem103#1, bounded_buf_get_#t~ret104#1, bounded_buf_get_~bbuf#1.base, bounded_buf_get_~bbuf#1.offset, bounded_buf_get_~item#1.base, bounded_buf_get_~item#1.offset, bounded_buf_get_~status~3#1, bounded_buf_get_~status1~2#1, bounded_buf_get_~status2~2#1; [2025-02-08 08:28:06,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1649-6: #t~ret124#1 := bounded_buf_get_#res#1; [2025-02-08 08:28:06,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1650: assume 0 != ~status~7#1; [2025-02-08 08:28:06,571 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1650: assume !(0 != ~status~7#1); [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~#producers~0#1.base, main_~#producers~0#1.offset; [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663-1: SUMMARY for call ULTIMATE.dealloc(main_~#producers~0#1.base, main_~#producers~0#1.offset); srcloc: null [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: havoc main_~#consumers~0#1.base, main_~#consumers~0#1.offset; [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664-1: SUMMARY for call ULTIMATE.dealloc(main_~#consumers~0#1.base, main_~#consumers~0#1.offset); srcloc: null [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666: havoc main_~#buffer~0#1.base, main_~#buffer~0#1.offset; [2025-02-08 08:28:06,857 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666-1: SUMMARY for call ULTIMATE.dealloc(main_~#buffer~0#1.base, main_~#buffer~0#1.offset); srcloc: null [2025-02-08 08:28:06,858 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:28:06,858 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:28:06,970 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:28:06,970 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:28:06,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:28:06 BoogieIcfgContainer [2025-02-08 08:28:06,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:28:06,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:28:06,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:28:06,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:28:06,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:28:05" (1/3) ... [2025-02-08 08:28:06,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca063f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:28:06, skipping insertion in model container [2025-02-08 08:28:06,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:28:05" (2/3) ... [2025-02-08 08:28:06,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca063f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:28:06, skipping insertion in model container [2025-02-08 08:28:06,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:28:06" (3/3) ... [2025-02-08 08:28:06,976 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_buffer.i [2025-02-08 08:28:06,987 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:28:06,988 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_buffer.i that has 3 procedures, 332 locations, 1 initial locations, 13 loop locations, and 166 error locations. [2025-02-08 08:28:06,988 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:28:07,148 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-08 08:28:07,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 369 transitions, 758 flow [2025-02-08 08:28:07,383 INFO L124 PetriNetUnfolderBase]: 80/854 cut-off events. [2025-02-08 08:28:07,387 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-02-08 08:28:07,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 854 events. 80/854 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6054 event pairs, 0 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 447. Up to 16 conditions per place. [2025-02-08 08:28:07,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 369 transitions, 758 flow [2025-02-08 08:28:07,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 337 places, 364 transitions, 748 flow [2025-02-08 08:28:07,427 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:28:07,433 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;@25d7f015, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:28:07,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 243 error locations. [2025-02-08 08:28:07,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:28:07,439 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-08 08:28:07,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:28:07,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:07,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:28:07,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 240 more)] === [2025-02-08 08:28:07,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1359736, now seen corresponding path program 1 times [2025-02-08 08:28:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358640556] [2025-02-08 08:28:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:07,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:28:07,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:28:07,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358640556] [2025-02-08 08:28:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358640556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:07,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768296364] [2025-02-08 08:28:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:07,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:07,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:07,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:07,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 369 [2025-02-08 08:28:07,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 364 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-02-08 08:28:07,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:07,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 369 [2025-02-08 08:28:07,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:16,018 INFO L124 PetriNetUnfolderBase]: 51251/116847 cut-off events. [2025-02-08 08:28:16,018 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2025-02-08 08:28:16,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184254 conditions, 116847 events. 51251/116847 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3006. Compared 1446673 event pairs, 33747 based on Foata normal form. 5304/80436 useless extension candidates. Maximal degree in co-relation 177919. Up to 67238 conditions per place. [2025-02-08 08:28:17,016 INFO L140 encePairwiseOnDemand]: 349/369 looper letters, 111 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-02-08 08:28:17,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 345 transitions, 936 flow [2025-02-08 08:28:17,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:17,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2025-02-08 08:28:17,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7470641373080398 [2025-02-08 08:28:17,030 INFO L175 Difference]: Start difference. First operand has 337 places, 364 transitions, 748 flow. Second operand 3 states and 827 transitions. [2025-02-08 08:28:17,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 345 transitions, 936 flow [2025-02-08 08:28:17,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 345 transitions, 936 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 08:28:17,043 INFO L231 Difference]: Finished difference. Result has 327 places, 345 transitions, 714 flow [2025-02-08 08:28:17,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=327, PETRI_TRANSITIONS=345} [2025-02-08 08:28:17,048 INFO L279 CegarLoopForPetriNet]: 337 programPoint places, -10 predicate places. [2025-02-08 08:28:17,048 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 345 transitions, 714 flow [2025-02-08 08:28:17,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 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-02-08 08:28:17,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:17,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:28:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:28:17,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 240 more)] === [2025-02-08 08:28:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1359737, now seen corresponding path program 1 times [2025-02-08 08:28:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476675314] [2025-02-08 08:28:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:17,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:28:17,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:28:17,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:17,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:17,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:17,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476675314] [2025-02-08 08:28:17,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476675314] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:17,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:17,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:28:17,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095389471] [2025-02-08 08:28:17,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:17,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:28:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:17,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:28:17,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:28:17,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 369 [2025-02-08 08:28:17,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 345 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-02-08 08:28:17,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:17,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 369 [2025-02-08 08:28:17,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:25,041 INFO L124 PetriNetUnfolderBase]: 51251/116836 cut-off events. [2025-02-08 08:28:25,042 INFO L125 PetriNetUnfolderBase]: For 301/301 co-relation queries the response was YES. [2025-02-08 08:28:25,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184239 conditions, 116836 events. 51251/116836 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 3005. Compared 1446736 event pairs, 33747 based on Foata normal form. 8/75129 useless extension candidates. Maximal degree in co-relation 184207. Up to 67238 conditions per place. [2025-02-08 08:28:25,946 INFO L140 encePairwiseOnDemand]: 356/369 looper letters, 104 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2025-02-08 08:28:25,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 334 transitions, 904 flow [2025-02-08 08:28:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:28:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:28:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-02-08 08:28:25,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7533875338753387 [2025-02-08 08:28:25,948 INFO L175 Difference]: Start difference. First operand has 327 places, 345 transitions, 714 flow. Second operand 3 states and 834 transitions. [2025-02-08 08:28:25,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 334 transitions, 904 flow [2025-02-08 08:28:25,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 334 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:25,958 INFO L231 Difference]: Finished difference. Result has 316 places, 334 transitions, 692 flow [2025-02-08 08:28:25,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=316, PETRI_TRANSITIONS=334} [2025-02-08 08:28:25,960 INFO L279 CegarLoopForPetriNet]: 337 programPoint places, -21 predicate places. [2025-02-08 08:28:25,960 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 334 transitions, 692 flow [2025-02-08 08:28:25,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 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-02-08 08:28:25,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:25,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:25,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:28:25,961 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 240 more)] === [2025-02-08 08:28:25,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1938497785, now seen corresponding path program 1 times [2025-02-08 08:28:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177737456] [2025-02-08 08:28:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:25,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:26,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:26,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:26,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:26,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:26,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177737456] [2025-02-08 08:28:26,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177737456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:26,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:26,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:28:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314167289] [2025-02-08 08:28:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:26,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:28:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:26,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:28:26,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:28:27,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 369 [2025-02-08 08:28:27,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 334 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-02-08 08:28:27,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:27,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 369 [2025-02-08 08:28:27,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:28:35,421 INFO L124 PetriNetUnfolderBase]: 48812/127251 cut-off events. [2025-02-08 08:28:35,421 INFO L125 PetriNetUnfolderBase]: For 331/350 co-relation queries the response was YES. [2025-02-08 08:28:35,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193558 conditions, 127251 events. 48812/127251 cut-off events. For 331/350 co-relation queries the response was YES. Maximal size of possible extension queue 3514. Compared 1741699 event pairs, 15889 based on Foata normal form. 79/81324 useless extension candidates. Maximal degree in co-relation 193526. Up to 65554 conditions per place. [2025-02-08 08:28:36,245 INFO L140 encePairwiseOnDemand]: 354/369 looper letters, 161 selfloop transitions, 11 changer transitions 0/396 dead transitions. [2025-02-08 08:28:36,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 396 transitions, 1163 flow [2025-02-08 08:28:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:28:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:28:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1656 transitions. [2025-02-08 08:28:36,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7479674796747967 [2025-02-08 08:28:36,258 INFO L175 Difference]: Start difference. First operand has 316 places, 334 transitions, 692 flow. Second operand 6 states and 1656 transitions. [2025-02-08 08:28:36,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 396 transitions, 1163 flow [2025-02-08 08:28:36,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 396 transitions, 1159 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:28:36,272 INFO L231 Difference]: Finished difference. Result has 321 places, 339 transitions, 757 flow [2025-02-08 08:28:36,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=369, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=757, PETRI_PLACES=321, PETRI_TRANSITIONS=339} [2025-02-08 08:28:36,273 INFO L279 CegarLoopForPetriNet]: 337 programPoint places, -16 predicate places. [2025-02-08 08:28:36,273 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 339 transitions, 757 flow [2025-02-08 08:28:36,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 247.5) internal successors, (1485), 6 states have internal predecessors, (1485), 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-02-08 08:28:36,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:28:36,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:28:36,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:28:36,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 240 more)] === [2025-02-08 08:28:36,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:28:36,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1938497786, now seen corresponding path program 1 times [2025-02-08 08:28:36,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:28:36,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516360319] [2025-02-08 08:28:36,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:28:36,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:28:36,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:28:36,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:28:36,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:28:36,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:28:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:28:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:28:36,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516360319] [2025-02-08 08:28:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516360319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:28:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:28:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:28:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625589473] [2025-02-08 08:28:36,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:28:36,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:28:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:28:36,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:28:36,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:28:36,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 369 [2025-02-08 08:28:36,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 339 transitions, 757 flow. Second operand has 5 states, 5 states have (on average 239.2) internal successors, (1196), 5 states have internal predecessors, (1196), 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-02-08 08:28:36,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:28:36,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 369 [2025-02-08 08:28:36,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand