./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:45:13,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:45:13,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:45:13,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:45:13,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:45:13,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:45:13,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:45:13,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:45:13,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:45:13,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:45:13,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:45:13,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:45:13,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:45:13,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:45:13,315 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:45:13,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:45:13,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:13,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:45:13,317 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2025-02-06 12:45:13,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:45:13,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:45:13,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:45:13,505 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:45:13,506 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:45:13,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:14,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f64e098/e3028f9c09cd46cdb59e67e26842cbb8/FLAG946e90400 [2025-02-06 12:45:15,099 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:45:15,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:15,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f64e098/e3028f9c09cd46cdb59e67e26842cbb8/FLAG946e90400 [2025-02-06 12:45:15,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f64e098/e3028f9c09cd46cdb59e67e26842cbb8 [2025-02-06 12:45:15,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:45:15,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:45:15,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:15,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:45:15,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:45:15,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4535a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15, skipping insertion in model container [2025-02-06 12:45:15,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:45:15,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:15,627 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:45:15,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:15,698 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:45:15,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15 WrapperNode [2025-02-06 12:45:15,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:15,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:15,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:45:15,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:45:15,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,742 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126 [2025-02-06 12:45:15,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:15,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:45:15,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:45:15,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:45:15,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:45:15,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:45:15,773 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:45:15,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:45:15,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:45:15,774 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (1/1) ... [2025-02-06 12:45:15,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:15,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:15,804 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:45:15,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:45:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:45:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:45:15,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:45:15,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:45:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:45:15,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:45:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:45:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:45:15,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:45:15,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:45:15,834 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:45:15,926 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:45:15,928 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:45:16,193 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:45:16,193 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:45:16,410 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:45:16,410 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:45:16,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:16 BoogieIcfgContainer [2025-02-06 12:45:16,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:45:16,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:45:16,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:45:16,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:45:16,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:45:15" (1/3) ... [2025-02-06 12:45:16,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17258d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:16, skipping insertion in model container [2025-02-06 12:45:16,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:15" (2/3) ... [2025-02-06 12:45:16,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17258d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:16, skipping insertion in model container [2025-02-06 12:45:16,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:16" (3/3) ... [2025-02-06 12:45:16,417 INFO L128 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:16,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:45:16,432 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:45:16,433 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:45:16,475 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:45:16,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:45:16,517 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-02-06 12:45:16,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:16,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-06 12:45:16,521 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:45:16,523 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-02-06 12:45:16,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:45:16,536 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c8dff32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:45:16,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:45:16,540 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:45:16,540 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:45:16,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:16,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:16,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:45:16,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:16,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1229146965, now seen corresponding path program 1 times [2025-02-06 12:45:16,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:16,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234521086] [2025-02-06 12:45:16,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:16,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:16,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:45:16,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:45:16,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:16,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234521086] [2025-02-06 12:45:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234521086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375335620] [2025-02-06 12:45:16,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:16,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:16,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:16,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:16,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:16,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:16,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:16,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:16,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:17,204 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-02-06 12:45:17,205 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:45:17,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 975 events. 575/975 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4494 event pairs, 55 based on Foata normal form. 72/1044 useless extension candidates. Maximal degree in co-relation 1931. Up to 821 conditions per place. [2025-02-06 12:45:17,215 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-02-06 12:45:17,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-02-06 12:45:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 12:45:17,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 12:45:17,226 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-02-06 12:45:17,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-02-06 12:45:17,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:17,231 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-02-06 12:45:17,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-06 12:45:17,237 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-02-06 12:45:17,238 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-02-06 12:45:17,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:17,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:17,239 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:17,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:45:17,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:17,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash -12341786, now seen corresponding path program 1 times [2025-02-06 12:45:17,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:17,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788736566] [2025-02-06 12:45:17,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:17,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:45:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:45:17,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:17,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:17,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:17,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788736566] [2025-02-06 12:45:17,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788736566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:17,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:17,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395564407] [2025-02-06 12:45:17,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:17,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:17,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:17,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:17,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:17,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:45:17,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:17,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:17,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:45:17,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:17,510 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-06 12:45:17,512 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:45:17,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 957 events. 515/957 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4714 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1871. Up to 852 conditions per place. [2025-02-06 12:45:17,521 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-06 12:45:17,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-02-06 12:45:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:45:17,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-02-06 12:45:17,523 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:45:17,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-02-06 12:45:17,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:17,524 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-02-06 12:45:17,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-02-06 12:45:17,524 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-02-06 12:45:17,525 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-02-06 12:45:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:17,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:17,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:45:17,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:17,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:17,526 INFO L85 PathProgramCache]: Analyzing trace with hash -12341231, now seen corresponding path program 1 times [2025-02-06 12:45:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989590504] [2025-02-06 12:45:17,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:17,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:17,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:45:17,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:45:17,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:17,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:17,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:17,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989590504] [2025-02-06 12:45:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989590504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:17,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:45:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046591207] [2025-02-06 12:45:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:17,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:45:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:17,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:45:17,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:45:17,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:17,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:17,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:17,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:17,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:18,019 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2025-02-06 12:45:18,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:18,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 607 events. 303/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2748 event pairs, 69 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 1163. Up to 289 conditions per place. [2025-02-06 12:45:18,023 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 38 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-06 12:45:18,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 190 flow [2025-02-06 12:45:18,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:45:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:45:18,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 12:45:18,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:45:18,026 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 77 transitions. [2025-02-06 12:45:18,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 190 flow [2025-02-06 12:45:18,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:45:18,028 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow [2025-02-06 12:45:18,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-02-06 12:45:18,030 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-06 12:45:18,030 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow [2025-02-06 12:45:18,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:18,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:18,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:18,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:45:18,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:18,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -893764895, now seen corresponding path program 1 times [2025-02-06 12:45:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:18,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363331864] [2025-02-06 12:45:18,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:18,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:45:18,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:45:18,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:18,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:18,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:18,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363331864] [2025-02-06 12:45:18,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363331864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:18,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:18,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:45:18,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069290095] [2025-02-06 12:45:18,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:18,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:45:18,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:18,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:45:18,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:45:18,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:18,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:18,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:18,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:18,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:18,392 INFO L124 PetriNetUnfolderBase]: 143/287 cut-off events. [2025-02-06 12:45:18,393 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:45:18,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 287 events. 143/287 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 945 event pairs, 47 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 667. Up to 116 conditions per place. [2025-02-06 12:45:18,394 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-02-06 12:45:18,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 194 flow [2025-02-06 12:45:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:45:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:45:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-02-06 12:45:18,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-02-06 12:45:18,395 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 80 transitions. [2025-02-06 12:45:18,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 194 flow [2025-02-06 12:45:18,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 185 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:18,397 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-02-06 12:45:18,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-02-06 12:45:18,398 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-02-06 12:45:18,398 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-02-06 12:45:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:18,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:18,398 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] [2025-02-06 12:45:18,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:45:18,399 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:18,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash -473658345, now seen corresponding path program 1 times [2025-02-06 12:45:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626341574] [2025-02-06 12:45:18,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:18,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:18,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:18,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:18,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626341574] [2025-02-06 12:45:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626341574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:45:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980389234] [2025-02-06 12:45:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:45:18,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:18,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:45:18,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:45:18,903 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:18,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:18,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:18,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:18,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:19,176 INFO L124 PetriNetUnfolderBase]: 181/368 cut-off events. [2025-02-06 12:45:19,177 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2025-02-06 12:45:19,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 368 events. 181/368 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1276 event pairs, 38 based on Foata normal form. 4/370 useless extension candidates. Maximal degree in co-relation 902. Up to 184 conditions per place. [2025-02-06 12:45:19,178 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 25 selfloop transitions, 3 changer transitions 30/63 dead transitions. [2025-02-06 12:45:19,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 329 flow [2025-02-06 12:45:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:45:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 12:45:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-02-06 12:45:19,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-02-06 12:45:19,180 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 8 states and 119 transitions. [2025-02-06 12:45:19,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 329 flow [2025-02-06 12:45:19,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 63 transitions, 272 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:45:19,182 INFO L231 Difference]: Finished difference. Result has 47 places, 28 transitions, 88 flow [2025-02-06 12:45:19,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=28} [2025-02-06 12:45:19,182 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2025-02-06 12:45:19,182 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 28 transitions, 88 flow [2025-02-06 12:45:19,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:19,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:19,183 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] [2025-02-06 12:45:19,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:45:19,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2106562817, now seen corresponding path program 2 times [2025-02-06 12:45:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723604329] [2025-02-06 12:45:19,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:45:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:19,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:19,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:19,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:45:19,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:45:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723604329] [2025-02-06 12:45:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723604329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 12:45:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105477986] [2025-02-06 12:45:20,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:45:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:45:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:45:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:45:20,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:20,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 28 transitions, 88 flow. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:20,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:20,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:20,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:20,852 INFO L124 PetriNetUnfolderBase]: 126/277 cut-off events. [2025-02-06 12:45:20,853 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-02-06 12:45:20,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 277 events. 126/277 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 921 event pairs, 34 based on Foata normal form. 4/280 useless extension candidates. Maximal degree in co-relation 624. Up to 126 conditions per place. [2025-02-06 12:45:20,855 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 24 selfloop transitions, 5 changer transitions 25/59 dead transitions. [2025-02-06 12:45:20,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 285 flow [2025-02-06 12:45:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:45:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 12:45:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2025-02-06 12:45:20,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3742857142857143 [2025-02-06 12:45:20,857 INFO L175 Difference]: Start difference. First operand has 47 places, 28 transitions, 88 flow. Second operand 10 states and 131 transitions. [2025-02-06 12:45:20,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 285 flow [2025-02-06 12:45:20,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 267 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-02-06 12:45:20,858 INFO L231 Difference]: Finished difference. Result has 51 places, 28 transitions, 96 flow [2025-02-06 12:45:20,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=96, PETRI_PLACES=51, PETRI_TRANSITIONS=28} [2025-02-06 12:45:20,859 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2025-02-06 12:45:20,859 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 28 transitions, 96 flow [2025-02-06 12:45:20,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:20,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:20,859 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] [2025-02-06 12:45:20,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:45:20,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:20,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:20,862 INFO L85 PathProgramCache]: Analyzing trace with hash -430557237, now seen corresponding path program 3 times [2025-02-06 12:45:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:45:20,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044499044] [2025-02-06 12:45:20,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:45:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:45:20,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:20,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:20,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:45:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:45:20,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:45:20,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:20,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:20,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:20,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:45:20,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:45:20,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:45:20,967 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:45:20,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:45:20,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:45:20,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:45:20,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:45:20,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:45:20,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:45:20,969 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-06 12:45:21,036 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:45:21,036 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:45:21,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:45:21 BasicIcfg [2025-02-06 12:45:21,049 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:45:21,050 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:45:21,050 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:45:21,050 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:45:21,051 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:16" (3/4) ... [2025-02-06 12:45:21,052 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:45:21,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:45:21,053 INFO L158 Benchmark]: Toolchain (without parser) took 5726.74ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 125.0MB in the beginning and 173.5MB in the end (delta: -48.5MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2025-02-06 12:45:21,055 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:21,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.91ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.8MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 12:45:21,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.23ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:21,056 INFO L158 Benchmark]: Boogie Preprocessor took 29.39ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 97.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:21,056 INFO L158 Benchmark]: IcfgBuilder took 637.16ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 50.7MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 12:45:21,057 INFO L158 Benchmark]: TraceAbstraction took 4637.61ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 50.7MB in the beginning and 173.8MB in the end (delta: -123.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. [2025-02-06 12:45:21,057 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 335.5MB. Free memory was 173.8MB in the beginning and 173.5MB in the end (delta: 319.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:21,058 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.20ms. Allocated memory is still 226.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.91ms. Allocated memory is still 167.8MB. Free memory was 124.2MB in the beginning and 101.8MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.23ms. Allocated memory is still 167.8MB. Free memory was 101.8MB in the beginning and 99.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.39ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 97.0MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 637.16ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 50.7MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4637.61ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 50.7MB in the beginning and 173.8MB in the end (delta: -123.1MB). Peak memory consumption was 39.0MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 335.5MB. Free memory was 173.8MB in the beginning and 173.5MB in the end (delta: 319.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=-1, t1448=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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 5 procedures, 51 locations, 6 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: 4.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 216 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 5 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=4, InterpolantAutomatonStates: 33, 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.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-02-06 12:45:21,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:45:23,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:45:23,552 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-06 12:45:23,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:45:23,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:45:23,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:45:23,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:45:23,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:45:23,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:45:23,586 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:45:23,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:45:23,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:45:23,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:45:23,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:45:23,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:45:23,588 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:45:23,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:45:23,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:23,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:45:23,590 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b807ac1723767f46eb51e856f642cbeec29c757d6219d60986235d902b15355 [2025-02-06 12:45:23,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:45:23,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:45:23,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:45:23,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:45:23,871 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:45:23,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:25,178 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631ed3170/297df20569de4d54ac28b37635ce522b/FLAG7408a2080 [2025-02-06 12:45:25,464 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:45:25,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:25,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631ed3170/297df20569de4d54ac28b37635ce522b/FLAG7408a2080 [2025-02-06 12:45:25,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/631ed3170/297df20569de4d54ac28b37635ce522b [2025-02-06 12:45:25,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:45:25,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:45:25,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:25,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:45:25,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:45:25,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:25" (1/1) ... [2025-02-06 12:45:25,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3352b4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:25, skipping insertion in model container [2025-02-06 12:45:25,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:45:25" (1/1) ... [2025-02-06 12:45:25,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:45:26,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:26,191 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:45:26,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:45:26,260 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:45:26,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26 WrapperNode [2025-02-06 12:45:26,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:45:26,261 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:26,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:45:26,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:45:26,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,294 INFO L138 Inliner]: procedures = 175, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2025-02-06 12:45:26,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:45:26,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:45:26,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:45:26,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:45:26,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,315 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 12:45:26,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:45:26,328 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:45:26,328 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:45:26,328 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:45:26,329 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (1/1) ... [2025-02-06 12:45:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:45:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:26,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:45:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:45:26,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 12:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-06 12:45:26,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-06 12:45:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-06 12:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-06 12:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 12:45:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:45:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:45:26,392 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:45:26,524 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:45:26,525 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:45:26,794 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:45:26,795 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:45:26,975 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:45:26,975 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:45:26,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:26 BoogieIcfgContainer [2025-02-06 12:45:26,975 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:45:26,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:45:26,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:45:26,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:45:26,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:45:25" (1/3) ... [2025-02-06 12:45:26,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fc8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:26, skipping insertion in model container [2025-02-06 12:45:26,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:45:26" (2/3) ... [2025-02-06 12:45:26,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fc8c2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:45:26, skipping insertion in model container [2025-02-06 12:45:26,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:26" (3/3) ... [2025-02-06 12:45:26,985 INFO L128 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2025-02-06 12:45:26,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:45:26,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i that has 3 procedures, 34 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-06 12:45:26,998 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:45:27,047 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:45:27,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:45:27,104 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-02-06 12:45:27,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:27,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 2/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2025-02-06 12:45:27,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 78 flow [2025-02-06 12:45:27,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 72 flow [2025-02-06 12:45:27,122 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:45:27,131 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e4dc0ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:45:27,132 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 12:45:27,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:45:27,160 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-02-06 12:45:27,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:27,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:27,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:45:27,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:27,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1288313877, now seen corresponding path program 1 times [2025-02-06 12:45:27,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:27,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450825434] [2025-02-06 12:45:27,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:27,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:27,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:45:27,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:45:27,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:45:27,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:27,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:27,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:45:27,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:27,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:27,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450825434] [2025-02-06 12:45:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450825434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:27,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:27,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:27,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102134358] [2025-02-06 12:45:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:27,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:27,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:27,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:27,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:27,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:27,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:27,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:27,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:27,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:27,604 INFO L124 PetriNetUnfolderBase]: 575/975 cut-off events. [2025-02-06 12:45:27,604 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 12:45:27,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 975 events. 575/975 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4494 event pairs, 55 based on Foata normal form. 72/1044 useless extension candidates. Maximal degree in co-relation 1931. Up to 821 conditions per place. [2025-02-06 12:45:27,612 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-02-06 12:45:27,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 166 flow [2025-02-06 12:45:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-02-06 12:45:27,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-02-06 12:45:27,622 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-02-06 12:45:27,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 166 flow [2025-02-06 12:45:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:27,627 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 64 flow [2025-02-06 12:45:27,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2025-02-06 12:45:27,635 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -2 predicate places. [2025-02-06 12:45:27,635 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 64 flow [2025-02-06 12:45:27,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:27,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:27,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:27,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:45:27,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:27,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:27,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:27,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1671941224, now seen corresponding path program 1 times [2025-02-06 12:45:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629743382] [2025-02-06 12:45:27,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:27,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:27,842 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:27,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:45:27,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:45:27,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:45:27,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:27,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:27,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 12:45:27,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:27,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:27,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:27,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629743382] [2025-02-06 12:45:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629743382] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:45:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578710034] [2025-02-06 12:45:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:27,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:45:27,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:27,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:45:27,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:45:27,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-02-06 12:45:27,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:27,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:27,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-02-06 12:45:27,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:28,068 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-06 12:45:28,068 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:45:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 957 events. 515/957 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4729 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1871. Up to 852 conditions per place. [2025-02-06 12:45:28,074 INFO L140 encePairwiseOnDemand]: 33/35 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-06 12:45:28,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 106 flow [2025-02-06 12:45:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:45:28,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:45:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-06 12:45:28,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41904761904761906 [2025-02-06 12:45:28,075 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 64 flow. Second operand 3 states and 44 transitions. [2025-02-06 12:45:28,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 106 flow [2025-02-06 12:45:28,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:28,076 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2025-02-06 12:45:28,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-02-06 12:45:28,077 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -4 predicate places. [2025-02-06 12:45:28,077 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2025-02-06 12:45:28,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:28,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:28,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:28,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:45:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:28,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1671941779, now seen corresponding path program 1 times [2025-02-06 12:45:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:28,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338825704] [2025-02-06 12:45:28,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:28,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:28,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:45:28,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 12:45:28,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 12:45:28,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:28,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:28,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:45:28,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:28,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:28,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:28,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338825704] [2025-02-06 12:45:28,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338825704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:28,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:28,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:45:28,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059124364] [2025-02-06 12:45:28,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:28,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:45:28,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:28,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:45:28,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:45:28,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:28,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:28,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:28,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:28,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:28,557 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2025-02-06 12:45:28,557 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:45:28,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1169 conditions, 607 events. 303/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2748 event pairs, 69 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 1163. Up to 289 conditions per place. [2025-02-06 12:45:28,563 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 38 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-06 12:45:28,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 190 flow [2025-02-06 12:45:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:45:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 12:45:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-06 12:45:28,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55 [2025-02-06 12:45:28,565 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 4 states and 77 transitions. [2025-02-06 12:45:28,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 190 flow [2025-02-06 12:45:28,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:45:28,566 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 83 flow [2025-02-06 12:45:28,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2025-02-06 12:45:28,568 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2025-02-06 12:45:28,568 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 83 flow [2025-02-06 12:45:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:28,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:28,569 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:45:28,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:45:28,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:28,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:28,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1809056479, now seen corresponding path program 1 times [2025-02-06 12:45:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633141074] [2025-02-06 12:45:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:28,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:28,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:28,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:28,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:45:28,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:45:28,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:45:28,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:28,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:45:28,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:28,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:28,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:28,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633141074] [2025-02-06 12:45:28,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633141074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:28,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:28,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:45:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379470874] [2025-02-06 12:45:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:45:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:28,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:45:28,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:45:28,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:28,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:28,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:28,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:28,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:29,007 INFO L124 PetriNetUnfolderBase]: 143/287 cut-off events. [2025-02-06 12:45:29,008 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-06 12:45:29,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 287 events. 143/287 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 942 event pairs, 47 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 667. Up to 116 conditions per place. [2025-02-06 12:45:29,009 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 31 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-02-06 12:45:29,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 194 flow [2025-02-06 12:45:29,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:45:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:45:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-02-06 12:45:29,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2025-02-06 12:45:29,010 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 83 flow. Second operand 5 states and 80 transitions. [2025-02-06 12:45:29,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 194 flow [2025-02-06 12:45:29,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 185 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-06 12:45:29,012 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 99 flow [2025-02-06 12:45:29,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-02-06 12:45:29,012 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2025-02-06 12:45:29,012 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 99 flow [2025-02-06 12:45:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:29,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:29,012 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] [2025-02-06 12:45:29,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:45:29,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:29,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:29,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -764456615, now seen corresponding path program 1 times [2025-02-06 12:45:29,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:29,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096680953] [2025-02-06 12:45:29,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:45:29,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:29,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:29,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:45:29,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:29,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:29,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:29,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:29,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 12:45:29,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:29,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:29,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096680953] [2025-02-06 12:45:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096680953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:45:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454900557] [2025-02-06 12:45:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:45:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:29,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:45:29,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:45:29,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:29,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 99 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:29,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:29,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:29,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:29,730 INFO L124 PetriNetUnfolderBase]: 181/368 cut-off events. [2025-02-06 12:45:29,730 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-02-06 12:45:29,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 368 events. 181/368 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1319 event pairs, 35 based on Foata normal form. 4/370 useless extension candidates. Maximal degree in co-relation 902. Up to 149 conditions per place. [2025-02-06 12:45:29,732 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 33 selfloop transitions, 5 changer transitions 26/69 dead transitions. [2025-02-06 12:45:29,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 69 transitions, 353 flow [2025-02-06 12:45:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 12:45:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 12:45:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2025-02-06 12:45:29,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2025-02-06 12:45:29,733 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 99 flow. Second operand 9 states and 137 transitions. [2025-02-06 12:45:29,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 69 transitions, 353 flow [2025-02-06 12:45:29,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 296 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-06 12:45:29,740 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 105 flow [2025-02-06 12:45:29,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=105, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2025-02-06 12:45:29,740 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2025-02-06 12:45:29,740 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 105 flow [2025-02-06 12:45:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:29,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:29,741 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] [2025-02-06 12:45:29,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:45:29,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:29,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:29,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash -168324357, now seen corresponding path program 2 times [2025-02-06 12:45:29,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:29,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867839570] [2025-02-06 12:45:29,943 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:45:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:29,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:29,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:45:29,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:30,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:30,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:45:30,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:45:30,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:45:30,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:45:30,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:45:30,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:45:30,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:45:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867839570] [2025-02-06 12:45:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867839570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:45:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:45:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:45:30,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474417258] [2025-02-06 12:45:30,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:45:30,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:45:30,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:45:30,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:45:30,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:45:30,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-02-06 12:45:30,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 105 flow. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:30,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:45:30,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-02-06 12:45:30,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:45:30,472 INFO L124 PetriNetUnfolderBase]: 155/327 cut-off events. [2025-02-06 12:45:30,472 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-02-06 12:45:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 327 events. 155/327 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1157 event pairs, 45 based on Foata normal form. 4/328 useless extension candidates. Maximal degree in co-relation 793. Up to 152 conditions per place. [2025-02-06 12:45:30,473 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 28 selfloop transitions, 3 changer transitions 18/54 dead transitions. [2025-02-06 12:45:30,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 276 flow [2025-02-06 12:45:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:45:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 12:45:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 100 transitions. [2025-02-06 12:45:30,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40816326530612246 [2025-02-06 12:45:30,474 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 105 flow. Second operand 7 states and 100 transitions. [2025-02-06 12:45:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 276 flow [2025-02-06 12:45:30,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 250 flow, removed 7 selfloop flow, removed 6 redundant places. [2025-02-06 12:45:30,476 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 96 flow [2025-02-06 12:45:30,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2025-02-06 12:45:30,477 INFO L279 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2025-02-06 12:45:30,477 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 96 flow [2025-02-06 12:45:30,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:45:30,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:45:30,477 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] [2025-02-06 12:45:30,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 12:45:30,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:30,682 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-02-06 12:45:30,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:45:30,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1709884565, now seen corresponding path program 3 times [2025-02-06 12:45:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:45:30,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471781771] [2025-02-06 12:45:30,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:45:30,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:30,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:45:30,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:45:30,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:45:30,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:30,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:30,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 12:45:30,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:45:30,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:45:30,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 12:45:30,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 12:45:30,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:45:30,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:45:30,828 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-06 12:45:30,828 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:45:30,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-02-06 12:45:30,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-02-06 12:45:30,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-02-06 12:45:30,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-02-06 12:45:30,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-02-06 12:45:30,830 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-02-06 12:45:30,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:45:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:45:31,031 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2025-02-06 12:45:31,096 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 12:45:31,097 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:45:31,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:45:31 BasicIcfg [2025-02-06 12:45:31,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:45:31,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:45:31,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:45:31,104 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:45:31,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:45:26" (3/4) ... [2025-02-06 12:45:31,108 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:45:31,108 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:45:31,111 INFO L158 Benchmark]: Toolchain (without parser) took 5584.51ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.3MB in the beginning and 123.5MB in the end (delta: -32.1MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2025-02-06 12:45:31,111 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:31,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.40ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.4MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:45:31,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:31,111 INFO L158 Benchmark]: Boogie Preprocessor took 31.51ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:31,111 INFO L158 Benchmark]: IcfgBuilder took 647.71ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 56.9MB in the end (delta: 6.7MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2025-02-06 12:45:31,112 INFO L158 Benchmark]: TraceAbstraction took 4126.50ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 56.1MB in the beginning and 123.5MB in the end (delta: -67.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2025-02-06 12:45:31,112 INFO L158 Benchmark]: Witness Printer took 6.28ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 123.5MB in the end (delta: 9.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:45:31,115 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.23ms. Allocated memory is still 83.9MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.40ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 68.4MB in the end (delta: 22.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 117.4MB. Free memory was 68.4MB in the beginning and 66.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.51ms. Allocated memory is still 117.4MB. Free memory was 66.1MB in the beginning and 63.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 647.71ms. Allocated memory is still 117.4MB. Free memory was 63.5MB in the beginning and 56.9MB in the end (delta: 6.7MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4126.50ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 56.1MB in the beginning and 123.5MB in the end (delta: -67.4MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. * Witness Printer took 6.28ms. Allocated memory is still 159.4MB. Free memory was 123.5MB in the beginning and 123.5MB in the end (delta: 9.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=131071, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1447=131071, t1448=131072, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=131071, t1448=131072, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=131071, t1448=131072, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447=131071, t1448=131072, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L17] 0 __assert_fail ("0", "mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 795]: 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: 793]: 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 5 procedures, 51 locations, 6 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: 4.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 567 IncrementalHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 567 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 31, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 15 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-02-06 12:45:31,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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: UNKNOWN: Overapproximated counterexample