./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 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/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-?-551b009-m [2025-01-10 00:53:47,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:53:47,467 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:53:47,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:53:47,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:53:47,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:53:47,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:53:47,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:53:47,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:53:47,503 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:53:47,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:53:47,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:53:47,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:53:47,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:53:47,504 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:53:47,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:53:47,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:53:47,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:53:47,506 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:47,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:47,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:47,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:53:47,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:53:47,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:53:47,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:53:47,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:53:47,508 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-01-10 00:53:47,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:53:47,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:53:47,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:53:47,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:53:47,756 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:53:47,757 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-01-10 00:53:48,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786793f09/c4568d368b3a4abfaafaba70ac28ed83/FLAG10740762b [2025-01-10 00:53:49,273 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:53:49,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/bounded_buffer.i [2025-01-10 00:53:49,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786793f09/c4568d368b3a4abfaafaba70ac28ed83/FLAG10740762b [2025-01-10 00:53:49,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/786793f09/c4568d368b3a4abfaafaba70ac28ed83 [2025-01-10 00:53:49,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:53:49,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:53:49,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:49,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:53:49,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:53:49,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:49,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5464914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49, skipping insertion in model container [2025-01-10 00:53:49,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:49,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:53:49,697 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,700 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,727 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,729 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,742 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,744 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-10 00:53:49,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:49,772 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:53:49,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:53:49,942 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:53:49,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49 WrapperNode [2025-01-10 00:53:49,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:53:49,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:49,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:53:49,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:53:49,952 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:53:49" (1/1) ... [2025-01-10 00:53:49,973 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:53:49" (1/1) ... [2025-01-10 00:53:50,008 INFO L138 Inliner]: procedures = 429, calls = 135, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2025-01-10 00:53:50,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:53:50,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:53:50,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:53:50,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:53:50,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,041 INFO L175 MemorySlicer]: Split 78 memory accesses to 6 slices as follows [2, 6, 5, 5, 58, 2]. 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, 2, 3, 3, 17, 1]. [2025-01-10 00:53:50,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,054 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,055 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,064 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:53:50,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:53:50,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:53:50,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:53:50,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (1/1) ... [2025-01-10 00:53:50,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:53:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:53:50,104 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:53:50,110 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:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure producer_routine [2025-01-10 00:53:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure producer_routine [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:53:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:53:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:53:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:53:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:53:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 00:53:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:53:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure consumer_routine [2025-01-10 00:53:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer_routine [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:53:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:53:50,130 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:53:50,300 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:53:50,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:53:51,086 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:53:51,086 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:53:51,290 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:53:51,290 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-10 00:53:51,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:51 BoogieIcfgContainer [2025-01-10 00:53:51,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:53:51,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:53:51,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:53:51,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:53:51,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:53:49" (1/3) ... [2025-01-10 00:53:51,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c2b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:51, skipping insertion in model container [2025-01-10 00:53:51,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:53:49" (2/3) ... [2025-01-10 00:53:51,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b4c2b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:53:51, skipping insertion in model container [2025-01-10 00:53:51,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:53:51" (3/3) ... [2025-01-10 00:53:51,301 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_buffer.i [2025-01-10 00:53:51,318 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:53:51,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_buffer.i that has 3 procedures, 335 locations, 1 initial locations, 13 loop locations, and 166 error locations. [2025-01-10 00:53:51,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:53:51,466 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:53:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 379 transitions, 778 flow [2025-01-10 00:53:51,728 INFO L124 PetriNetUnfolderBase]: 93/866 cut-off events. [2025-01-10 00:53:51,730 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:53:51,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 866 events. 93/866 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6332 event pairs, 0 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 454. Up to 16 conditions per place. [2025-01-10 00:53:51,745 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 379 transitions, 778 flow [2025-01-10 00:53:51,761 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 379 transitions, 778 flow [2025-01-10 00:53:51,767 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:53:51,774 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;@77e5af0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:53:51,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 251 error locations. [2025-01-10 00:53:51,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:53:51,777 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 00:53:51,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:53:51,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:53:51,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:53:51,778 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 248 more)] === [2025-01-10 00:53:51,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:53:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1397564, now seen corresponding path program 1 times [2025-01-10 00:53:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:53:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553377443] [2025-01-10 00:53:51,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:53:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:53:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:53:51,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:53:51,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:53:51,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:53:51,994 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:53:51,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:53:51,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553377443] [2025-01-10 00:53:51,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553377443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:53:51,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:53:51,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:53:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910740385] [2025-01-10 00:53:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:53:52,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:53:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:53:52,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:53:52,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:53:52,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 379 [2025-01-10 00:53:52,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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:53:52,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:53:52,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 379 [2025-01-10 00:53:52,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:00,303 INFO L124 PetriNetUnfolderBase]: 56822/130509 cut-off events. [2025-01-10 00:54:00,303 INFO L125 PetriNetUnfolderBase]: For 321/325 co-relation queries the response was YES. [2025-01-10 00:54:00,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205134 conditions, 130509 events. 56822/130509 cut-off events. For 321/325 co-relation queries the response was YES. Maximal size of possible extension queue 3336. Compared 1647192 event pairs, 37069 based on Foata normal form. 7582/91222 useless extension candidates. Maximal degree in co-relation 198330. Up to 74444 conditions per place. [2025-01-10 00:54:01,462 INFO L140 encePairwiseOnDemand]: 355/379 looper letters, 121 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-01-10 00:54:01,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 356 transitions, 978 flow [2025-01-10 00:54:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 844 transitions. [2025-01-10 00:54:01,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7423043095866315 [2025-01-10 00:54:01,489 INFO L175 Difference]: Start difference. First operand has 341 places, 379 transitions, 778 flow. Second operand 3 states and 844 transitions. [2025-01-10 00:54:01,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 356 transitions, 978 flow [2025-01-10 00:54:01,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 356 transitions, 978 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:54:01,510 INFO L231 Difference]: Finished difference. Result has 331 places, 356 transitions, 736 flow [2025-01-10 00:54:01,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=331, PETRI_TRANSITIONS=356} [2025-01-10 00:54:01,515 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -10 predicate places. [2025-01-10 00:54:01,515 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 356 transitions, 736 flow [2025-01-10 00:54:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 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:54:01,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:01,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 00:54:01,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:54:01,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 248 more)] === [2025-01-10 00:54:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1397565, now seen corresponding path program 1 times [2025-01-10 00:54:01,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:01,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800033331] [2025-01-10 00:54:01,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:01,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 00:54:01,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 00:54:01,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:01,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:01,695 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:54:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:01,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800033331] [2025-01-10 00:54:01,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800033331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:01,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:01,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:54:01,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509648069] [2025-01-10 00:54:01,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:01,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:01,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:01,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:01,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:01,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 379 [2025-01-10 00:54:01,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 356 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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:54:01,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:01,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 379 [2025-01-10 00:54:01,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:54:10,152 INFO L124 PetriNetUnfolderBase]: 56822/130498 cut-off events. [2025-01-10 00:54:10,152 INFO L125 PetriNetUnfolderBase]: For 321/325 co-relation queries the response was YES. [2025-01-10 00:54:10,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205119 conditions, 130498 events. 56822/130498 cut-off events. For 321/325 co-relation queries the response was YES. Maximal size of possible extension queue 3343. Compared 1646745 event pairs, 37069 based on Foata normal form. 7/83636 useless extension candidates. Maximal degree in co-relation 205075. Up to 74444 conditions per place. [2025-01-10 00:54:10,902 INFO L140 encePairwiseOnDemand]: 366/379 looper letters, 114 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2025-01-10 00:54:10,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 345 transitions, 946 flow [2025-01-10 00:54:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:54:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:54:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 847 transitions. [2025-01-10 00:54:10,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7449428320140721 [2025-01-10 00:54:10,906 INFO L175 Difference]: Start difference. First operand has 331 places, 356 transitions, 736 flow. Second operand 3 states and 847 transitions. [2025-01-10 00:54:10,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 345 transitions, 946 flow [2025-01-10 00:54:10,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 345 transitions, 942 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:54:10,911 INFO L231 Difference]: Finished difference. Result has 320 places, 345 transitions, 714 flow [2025-01-10 00:54:10,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=318, 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=320, PETRI_TRANSITIONS=345} [2025-01-10 00:54:10,912 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -21 predicate places. [2025-01-10 00:54:10,912 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 345 transitions, 714 flow [2025-01-10 00:54:10,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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:54:10,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:54:10,912 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:54:10,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:54:10,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [consumer_routineErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, consumer_routineErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 248 more)] === [2025-01-10 00:54:10,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:54:10,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1343155265, now seen corresponding path program 1 times [2025-01-10 00:54:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:54:10,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476677429] [2025-01-10 00:54:10,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:54:10,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:54:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:54:10,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:54:10,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:54:10,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:54:10,969 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:54:10,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:54:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476677429] [2025-01-10 00:54:10,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476677429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:54:10,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:54:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:54:10,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303763333] [2025-01-10 00:54:10,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:54:10,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:54:10,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:54:10,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:54:10,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:54:11,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 379 [2025-01-10 00:54:11,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 345 transitions, 714 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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:54:11,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:54:11,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 379 [2025-01-10 00:54:11,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand