./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_46-escape_nr.i --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/goblint-regression/04-mutex_46-escape_nr.i -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 b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:35:16,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:35:16,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-30 10:35:16,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:35:16,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:35:16,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:35:16,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:35:16,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:35:16,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:35:16,203 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:35:16,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:35:16,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:35:16,204 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:35:16,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:35:16,204 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:35:16,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-30 10:35:16,205 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:35:16,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:16,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:16,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:16,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:35:16,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:35:16,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:35:16,208 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 -> b71c523f20411078d17c9943b891d34ddfc00131917c4009fb579cdffacef23c [2025-04-30 10:35:16,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:35:16,444 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:35:16,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:35:16,447 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:35:16,448 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:35:16,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_46-escape_nr.i [2025-04-30 10:35:17,788 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1731639/0c5aad14458048e2abae8606bbc73eb2/FLAG2457ca701 [2025-04-30 10:35:18,060 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:35:18,060 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_46-escape_nr.i [2025-04-30 10:35:18,072 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1731639/0c5aad14458048e2abae8606bbc73eb2/FLAG2457ca701 [2025-04-30 10:35:18,839 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb1731639/0c5aad14458048e2abae8606bbc73eb2 [2025-04-30 10:35:18,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:35:18,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:35:18,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:18,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:35:18,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:35:18,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:18" (1/1) ... [2025-04-30 10:35:18,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c5a668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:18, skipping insertion in model container [2025-04-30 10:35:18,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:35:18" (1/1) ... [2025-04-30 10:35:18,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:35:19,107 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:35:19,112 WARN L1150 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-04-30 10:35:19,114 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:19,128 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:35:19,175 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:35:19,207 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:35:19,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19 WrapperNode [2025-04-30 10:35:19,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:35:19,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:19,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:35:19,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:35:19,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,245 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2025-04-30 10:35:19,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:35:19,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:35:19,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:35:19,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:35:19,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,262 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [5, 6]. 55 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-04-30 10:35:19,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,269 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:35:19,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:35:19,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:35:19,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:35:19,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (1/1) ... [2025-04-30 10:35:19,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:35:19,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:35:19,310 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-30 10:35:19,316 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-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:35:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:35:19,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:35:19,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:35:19,328 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:35:19,442 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:35:19,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:35:19,648 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:35:19,648 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:35:19,894 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:35:19,894 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:35:19,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:19 BoogieIcfgContainer [2025-04-30 10:35:19,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:35:19,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:35:19,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:35:19,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:35:19,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:35:18" (1/3) ... [2025-04-30 10:35:19,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ea5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:19, skipping insertion in model container [2025-04-30 10:35:19,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:35:19" (2/3) ... [2025-04-30 10:35:19,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ea5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:35:19, skipping insertion in model container [2025-04-30 10:35:19,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:19" (3/3) ... [2025-04-30 10:35:19,903 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_46-escape_nr.i [2025-04-30 10:35:19,913 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:35:19,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_46-escape_nr.i that has 2 procedures, 34 locations, 33 edges, 1 initial locations, 0 loop locations, and 11 error locations. [2025-04-30 10:35:19,915 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:35:19,951 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:35:19,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 75 flow [2025-04-30 10:35:20,000 INFO L116 PetriNetUnfolderBase]: 1/33 cut-off events. [2025-04-30 10:35:20,001 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:35:20,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 33 events. 1/33 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 66 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 1. Up to 2 conditions per place. [2025-04-30 10:35:20,005 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 75 flow [2025-04-30 10:35:20,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 32 transitions, 70 flow [2025-04-30 10:35:20,020 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:35:20,028 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;@7275fc94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:35:20,029 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-04-30 10:35:20,034 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:35:20,036 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-30 10:35:20,036 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:20,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:20,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:20,037 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-04-30 10:35:20,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:20,041 INFO L85 PathProgramCache]: Analyzing trace with hash 9808, now seen corresponding path program 1 times [2025-04-30 10:35:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:20,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581844125] [2025-04-30 10:35:20,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:20,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:20,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:20,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:20,303 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-30 10:35:20,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:20,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581844125] [2025-04-30 10:35:20,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581844125] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:20,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:20,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167405123] [2025-04-30 10:35:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:20,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:20,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:20,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:20,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 34 [2025-04-30 10:35:20,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 32 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-30 10:35:20,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:20,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 34 [2025-04-30 10:35:20,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:20,421 INFO L116 PetriNetUnfolderBase]: 31/108 cut-off events. [2025-04-30 10:35:20,421 INFO L117 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-04-30 10:35:20,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 108 events. 31/108 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 375 event pairs, 30 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 170. Up to 76 conditions per place. [2025-04-30 10:35:20,422 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 15 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-04-30 10:35:20,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 100 flow [2025-04-30 10:35:20,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:20,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-04-30 10:35:20,432 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2025-04-30 10:35:20,433 INFO L175 Difference]: Start difference. First operand has 35 places, 32 transitions, 70 flow. Second operand 3 states and 57 transitions. [2025-04-30 10:35:20,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 100 flow [2025-04-30 10:35:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:20,440 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 66 flow [2025-04-30 10:35:20,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-04-30 10:35:20,444 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-04-30 10:35:20,444 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 66 flow [2025-04-30 10:35:20,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-30 10:35:20,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:20,444 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-30 10:35:20,444 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:35:20,444 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-04-30 10:35:20,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 9809, now seen corresponding path program 1 times [2025-04-30 10:35:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:20,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024762227] [2025-04-30 10:35:20,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:20,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-30 10:35:20,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-30 10:35:20,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:20,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:20,586 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-30 10:35:20,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:20,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024762227] [2025-04-30 10:35:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024762227] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:20,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:35:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523447211] [2025-04-30 10:35:20,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:20,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:35:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:20,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:35:20,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:35:20,607 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 34 [2025-04-30 10:35:20,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-30 10:35:20,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:20,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 34 [2025-04-30 10:35:20,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:20,657 INFO L116 PetriNetUnfolderBase]: 31/99 cut-off events. [2025-04-30 10:35:20,658 INFO L117 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-04-30 10:35:20,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 99 events. 31/99 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 305 event pairs, 30 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 170. Up to 75 conditions per place. [2025-04-30 10:35:20,659 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 14 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2025-04-30 10:35:20,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 94 flow [2025-04-30 10:35:20,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:35:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:35:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-30 10:35:20,660 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2025-04-30 10:35:20,661 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 66 flow. Second operand 3 states and 59 transitions. [2025-04-30 10:35:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 94 flow [2025-04-30 10:35:20,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 26 transitions, 88 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:20,661 INFO L231 Difference]: Finished difference. Result has 29 places, 26 transitions, 60 flow [2025-04-30 10:35:20,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=29, PETRI_TRANSITIONS=26} [2025-04-30 10:35:20,662 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -6 predicate places. [2025-04-30 10:35:20,662 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 26 transitions, 60 flow [2025-04-30 10:35:20,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-30 10:35:20,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:20,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-30 10:35:20,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:35:20,662 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-04-30 10:35:20,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:20,663 INFO L85 PathProgramCache]: Analyzing trace with hash 9433171, now seen corresponding path program 1 times [2025-04-30 10:35:20,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:20,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057656195] [2025-04-30 10:35:20,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:20,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-30 10:35:20,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-30 10:35:20,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:20,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:20,810 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-30 10:35:20,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:20,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057656195] [2025-04-30 10:35:20,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057656195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:20,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:20,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:35:20,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942232755] [2025-04-30 10:35:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:20,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:35:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:20,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:35:20,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:35:20,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 34 [2025-04-30 10:35:20,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-30 10:35:20,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:20,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 34 [2025-04-30 10:35:20,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:20,901 INFO L116 PetriNetUnfolderBase]: 31/98 cut-off events. [2025-04-30 10:35:20,901 INFO L117 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-04-30 10:35:20,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 98 events. 31/98 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 304 event pairs, 30 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 170. Up to 75 conditions per place. [2025-04-30 10:35:20,903 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 10 selfloop transitions, 1 changer transitions 6/25 dead transitions. [2025-04-30 10:35:20,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 92 flow [2025-04-30 10:35:20,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:35:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:35:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-30 10:35:20,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2025-04-30 10:35:20,905 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 60 flow. Second operand 4 states and 78 transitions. [2025-04-30 10:35:20,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 92 flow [2025-04-30 10:35:20,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:35:20,906 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 41 flow [2025-04-30 10:35:20,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=41, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2025-04-30 10:35:20,908 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -6 predicate places. [2025-04-30 10:35:20,908 INFO L485 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 41 flow [2025-04-30 10:35:20,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-30 10:35:20,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:20,908 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:20,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:35:20,908 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-04-30 10:35:20,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1594574793, now seen corresponding path program 1 times [2025-04-30 10:35:20,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:20,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273535514] [2025-04-30 10:35:20,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:20,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:20,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:21,009 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-30 10:35:21,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:21,010 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273535514] [2025-04-30 10:35:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273535514] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:35:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23890176] [2025-04-30 10:35:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:21,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:21,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:21,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:21,063 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2025-04-30 10:35:21,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 41 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-30 10:35:21,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:21,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2025-04-30 10:35:21,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:21,117 INFO L116 PetriNetUnfolderBase]: 15/62 cut-off events. [2025-04-30 10:35:21,118 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:35:21,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 62 events. 15/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 185 event pairs, 0 based on Foata normal form. 6/68 useless extension candidates. Maximal degree in co-relation 103. Up to 33 conditions per place. [2025-04-30 10:35:21,118 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 14 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2025-04-30 10:35:21,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 81 flow [2025-04-30 10:35:21,119 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-04-30 10:35:21,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2025-04-30 10:35:21,119 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 41 flow. Second operand 5 states and 69 transitions. [2025-04-30 10:35:21,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 81 flow [2025-04-30 10:35:21,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 80 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:35:21,120 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 42 flow [2025-04-30 10:35:21,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2025-04-30 10:35:21,121 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -11 predicate places. [2025-04-30 10:35:21,121 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2025-04-30 10:35:21,121 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-30 10:35:21,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:35:21,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:35:21,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:35:21,121 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (and 13 more)] === [2025-04-30 10:35:21,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:35:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1594574794, now seen corresponding path program 1 times [2025-04-30 10:35:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:35:21,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242857486] [2025-04-30 10:35:21,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:35:21,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:35:21,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:35:21,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:35:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:35:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:35:21,280 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-30 10:35:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:35:21,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242857486] [2025-04-30 10:35:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242857486] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:35:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:35:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:35:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384050512] [2025-04-30 10:35:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:35:21,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:35:21,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:35:21,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:35:21,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:35:21,319 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34 [2025-04-30 10:35:21,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-30 10:35:21,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:35:21,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34 [2025-04-30 10:35:21,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:35:21,376 INFO L116 PetriNetUnfolderBase]: 15/50 cut-off events. [2025-04-30 10:35:21,376 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:35:21,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 50 events. 15/50 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 128 event pairs, 0 based on Foata normal form. 6/56 useless extension candidates. Maximal degree in co-relation 97. Up to 33 conditions per place. [2025-04-30 10:35:21,376 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 0 selfloop transitions, 0 changer transitions 20/20 dead transitions. [2025-04-30 10:35:21,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 80 flow [2025-04-30 10:35:21,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:35:21,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:35:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2025-04-30 10:35:21,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4294117647058823 [2025-04-30 10:35:21,378 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 5 states and 73 transitions. [2025-04-30 10:35:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 80 flow [2025-04-30 10:35:21,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 75 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:35:21,379 INFO L231 Difference]: Finished difference. Result has 23 places, 0 transitions, 0 flow [2025-04-30 10:35:21,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=23, PETRI_TRANSITIONS=0} [2025-04-30 10:35:21,379 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -12 predicate places. [2025-04-30 10:35:21,379 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 0 transitions, 0 flow [2025-04-30 10:35:21,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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-30 10:35:21,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 16 remaining) [2025-04-30 10:35:21,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 16 remaining) [2025-04-30 10:35:21,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (13 of 16 remaining) [2025-04-30 10:35:21,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2025-04-30 10:35:21,381 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-04-30 10:35:21,383 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-04-30 10:35:21,383 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-04-30 10:35:21,383 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2025-04-30 10:35:21,383 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 16 remaining) [2025-04-30 10:35:21,384 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 16 remaining) [2025-04-30 10:35:21,385 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:35:21,385 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:35:21,389 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:35:21,389 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:35:21,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:35:21 BasicIcfg [2025-04-30 10:35:21,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:35:21,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:35:21,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:35:21,395 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:35:21,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:35:19" (3/4) ... [2025-04-30 10:35:21,397 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:35:21,399 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:35:21,402 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 90 nodes and edges [2025-04-30 10:35:21,403 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-04-30 10:35:21,403 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-04-30 10:35:21,403 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:35:21,463 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:35:21,463 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:35:21,463 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:35:21,464 INFO L158 Benchmark]: Toolchain (without parser) took 2622.42ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 111.4MB in the beginning and 292.1MB in the end (delta: -180.7MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-04-30 10:35:21,464 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:21,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.75ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 80.5MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:35:21,465 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.12ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 78.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:21,466 INFO L158 Benchmark]: Boogie Preprocessor took 29.33ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 75.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:21,466 INFO L158 Benchmark]: RCFGBuilder took 618.43ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.1MB in the end (delta: 641.7kB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-04-30 10:35:21,467 INFO L158 Benchmark]: TraceAbstraction took 1497.89ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.3MB in the beginning and 298.4MB in the end (delta: -224.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-04-30 10:35:21,467 INFO L158 Benchmark]: Witness Printer took 68.22ms. Allocated memory is still 419.4MB. Free memory was 298.4MB in the beginning and 292.1MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:35:21,468 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.21ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.75ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 80.5MB in the end (delta: 30.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.12ms. Allocated memory is still 142.6MB. Free memory was 80.5MB in the beginning and 78.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.33ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 75.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 618.43ms. Allocated memory is still 142.6MB. Free memory was 75.7MB in the beginning and 75.1MB in the end (delta: 641.7kB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1497.89ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 74.3MB in the beginning and 298.4MB in the end (delta: -224.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 68.22ms. Allocated memory is still 419.4MB. Free memory was 298.4MB in the beginning and 292.1MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 928]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 47 locations, 47 edges, 16 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.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 55 mSDtfsCounter, 330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=0, InterpolantAutomatonStates: 20, 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.6s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:35:21,482 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 Writing output log to file Ultimate.log Result: TRUE