./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00878a67c0b2e698c623fe844793121ad5ba21b21da8e946e35340a4e47d2c6c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:26:16,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:26:16,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:26:16,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:26:16,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:26:16,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:26:16,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:26:16,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:26:16,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:26:16,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:26:16,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:26:16,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:26:16,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:26:16,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:26:16,287 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:26:16,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:26:16,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:26:16,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:26:16,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:26:16,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:16,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:16,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:16,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:26:16,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00878a67c0b2e698c623fe844793121ad5ba21b21da8e946e35340a4e47d2c6c [2025-04-29 11:26:16,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:26:16,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:26:16,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:26:16,511 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:26:16,512 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:26:16,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c [2025-04-29 11:26:17,823 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1634e2e5a/bc870481f14c43bf80600a091a4b9847/FLAG84fb18a57 [2025-04-29 11:26:18,010 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:26:18,011 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c [2025-04-29 11:26:18,012 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:18,012 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:18,012 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:18,012 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:18,019 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1634e2e5a/bc870481f14c43bf80600a091a4b9847/FLAG84fb18a57 [2025-04-29 11:26:18,824 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1634e2e5a/bc870481f14c43bf80600a091a4b9847 [2025-04-29 11:26:18,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:26:18,827 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:26:18,828 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:18,828 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:26:18,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:26:18,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:18" (1/1) ... [2025-04-29 11:26:18,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db07549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:18, skipping insertion in model container [2025-04-29 11:26:18,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:18" (1/1) ... [2025-04-29 11:26:18,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:26:18,969 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:18,977 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:26:19,002 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:19,016 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:26:19,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19 WrapperNode [2025-04-29 11:26:19,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:19,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:19,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:26:19,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:26:19,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,044 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2025-04-29 11:26:19,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:19,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:26:19,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:26:19,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:26:19,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,061 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-04-29 11:26:19,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:26:19,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:26:19,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:26:19,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:26:19,072 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (1/1) ... [2025-04-29 11:26:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:19,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:19,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:26:19,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-04-29 11:26:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-29 11:26:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-29 11:26:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-29 11:26:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:26:19,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:26:19,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:26:19,124 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:26:19,194 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:26:19,196 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:26:19,374 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:26:19,374 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:26:19,446 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:26:19,447 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:26:19,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:19 BoogieIcfgContainer [2025-04-29 11:26:19,448 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:26:19,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:26:19,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:26:19,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:26:19,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:26:18" (1/3) ... [2025-04-29 11:26:19,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d073b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:19, skipping insertion in model container [2025-04-29 11:26:19,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:19" (2/3) ... [2025-04-29 11:26:19,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d073b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:19, skipping insertion in model container [2025-04-29 11:26:19,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:19" (3/3) ... [2025-04-29 11:26:19,454 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.c [2025-04-29 11:26:19,462 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:26:19,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems.c that has 5 procedures, 48 locations, 44 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-29 11:26:19,464 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:26:19,544 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-04-29 11:26:19,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 271 flow [2025-04-29 11:26:19,598 INFO L116 PetriNetUnfolderBase]: 6/59 cut-off events. [2025-04-29 11:26:19,599 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:26:19,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 59 events. 6/59 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-04-29 11:26:19,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 87 transitions, 271 flow [2025-04-29 11:26:19,605 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 58 transitions, 167 flow [2025-04-29 11:26:19,610 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:26:19,617 INFO L340 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;@5c8f510f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:26:19,617 INFO L341 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-04-29 11:26:19,621 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:26:19,621 INFO L116 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-04-29 11:26:19,621 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:26:19,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:19,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:19,622 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:19,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash 709914665, now seen corresponding path program 1 times [2025-04-29 11:26:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:19,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991617860] [2025-04-29 11:26:19,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:19,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:19,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:19,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:19,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:19,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:19,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:19,794 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991617860] [2025-04-29 11:26:19,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991617860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:19,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:19,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:19,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958381261] [2025-04-29 11:26:19,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:19,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:19,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:19,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:19,829 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-04-29 11:26:19,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:19,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:26:19,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-04-29 11:26:19,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:26:20,418 INFO L116 PetriNetUnfolderBase]: 4536/6221 cut-off events. [2025-04-29 11:26:20,418 INFO L117 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-04-29 11:26:20,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13008 conditions, 6221 events. 4536/6221 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 32318 event pairs, 3591 based on Foata normal form. 0/4554 useless extension candidates. Maximal degree in co-relation 12980. Up to 6076 conditions per place. [2025-04-29 11:26:20,467 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 44 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-04-29 11:26:20,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 249 flow [2025-04-29 11:26:20,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:20,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:26:20,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-29 11:26:20,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2025-04-29 11:26:20,481 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 167 flow. Second operand 3 states and 108 transitions. [2025-04-29 11:26:20,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 249 flow [2025-04-29 11:26:20,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 215 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:26:20,506 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 123 flow [2025-04-29 11:26:20,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-04-29 11:26:20,512 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2025-04-29 11:26:20,513 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 123 flow [2025-04-29 11:26:20,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:20,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:20,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:20,514 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:26:20,514 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:20,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 709914666, now seen corresponding path program 1 times [2025-04-29 11:26:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:20,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838000225] [2025-04-29 11:26:20,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:20,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:20,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:20,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:20,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:20,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:20,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:26:20,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838000225] [2025-04-29 11:26:20,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838000225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:20,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:20,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:20,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602218112] [2025-04-29 11:26:20,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:20,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:26:20,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:20,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:20,649 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-04-29 11:26:20,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:20,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:26:20,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-04-29 11:26:20,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:26:20,857 INFO L116 PetriNetUnfolderBase]: 1485/2124 cut-off events. [2025-04-29 11:26:20,857 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-29 11:26:20,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 2124 events. 1485/2124 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9307 event pairs, 1115 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 2395. Up to 2055 conditions per place. [2025-04-29 11:26:20,867 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 40 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-04-29 11:26:20,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 197 flow [2025-04-29 11:26:20,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:26:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-29 11:26:20,870 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3895131086142322 [2025-04-29 11:26:20,870 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 123 flow. Second operand 3 states and 104 transitions. [2025-04-29 11:26:20,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 197 flow [2025-04-29 11:26:20,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:26:20,876 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 112 flow [2025-04-29 11:26:20,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-29 11:26:20,877 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2025-04-29 11:26:20,877 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 112 flow [2025-04-29 11:26:20,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:20,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:20,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:20,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:26:20,881 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:20,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1925577217, now seen corresponding path program 1 times [2025-04-29 11:26:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:26:20,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804712654] [2025-04-29 11:26:20,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:26:20,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:26:20,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:26:20,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:20,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:20,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:26:20,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:26:20,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:26:20,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:20,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:21,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:26:21,010 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:26:21,010 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (27 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2025-04-29 11:26:21,012 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 28 remaining) [2025-04-29 11:26:21,013 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2025-04-29 11:26:21,014 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2025-04-29 11:26:21,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:26:21,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-29 11:26:21,099 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:26:21,099 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:26:21,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:26:21 BasicIcfg [2025-04-29 11:26:21,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:26:21,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:26:21,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:26:21,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:26:21,106 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:19" (3/4) ... [2025-04-29 11:26:21,107 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:26:21,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:26:21,108 INFO L158 Benchmark]: Toolchain (without parser) took 2280.85ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 113.1MB in the beginning and 165.5MB in the end (delta: -52.5MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2025-04-29 11:26:21,109 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:21,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.19ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:26:21,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.22ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:26:21,110 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:21,110 INFO L158 Benchmark]: RCFGBuilder took 376.19ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:26:21,110 INFO L158 Benchmark]: TraceAbstraction took 1654.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.9MB in the beginning and 165.6MB in the end (delta: -91.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2025-04-29 11:26:21,111 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 285.2MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 15.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:21,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.19ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 99.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.22ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 96.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 376.19ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 74.9MB in the end (delta: 20.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1654.43ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 73.9MB in the beginning and 165.6MB in the end (delta: -91.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 285.2MB. Free memory was 165.6MB in the beginning and 165.5MB in the end (delta: 15.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 63]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 63. Possible FailurePath: [L21] 0 char *v; [L65] 0 pthread_t t; [L67] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\at(arg, Pre)={0:0}, t=-5, v={0:0}] [L47] 1 pthread_t t1, t2, t3, t4, t5; [L49] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, t1=-4, v={0:0}] [L25] 2 v = malloc(sizeof(char)) [L26] 2 return 0; [L50] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, v={-3:0}] [L51] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={-3:0}] [L32] 3 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={-3:0}] [L52] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={-3:0}] [L40] 4 v[0] = 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={-3:0}] [L34] 3 return 0; [L53] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={-3:0}] [L32] 5 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={-3:0}] [L42] 4 return 0; [L54] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L32] 6 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L34] 5 return 0; [L55] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L56] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L57] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L58] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L60] 1 return 0; [L68] FCALL, JOIN 1 pthread_join(t, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={-3:0}] [L70] EXPR 0 v[0] [L70] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={-3:0}] [L70] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={-3:0}] [L70] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L19] COND FALSE 0 !(!expression) [L70] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L72] 0 return 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={-3:0}] - UnprovableResult [Line: 51]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 104 locations, 126 edges, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 91 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:26:21,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 00878a67c0b2e698c623fe844793121ad5ba21b21da8e946e35340a4e47d2c6c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:26:22,874 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:26:22,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-04-29 11:26:22,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:26:22,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:26:22,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:26:22,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:26:22,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:26:22,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:26:22,980 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:26:22,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:26:22,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:26:22,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:26:22,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:26:22,981 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:26:22,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:26:22,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:22,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:22,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:26:22,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:26:22,984 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 00878a67c0b2e698c623fe844793121ad5ba21b21da8e946e35340a4e47d2c6c [2025-04-29 11:26:23,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:26:23,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:26:23,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:26:23,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:26:23,225 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:26:23,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c [2025-04-29 11:26:24,485 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed7aad3/d1437923d7bb40d697517d68cd07ff54/FLAGbb5dd3eb2 [2025-04-29 11:26:24,635 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:26:24,635 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.c [2025-04-29 11:26:24,636 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:24,636 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:24,636 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:24,636 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:26:24,641 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed7aad3/d1437923d7bb40d697517d68cd07ff54/FLAGbb5dd3eb2 [2025-04-29 11:26:25,485 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6ed7aad3/d1437923d7bb40d697517d68cd07ff54 [2025-04-29 11:26:25,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:26:25,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:26:25,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:25,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:26:25,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:26:25,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46749db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25, skipping insertion in model container [2025-04-29 11:26:25,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:26:25,659 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:25,674 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:26:25,703 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:26:25,717 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:26:25,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25 WrapperNode [2025-04-29 11:26:25,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:26:25,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:25,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:26:25,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:26:25,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,747 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2025-04-29 11:26:25,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:26:25,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:26:25,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:26:25,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:26:25,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,773 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-04-29 11:26:25,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:26:25,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:26:25,786 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:26:25,786 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:26:25,787 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (1/1) ... [2025-04-29 11:26:25,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:26:25,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:25,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:26:25,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:26:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2025-04-29 11:26:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-29 11:26:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-29 11:26:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-29 11:26:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:26:25,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:26:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-04-29 11:26:25,829 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:26:25,905 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:26:25,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:26:26,103 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:26:26,104 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:26:26,215 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:26:26,215 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:26:26,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:26 BoogieIcfgContainer [2025-04-29 11:26:26,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:26:26,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:26:26,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:26:26,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:26:26,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:26:25" (1/3) ... [2025-04-29 11:26:26,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5346d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:26, skipping insertion in model container [2025-04-29 11:26:26,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:26:25" (2/3) ... [2025-04-29 11:26:26,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5346d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:26:26, skipping insertion in model container [2025-04-29 11:26:26,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:26" (3/3) ... [2025-04-29 11:26:26,224 INFO L128 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.c [2025-04-29 11:26:26,233 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:26:26,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG singleton_with-uninit-problems.c that has 5 procedures, 48 locations, 44 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-29 11:26:26,234 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:26:26,357 INFO L143 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2025-04-29 11:26:26,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 271 flow [2025-04-29 11:26:26,415 INFO L116 PetriNetUnfolderBase]: 6/59 cut-off events. [2025-04-29 11:26:26,418 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:26:26,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 59 events. 6/59 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 68. Up to 3 conditions per place. [2025-04-29 11:26:26,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 87 transitions, 271 flow [2025-04-29 11:26:26,427 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 58 transitions, 167 flow [2025-04-29 11:26:26,433 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:26:26,443 INFO L340 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;@2e65dc8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:26:26,444 INFO L341 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-04-29 11:26:26,451 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:26:26,453 INFO L116 PetriNetUnfolderBase]: 1/13 cut-off events. [2025-04-29 11:26:26,453 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:26:26,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:26,454 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:26,454 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:26,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 709914665, now seen corresponding path program 1 times [2025-04-29 11:26:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:26:26,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697478168] [2025-04-29 11:26:26,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:26,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:26,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:26:26,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:26,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:26:26,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:26,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2025-04-29 11:26:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:26,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:26:26,609 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:26:26,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697478168] [2025-04-29 11:26:26,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697478168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:26,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:26,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551589423] [2025-04-29 11:26:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:26,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:26:26,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:26,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:26,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-04-29 11:26:26,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:26,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:26:26,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-04-29 11:26:26,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:26:27,292 INFO L116 PetriNetUnfolderBase]: 4536/6221 cut-off events. [2025-04-29 11:26:27,292 INFO L117 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2025-04-29 11:26:27,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13008 conditions, 6221 events. 4536/6221 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 32318 event pairs, 3591 based on Foata normal form. 0/4554 useless extension candidates. Maximal degree in co-relation 12980. Up to 6076 conditions per place. [2025-04-29 11:26:27,340 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 44 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-04-29 11:26:27,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 54 transitions, 249 flow [2025-04-29 11:26:27,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:26:27,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-04-29 11:26:27,351 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4044943820224719 [2025-04-29 11:26:27,351 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 167 flow. Second operand 3 states and 108 transitions. [2025-04-29 11:26:27,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 54 transitions, 249 flow [2025-04-29 11:26:27,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 215 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-04-29 11:26:27,362 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 123 flow [2025-04-29 11:26:27,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-04-29 11:26:27,370 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2025-04-29 11:26:27,370 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 123 flow [2025-04-29 11:26:27,370 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:27,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:27,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:27,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:26:27,571 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:27,571 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:27,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:27,572 INFO L85 PathProgramCache]: Analyzing trace with hash 709914666, now seen corresponding path program 1 times [2025-04-29 11:26:27,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:26:27,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083736137] [2025-04-29 11:26:27,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:27,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:27,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:27,575 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:27,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:26:27,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:26:27,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:26:27,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:26:27,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:26:27,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:26:27,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 11:26:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:26:27,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:26:27,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-04-29 11:26:27,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083736137] [2025-04-29 11:26:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083736137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:26:27,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:26:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:26:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056759064] [2025-04-29 11:26:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:26:27,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:26:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-04-29 11:26:27,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:26:27,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:26:27,692 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 89 [2025-04-29 11:26:27,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:27,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:26:27,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 89 [2025-04-29 11:26:27,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:26:27,900 INFO L116 PetriNetUnfolderBase]: 1485/2124 cut-off events. [2025-04-29 11:26:27,900 INFO L117 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-04-29 11:26:27,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4281 conditions, 2124 events. 1485/2124 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9307 event pairs, 1115 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 2395. Up to 2055 conditions per place. [2025-04-29 11:26:27,911 INFO L140 encePairwiseOnDemand]: 82/89 looper letters, 40 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-04-29 11:26:27,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 197 flow [2025-04-29 11:26:27,912 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:26:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:26:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2025-04-29 11:26:27,913 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3895131086142322 [2025-04-29 11:26:27,913 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 123 flow. Second operand 3 states and 104 transitions. [2025-04-29 11:26:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 197 flow [2025-04-29 11:26:27,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:26:27,914 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 112 flow [2025-04-29 11:26:27,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2025-04-29 11:26:27,915 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2025-04-29 11:26:27,915 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 112 flow [2025-04-29 11:26:27,916 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-04-29 11:26:27,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:26:27,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:26:27,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:26:28,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:28,116 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-04-29 11:26:28,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:26:28,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1925577217, now seen corresponding path program 1 times [2025-04-29 11:26:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-04-29 11:26:28,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [893260248] [2025-04-29 11:26:28,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:26:28,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:28,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:26:28,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:26:28,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:26:28,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:26:28,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:26:28,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:28,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:28,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:26:28,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:26:28,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:26:28,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:26:28,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:26:28,292 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-04-29 11:26:28,292 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:26:28,293 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (27 of 28 remaining) [2025-04-29 11:26:28,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 28 remaining) [2025-04-29 11:26:28,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 28 remaining) [2025-04-29 11:26:28,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 28 remaining) [2025-04-29 11:26:28,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 28 remaining) [2025-04-29 11:26:28,296 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread0Thread1of1ForFork5Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 28 remaining) [2025-04-29 11:26:28,297 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 28 remaining) [2025-04-29 11:26:28,298 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 28 remaining) [2025-04-29 11:26:28,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:26:28,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:26:28,499 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-29 11:26:28,580 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:26:28,580 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:26:28,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:26:28 BasicIcfg [2025-04-29 11:26:28,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:26:28,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:26:28,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:26:28,589 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:26:28,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:26:26" (3/4) ... [2025-04-29 11:26:28,590 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-04-29 11:26:28,591 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:26:28,591 INFO L158 Benchmark]: Toolchain (without parser) took 3103.04ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 92.4MB in the beginning and 158.8MB in the end (delta: -66.4MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-04-29 11:26:28,592 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:28,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.27ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:26:28,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.24ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:28,593 INFO L158 Benchmark]: Boogie Preprocessor took 38.15ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:28,594 INFO L158 Benchmark]: RCFGBuilder took 429.57ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 49.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-29 11:26:28,594 INFO L158 Benchmark]: TraceAbstraction took 2370.21ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 48.5MB in the beginning and 158.8MB in the end (delta: -110.3MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2025-04-29 11:26:28,594 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 234.9MB. Free memory was 158.8MB in the beginning and 158.8MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:26:28,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 61.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.27ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.24ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 76.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.15ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 429.57ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 49.2MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2370.21ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 48.5MB in the beginning and 158.8MB in the end (delta: -110.3MB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 234.9MB. Free memory was 158.8MB in the beginning and 158.8MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 63]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 63. Possible FailurePath: [L21] 0 char *v; [L65] 0 pthread_t t; [L67] FCALL, FORK 0 pthread_create(&t, 0, thread0, 0) VAL [\at(arg, Pre)={0:0}, t=-5, v={0:0}] [L47] 1 pthread_t t1, t2, t3, t4, t5; [L49] FCALL, FORK 1 pthread_create(&t1, 0, thread1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, t1=-4, v={0:0}] [L25] 2 v = malloc(sizeof(char)) [L26] 2 return 0; [L50] FCALL, JOIN 2 pthread_join(t1, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, v={2:0}] [L51] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={2:0}] [L32] 3 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, v={2:0}] [L52] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={2:0}] [L40] 4 v[0] = 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, v={2:0}] [L34] 3 return 0; [L53] FCALL, FORK 1 pthread_create(&t4, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={2:0}] [L32] 5 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, v={2:0}] [L42] 4 return 0; [L54] FCALL, FORK 1 pthread_create(&t5, 0, thread2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L32] 6 v[0] = 'X' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L34] 5 return 0; [L55] FCALL, JOIN 3 pthread_join(t2, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L56] FCALL, JOIN 4 pthread_join(t3, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L57] FCALL, JOIN 5 pthread_join(t4, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L58] FCALL, JOIN 6 pthread_join(t5, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L60] 1 return 0; [L68] FCALL, JOIN 1 pthread_join(t, 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={2:0}] [L70] EXPR 0 v[0] [L70] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={2:0}] [L70] EXPR 0 v[0] == 'X' || v[0] == 'Y' VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, v={2:0}] [L70] CALL 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L19] COND FALSE 0 !(!expression) [L70] RET 0 __VERIFIER_assert(v[0] == 'X' || v[0] == 'Y') [L72] 0 return 0; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, t1=-4, t2=-3, t3=-2, t4=-1, t5=0, t=-5, v={2:0}] - UnprovableResult [Line: 51]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 54]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 11 procedures, 104 locations, 126 edges, 28 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 108 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-04-29 11:26:28,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample