./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.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 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:12,104 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:12,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:48:12,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:12,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:12,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:12,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:12,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:12,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:12,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:12,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:12,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:12,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:12,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:12,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:12,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:12,193 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:12,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:12,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:48:12,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:48:12,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:12,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:12,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:12,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:12,194 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 [2025-01-10 00:48:12,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:12,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:12,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:12,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:12,471 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:12,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:13,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0060eb32/be81330c17c84ee7be03dbe73eead4a1/FLAG5df160a57 [2025-01-10 00:48:13,993 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:13,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:14,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0060eb32/be81330c17c84ee7be03dbe73eead4a1/FLAG5df160a57 [2025-01-10 00:48:14,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0060eb32/be81330c17c84ee7be03dbe73eead4a1 [2025-01-10 00:48:14,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:14,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:14,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:14,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:14,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:14,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1581076a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14, skipping insertion in model container [2025-01-10 00:48:14,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:14,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:14,528 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:14,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:14,604 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:14,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14 WrapperNode [2025-01-10 00:48:14,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:14,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:14,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:14,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:14,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,642 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160 [2025-01-10 00:48:14,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:14,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:14,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:14,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:14,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,667 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-01-10 00:48:14,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,677 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:14,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:14,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:14,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:14,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (1/1) ... [2025-01-10 00:48:14,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:14,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:14,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:48:14,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:48:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:14,735 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:48:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:48:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:48:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:14,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:14,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:14,737 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:48:14,830 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:14,832 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:15,095 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:15,095 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:15,270 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:15,270 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:15,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:15 BoogieIcfgContainer [2025-01-10 00:48:15,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:15,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:15,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:15,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:15,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:14" (1/3) ... [2025-01-10 00:48:15,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037935e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:15, skipping insertion in model container [2025-01-10 00:48:15,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:14" (2/3) ... [2025-01-10 00:48:15,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2037935e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:15, skipping insertion in model container [2025-01-10 00:48:15,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:15" (3/3) ... [2025-01-10 00:48:15,280 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:15,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:15,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:48:15,292 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:15,330 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:15,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-01-10 00:48:15,403 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-01-10 00:48:15,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:15,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-01-10 00:48:15,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-01-10 00:48:15,418 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-01-10 00:48:15,426 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:15,441 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;@50f1ee0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:15,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:48:15,448 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:15,451 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 00:48:15,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:15,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:15,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:48:15,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:15,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -229865288, now seen corresponding path program 1 times [2025-01-10 00:48:15,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:15,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320292382] [2025-01-10 00:48:15,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:15,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:15,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:48:15,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:48:15,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:15,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320292382] [2025-01-10 00:48:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320292382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:15,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:15,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:15,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330009998] [2025-01-10 00:48:15,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:15,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:15,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:15,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:15,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:15,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-01-10 00:48:15,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:15,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:15,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-01-10 00:48:15,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:16,304 INFO L124 PetriNetUnfolderBase]: 868/1545 cut-off events. [2025-01-10 00:48:16,304 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:48:16,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1545 events. 868/1545 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9938 event pairs, 108 based on Foata normal form. 90/1626 useless extension candidates. Maximal degree in co-relation 2887. Up to 1109 conditions per place. [2025-01-10 00:48:16,320 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2025-01-10 00:48:16,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 186 flow [2025-01-10 00:48:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 00:48:16,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2025-01-10 00:48:16,332 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 95 transitions. [2025-01-10 00:48:16,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 186 flow [2025-01-10 00:48:16,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:16,339 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-01-10 00:48:16,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 00:48:16,344 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-01-10 00:48:16,344 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-01-10 00:48:16,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:16,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:16,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:48:16,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -60530814, now seen corresponding path program 1 times [2025-01-10 00:48:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802788851] [2025-01-10 00:48:16,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:16,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:16,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:16,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:16,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:16,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802788851] [2025-01-10 00:48:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802788851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:16,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:16,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160073067] [2025-01-10 00:48:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:16,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:16,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:16,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-01-10 00:48:16,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:16,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:16,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-01-10 00:48:16,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:16,683 INFO L124 PetriNetUnfolderBase]: 772/1404 cut-off events. [2025-01-10 00:48:16,683 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-10 00:48:16,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1404 events. 772/1404 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9069 event pairs, 772 based on Foata normal form. 45/1407 useless extension candidates. Maximal degree in co-relation 2683. Up to 1169 conditions per place. [2025-01-10 00:48:16,694 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:48:16,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 122 flow [2025-01-10 00:48:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:16,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 00:48:16,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-01-10 00:48:16,697 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-01-10 00:48:16,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 122 flow [2025-01-10 00:48:16,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:16,699 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-01-10 00:48:16,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-10 00:48:16,699 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-01-10 00:48:16,699 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-01-10 00:48:16,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:16,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:16,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:16,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:48:16,700 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:16,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash -60529228, now seen corresponding path program 1 times [2025-01-10 00:48:16,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:16,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787493892] [2025-01-10 00:48:16,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:16,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:16,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:16,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:16,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787493892] [2025-01-10 00:48:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787493892] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:17,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510952388] [2025-01-10 00:48:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:17,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:17,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:17,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:17,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:17,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:17,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:17,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:17,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:17,365 INFO L124 PetriNetUnfolderBase]: 1635/2721 cut-off events. [2025-01-10 00:48:17,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 2721 events. 1635/2721 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16631 event pairs, 179 based on Foata normal form. 96/2794 useless extension candidates. Maximal degree in co-relation 5237. Up to 1537 conditions per place. [2025-01-10 00:48:17,380 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2025-01-10 00:48:17,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 228 flow [2025-01-10 00:48:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:48:17,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6079545454545454 [2025-01-10 00:48:17,383 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:48:17,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 228 flow [2025-01-10 00:48:17,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:17,386 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-01-10 00:48:17,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 00:48:17,387 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-01-10 00:48:17,387 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-01-10 00:48:17,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:17,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:17,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:17,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:48:17,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:17,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:17,389 INFO L85 PathProgramCache]: Analyzing trace with hash 197833068, now seen corresponding path program 1 times [2025-01-10 00:48:17,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:17,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733379667] [2025-01-10 00:48:17,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:17,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:17,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:17,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:17,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:17,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733379667] [2025-01-10 00:48:17,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733379667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:17,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:17,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137608522] [2025-01-10 00:48:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:17,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:17,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:17,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:17,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:17,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:17,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:17,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:17,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:17,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:17,924 INFO L124 PetriNetUnfolderBase]: 1027/1737 cut-off events. [2025-01-10 00:48:17,924 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-01-10 00:48:17,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 1737 events. 1027/1737 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9333 event pairs, 95 based on Foata normal form. 80/1798 useless extension candidates. Maximal degree in co-relation 3949. Up to 697 conditions per place. [2025-01-10 00:48:17,931 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2025-01-10 00:48:17,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 328 flow [2025-01-10 00:48:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 00:48:17,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-01-10 00:48:17,934 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 135 transitions. [2025-01-10 00:48:17,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 328 flow [2025-01-10 00:48:17,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:17,938 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-01-10 00:48:17,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-01-10 00:48:17,939 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-01-10 00:48:17,939 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-01-10 00:48:17,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:17,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:17,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:17,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:48:17,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:17,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1498480171, now seen corresponding path program 1 times [2025-01-10 00:48:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851284123] [2025-01-10 00:48:17,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:48:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:48:18,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:18,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851284123] [2025-01-10 00:48:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851284123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556310281] [2025-01-10 00:48:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:18,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:18,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:18,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:18,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:18,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:18,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:18,429 INFO L124 PetriNetUnfolderBase]: 575/957 cut-off events. [2025-01-10 00:48:18,429 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2025-01-10 00:48:18,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 957 events. 575/957 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4329 event pairs, 79 based on Foata normal form. 40/978 useless extension candidates. Maximal degree in co-relation 2479. Up to 308 conditions per place. [2025-01-10 00:48:18,436 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2025-01-10 00:48:18,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 335 flow [2025-01-10 00:48:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:48:18,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2025-01-10 00:48:18,440 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:48:18,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 335 flow [2025-01-10 00:48:18,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 310 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:48:18,447 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-01-10 00:48:18,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 00:48:18,448 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-01-10 00:48:18,450 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-01-10 00:48:18,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:18,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:18,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:18,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:48:18,451 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:18,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:18,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1171332555, now seen corresponding path program 1 times [2025-01-10 00:48:18,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:18,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919177376] [2025-01-10 00:48:18,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:18,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:18,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:18,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:18,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:18,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:19,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919177376] [2025-01-10 00:48:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919177376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:48:19,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500210554] [2025-01-10 00:48:19,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:48:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:19,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:48:19,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:48:19,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2025-01-10 00:48:19,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:19,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:19,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2025-01-10 00:48:19,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:19,844 INFO L124 PetriNetUnfolderBase]: 765/1383 cut-off events. [2025-01-10 00:48:19,844 INFO L125 PetriNetUnfolderBase]: For 636/656 co-relation queries the response was YES. [2025-01-10 00:48:19,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 1383 events. 765/1383 cut-off events. For 636/656 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7196 event pairs, 74 based on Foata normal form. 8/1368 useless extension candidates. Maximal degree in co-relation 3245. Up to 574 conditions per place. [2025-01-10 00:48:19,850 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 32 selfloop transitions, 4 changer transitions 26/79 dead transitions. [2025-01-10 00:48:19,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 377 flow [2025-01-10 00:48:19,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:48:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:48:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2025-01-10 00:48:19,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5198863636363636 [2025-01-10 00:48:19,851 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 8 states and 183 transitions. [2025-01-10 00:48:19,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 377 flow [2025-01-10 00:48:19,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 313 flow, removed 14 selfloop flow, removed 8 redundant places. [2025-01-10 00:48:19,858 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 141 flow [2025-01-10 00:48:19,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2025-01-10 00:48:19,858 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2025-01-10 00:48:19,859 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 141 flow [2025-01-10 00:48:19,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:19,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:19,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, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:48:19,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 737496443, now seen corresponding path program 2 times [2025-01-10 00:48:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-01-10 00:48:19,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:19,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:19,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:19,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:19,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:20,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:20,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:20,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210927888] [2025-01-10 00:48:20,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210927888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:20,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:20,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:20,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691770474] [2025-01-10 00:48:20,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:20,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:48:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:20,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:48:20,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:48:20,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2025-01-10 00:48:20,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:20,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:20,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2025-01-10 00:48:20,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:20,833 INFO L124 PetriNetUnfolderBase]: 755/1419 cut-off events. [2025-01-10 00:48:20,834 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2025-01-10 00:48:20,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 1419 events. 755/1419 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7781 event pairs, 206 based on Foata normal form. 8/1391 useless extension candidates. Maximal degree in co-relation 3184. Up to 464 conditions per place. [2025-01-10 00:48:20,838 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 28 selfloop transitions, 3 changer transitions 20/68 dead transitions. [2025-01-10 00:48:20,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 309 flow [2025-01-10 00:48:20,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:20,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-01-10 00:48:20,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-01-10 00:48:20,839 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 141 flow. Second operand 6 states and 140 transitions. [2025-01-10 00:48:20,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 309 flow [2025-01-10 00:48:20,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 299 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:20,841 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 138 flow [2025-01-10 00:48:20,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-01-10 00:48:20,841 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-01-10 00:48:20,841 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 138 flow [2025-01-10 00:48:20,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:20,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:20,842 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:20,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:48:20,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:20,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:20,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1004381767, now seen corresponding path program 3 times [2025-01-10 00:48:20,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:20,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683606675] [2025-01-10 00:48:20,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:48:20,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:20,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:20,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:20,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:48:20,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683606675] [2025-01-10 00:48:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683606675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:48:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509978947] [2025-01-10 00:48:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:21,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:48:21,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:48:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:48:21,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-01-10 00:48:21,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:21,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:21,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-01-10 00:48:21,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:22,115 INFO L124 PetriNetUnfolderBase]: 536/1031 cut-off events. [2025-01-10 00:48:22,115 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-10 00:48:22,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 1031 events. 536/1031 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5420 event pairs, 124 based on Foata normal form. 8/981 useless extension candidates. Maximal degree in co-relation 2186. Up to 489 conditions per place. [2025-01-10 00:48:22,120 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 27 selfloop transitions, 6 changer transitions 12/64 dead transitions. [2025-01-10 00:48:22,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 286 flow [2025-01-10 00:48:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:22,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-01-10 00:48:22,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-01-10 00:48:22,122 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 138 flow. Second operand 7 states and 165 transitions. [2025-01-10 00:48:22,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 286 flow [2025-01-10 00:48:22,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 264 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-01-10 00:48:22,125 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 153 flow [2025-01-10 00:48:22,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2025-01-10 00:48:22,125 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2025-01-10 00:48:22,127 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 153 flow [2025-01-10 00:48:22,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.0) internal successors, (171), 9 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:22,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:22,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:22,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:48:22,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:22,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1658942745, now seen corresponding path program 4 times [2025-01-10 00:48:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093650300] [2025-01-10 00:48:22,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:48:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:22,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:48:22,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:22,214 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:48:22,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:22,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:22,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:22,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:22,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:22,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:22,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:48:22,422 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:22,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:48:22,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:48:22,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:48:22,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:48:22,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:48:22,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:48:22,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:48:22,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:48:22,432 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-01-10 00:48:22,586 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:22,587 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:22,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:22 BasicIcfg [2025-01-10 00:48:22,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:22,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:22,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:22,603 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:22,604 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:15" (3/4) ... [2025-01-10 00:48:22,605 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:22,606 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:22,612 INFO L158 Benchmark]: Toolchain (without parser) took 8360.94ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 110.8MB in the beginning and 389.8MB in the end (delta: -279.0MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-01-10 00:48:22,612 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:22,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.22ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 86.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:22,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.14ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:22,613 INFO L158 Benchmark]: Boogie Preprocessor took 35.52ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 80.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:22,613 INFO L158 Benchmark]: RCFGBuilder took 591.73ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 89.0MB in the end (delta: -8.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:22,613 INFO L158 Benchmark]: TraceAbstraction took 7325.64ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 88.2MB in the beginning and 389.9MB in the end (delta: -301.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-01-10 00:48:22,614 INFO L158 Benchmark]: Witness Printer took 6.99ms. Allocated memory is still 469.8MB. Free memory was 389.9MB in the beginning and 389.8MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:22,620 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.15ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.22ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 86.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.14ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.52ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 80.1MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 591.73ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 89.0MB in the end (delta: -8.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7325.64ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 88.2MB in the beginning and 389.9MB in the end (delta: -301.6MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 6.99ms. Allocated memory is still 469.8MB. Free memory was 389.9MB in the beginning and 389.8MB in the end (delta: 50.8kB). 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=-1, t1688=0, t1689=1, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L866] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 838]: 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 7 procedures, 68 locations, 7 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: 7.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 373 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 828 IncrementalHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2 mSDtfsCounter, 828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=5, InterpolantAutomatonStates: 42, 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.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-01-10 00:48:22,651 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/rfi006_pso.oepc_pso.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 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:24,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:24,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-01-10 00:48:24,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:24,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:24,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:24,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:24,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:24,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:24,781 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:24,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:24,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:24,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:48:24,782 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:24,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:24,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:24,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:48:24,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:24,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:24,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:24,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:24,784 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 -> 596bf38d5c1bddbb7fa933c2910678824d7396d44da5246db401a53a5b4ba843 [2025-01-10 00:48:25,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:25,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:25,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:25,065 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:25,066 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:25,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:26,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f5ada226/14dd59ad8b6b457a929a9891e3279ac9/FLAGa36dde44f [2025-01-10 00:48:26,544 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:26,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:26,562 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f5ada226/14dd59ad8b6b457a929a9891e3279ac9/FLAGa36dde44f [2025-01-10 00:48:26,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f5ada226/14dd59ad8b6b457a929a9891e3279ac9 [2025-01-10 00:48:26,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:26,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:26,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:26,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:26,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:26,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:26,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f5644c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26, skipping insertion in model container [2025-01-10 00:48:26,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:26,613 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:26,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:26,872 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:26,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:26,958 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:26,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26 WrapperNode [2025-01-10 00:48:26,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:26,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:26,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:26,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:26,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:26,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:26,993 INFO L138 Inliner]: procedures = 176, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161 [2025-01-10 00:48:26,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:26,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:26,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:26,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:27,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,007 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,024 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-01-10 00:48:27,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,035 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:27,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:27,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:27,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:27,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (1/1) ... [2025-01-10 00:48:27,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:27,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:27,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:48:27,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-01-10 00:48:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:27,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:27,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:27,087 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:48:27,200 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:27,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:27,414 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:27,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:27,581 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:27,581 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:27,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:27 BoogieIcfgContainer [2025-01-10 00:48:27,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:27,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:27,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:27,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:26" (1/3) ... [2025-01-10 00:48:27,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d99ab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:27, skipping insertion in model container [2025-01-10 00:48:27,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:26" (2/3) ... [2025-01-10 00:48:27,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d99ab2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:27, skipping insertion in model container [2025-01-10 00:48:27,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:27" (3/3) ... [2025-01-10 00:48:27,588 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2025-01-10 00:48:27,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:27,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.i that has 4 procedures, 43 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:48:27,599 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:27,653 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:27,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 44 transitions, 100 flow [2025-01-10 00:48:27,722 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2025-01-10 00:48:27,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:27,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2025-01-10 00:48:27,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 44 transitions, 100 flow [2025-01-10 00:48:27,729 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 91 flow [2025-01-10 00:48:27,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:27,745 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;@3142d54b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:27,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-10 00:48:27,750 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:27,752 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 00:48:27,752 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:27,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:27,752 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:48:27,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:27,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash -170698376, now seen corresponding path program 1 times [2025-01-10 00:48:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [458198692] [2025-01-10 00:48:27,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:27,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:27,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:27,768 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-01-10 00:48:27,770 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-01-10 00:48:27,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:48:27,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:48:27,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:27,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:27,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:48:27,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:27,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:27,888 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:27,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458198692] [2025-01-10 00:48:27,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458198692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:27,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:27,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:27,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460116407] [2025-01-10 00:48:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:27,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:27,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:27,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:27,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 44 [2025-01-10 00:48:27,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:27,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:27,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 44 [2025-01-10 00:48:27,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:28,530 INFO L124 PetriNetUnfolderBase]: 868/1545 cut-off events. [2025-01-10 00:48:28,530 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-10 00:48:28,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1545 events. 868/1545 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9938 event pairs, 108 based on Foata normal form. 90/1626 useless extension candidates. Maximal degree in co-relation 2887. Up to 1109 conditions per place. [2025-01-10 00:48:28,539 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 32 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2025-01-10 00:48:28,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 186 flow [2025-01-10 00:48:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:28,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-01-10 00:48:28,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7196969696969697 [2025-01-10 00:48:28,548 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 91 flow. Second operand 3 states and 95 transitions. [2025-01-10 00:48:28,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 186 flow [2025-01-10 00:48:28,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:28,552 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 82 flow [2025-01-10 00:48:28,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-01-10 00:48:28,556 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2025-01-10 00:48:28,556 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 82 flow [2025-01-10 00:48:28,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:28,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:28,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:28,563 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-01-10 00:48:28,760 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-01-10 00:48:28,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:28,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:28,762 INFO L85 PathProgramCache]: Analyzing trace with hash -667228732, now seen corresponding path program 1 times [2025-01-10 00:48:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:28,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1012549418] [2025-01-10 00:48:28,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:28,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:28,766 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-01-10 00:48:28,767 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-01-10 00:48:28,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:28,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:28,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:28,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:48:28,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:28,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:28,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012549418] [2025-01-10 00:48:28,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012549418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:28,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:28,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:28,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072148214] [2025-01-10 00:48:28,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:28,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:28,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:28,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:28,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:28,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 44 [2025-01-10 00:48:28,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:28,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:28,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 44 [2025-01-10 00:48:28,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:29,046 INFO L124 PetriNetUnfolderBase]: 772/1404 cut-off events. [2025-01-10 00:48:29,046 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-01-10 00:48:29,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 1404 events. 772/1404 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9069 event pairs, 772 based on Foata normal form. 45/1407 useless extension candidates. Maximal degree in co-relation 2683. Up to 1169 conditions per place. [2025-01-10 00:48:29,054 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 19 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2025-01-10 00:48:29,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 35 transitions, 122 flow [2025-01-10 00:48:29,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-01-10 00:48:29,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.553030303030303 [2025-01-10 00:48:29,055 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 82 flow. Second operand 3 states and 73 transitions. [2025-01-10 00:48:29,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 35 transitions, 122 flow [2025-01-10 00:48:29,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:29,056 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2025-01-10 00:48:29,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2025-01-10 00:48:29,057 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2025-01-10 00:48:29,057 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2025-01-10 00:48:29,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:29,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:29,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:29,064 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-01-10 00:48:29,257 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-01-10 00:48:29,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:29,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:29,258 INFO L85 PathProgramCache]: Analyzing trace with hash -667227146, now seen corresponding path program 1 times [2025-01-10 00:48:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1302492044] [2025-01-10 00:48:29,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:29,261 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-01-10 00:48:29,262 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-01-10 00:48:29,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 00:48:29,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 00:48:29,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:29,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:29,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:48:29,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:29,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:29,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:29,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:29,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302492044] [2025-01-10 00:48:29,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302492044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:29,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:29,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578463324] [2025-01-10 00:48:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:29,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:29,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:29,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:29,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:29,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:29,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:29,696 INFO L124 PetriNetUnfolderBase]: 1635/2721 cut-off events. [2025-01-10 00:48:29,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:29,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 2721 events. 1635/2721 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16599 event pairs, 179 based on Foata normal form. 96/2794 useless extension candidates. Maximal degree in co-relation 5237. Up to 1537 conditions per place. [2025-01-10 00:48:29,706 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 43 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2025-01-10 00:48:29,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 228 flow [2025-01-10 00:48:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-01-10 00:48:29,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6079545454545454 [2025-01-10 00:48:29,707 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 4 states and 107 transitions. [2025-01-10 00:48:29,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 228 flow [2025-01-10 00:48:29,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:29,709 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 109 flow [2025-01-10 00:48:29,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-01-10 00:48:29,709 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2025-01-10 00:48:29,709 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 109 flow [2025-01-10 00:48:29,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:29,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:29,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:29,716 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-01-10 00:48:29,910 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-01-10 00:48:29,910 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1888565038, now seen corresponding path program 1 times [2025-01-10 00:48:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:29,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275843389] [2025-01-10 00:48:29,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:29,914 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-01-10 00:48:29,914 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-01-10 00:48:29,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:29,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:29,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:48:29,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:30,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:30,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275843389] [2025-01-10 00:48:30,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275843389] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:30,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001509284] [2025-01-10 00:48:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:30,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:30,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:30,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:30,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:30,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:30,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:30,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:30,285 INFO L124 PetriNetUnfolderBase]: 1027/1737 cut-off events. [2025-01-10 00:48:30,285 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-01-10 00:48:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3958 conditions, 1737 events. 1027/1737 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9345 event pairs, 95 based on Foata normal form. 80/1798 useless extension candidates. Maximal degree in co-relation 3949. Up to 697 conditions per place. [2025-01-10 00:48:30,292 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 8 changer transitions 1/73 dead transitions. [2025-01-10 00:48:30,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 328 flow [2025-01-10 00:48:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-01-10 00:48:30,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2025-01-10 00:48:30,294 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 109 flow. Second operand 5 states and 135 transitions. [2025-01-10 00:48:30,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 328 flow [2025-01-10 00:48:30,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:30,297 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 149 flow [2025-01-10 00:48:30,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2025-01-10 00:48:30,297 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2025-01-10 00:48:30,298 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 149 flow [2025-01-10 00:48:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:30,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:30,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:30,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:48:30,498 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-01-10 00:48:30,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:30,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1923291947, now seen corresponding path program 1 times [2025-01-10 00:48:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1103545189] [2025-01-10 00:48:30,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:30,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:30,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:30,503 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-01-10 00:48:30,504 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-01-10 00:48:30,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 00:48:30,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 00:48:30,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:30,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:30,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:48:30,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:30,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:30,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103545189] [2025-01-10 00:48:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103545189] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:30,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91860142] [2025-01-10 00:48:30,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:30,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:30,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:30,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2025-01-10 00:48:30,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:30,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:30,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2025-01-10 00:48:30,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:30,812 INFO L124 PetriNetUnfolderBase]: 575/957 cut-off events. [2025-01-10 00:48:30,813 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2025-01-10 00:48:30,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 957 events. 575/957 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4303 event pairs, 79 based on Foata normal form. 40/978 useless extension candidates. Maximal degree in co-relation 2479. Up to 308 conditions per place. [2025-01-10 00:48:30,817 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 47 selfloop transitions, 11 changer transitions 1/69 dead transitions. [2025-01-10 00:48:30,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 69 transitions, 335 flow [2025-01-10 00:48:30,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:48:30,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:48:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-10 00:48:30,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5492424242424242 [2025-01-10 00:48:30,818 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 149 flow. Second operand 6 states and 145 transitions. [2025-01-10 00:48:30,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 69 transitions, 335 flow [2025-01-10 00:48:30,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 310 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:48:30,822 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 163 flow [2025-01-10 00:48:30,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-01-10 00:48:30,822 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2025-01-10 00:48:30,822 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 163 flow [2025-01-10 00:48:30,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:30,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:30,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:30,829 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-01-10 00:48:31,023 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-01-10 00:48:31,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:31,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:31,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1429034485, now seen corresponding path program 1 times [2025-01-10 00:48:31,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:31,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [821064020] [2025-01-10 00:48:31,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:31,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:31,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:31,026 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-01-10 00:48:31,027 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-01-10 00:48:31,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:31,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:31,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:31,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:31,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:48:31,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:31,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:31,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:31,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821064020] [2025-01-10 00:48:31,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821064020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:31,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:48:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915620204] [2025-01-10 00:48:31,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:31,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:48:31,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:31,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:48:31,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:48:31,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 00:48:31,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:31,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:31,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 00:48:31,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:31,666 INFO L124 PetriNetUnfolderBase]: 1219/1978 cut-off events. [2025-01-10 00:48:31,666 INFO L125 PetriNetUnfolderBase]: For 1542/1542 co-relation queries the response was YES. [2025-01-10 00:48:31,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5112 conditions, 1978 events. 1219/1978 cut-off events. For 1542/1542 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9826 event pairs, 341 based on Foata normal form. 8/1973 useless extension candidates. Maximal degree in co-relation 5100. Up to 822 conditions per place. [2025-01-10 00:48:31,672 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 7 changer transitions 24/92 dead transitions. [2025-01-10 00:48:31,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 525 flow [2025-01-10 00:48:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-01-10 00:48:31,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-01-10 00:48:31,673 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 163 flow. Second operand 7 states and 160 transitions. [2025-01-10 00:48:31,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 525 flow [2025-01-10 00:48:31,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 408 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-01-10 00:48:31,680 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 164 flow [2025-01-10 00:48:31,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2025-01-10 00:48:31,681 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2025-01-10 00:48:31,681 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 164 flow [2025-01-10 00:48:31,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:31,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:31,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:31,689 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-01-10 00:48:31,882 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-01-10 00:48:31,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 295731585, now seen corresponding path program 2 times [2025-01-10 00:48:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:31,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945829893] [2025-01-10 00:48:31,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:31,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:31,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:31,885 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-01-10 00:48:31,886 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-01-10 00:48:31,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:31,954 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:31,954 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:31,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:31,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 00:48:31,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:32,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:32,166 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945829893] [2025-01-10 00:48:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945829893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:48:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727550673] [2025-01-10 00:48:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:32,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:48:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:32,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:48:32,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:48:32,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-10 00:48:32,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:32,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:32,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-10 00:48:32,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:32,402 INFO L124 PetriNetUnfolderBase]: 606/1135 cut-off events. [2025-01-10 00:48:32,402 INFO L125 PetriNetUnfolderBase]: For 96/108 co-relation queries the response was YES. [2025-01-10 00:48:32,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 1135 events. 606/1135 cut-off events. For 96/108 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6044 event pairs, 250 based on Foata normal form. 8/1056 useless extension candidates. Maximal degree in co-relation 2354. Up to 559 conditions per place. [2025-01-10 00:48:32,407 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 28 selfloop transitions, 5 changer transitions 14/70 dead transitions. [2025-01-10 00:48:32,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 70 transitions, 315 flow [2025-01-10 00:48:32,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2025-01-10 00:48:32,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2025-01-10 00:48:32,408 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 164 flow. Second operand 7 states and 160 transitions. [2025-01-10 00:48:32,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 70 transitions, 315 flow [2025-01-10 00:48:32,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 301 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-01-10 00:48:32,410 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 188 flow [2025-01-10 00:48:32,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2025-01-10 00:48:32,411 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2025-01-10 00:48:32,411 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 188 flow [2025-01-10 00:48:32,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.11111111111111) internal successors, (163), 9 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:32,411 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:32,411 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:32,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 00:48:32,612 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-01-10 00:48:32,612 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:32,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1496342139, now seen corresponding path program 3 times [2025-01-10 00:48:32,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:32,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707052173] [2025-01-10 00:48:32,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:48:32,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:32,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:32,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:32,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 00:48:32,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:32,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:32,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:48:32,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:32,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:48:32,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:32,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:32,883 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:32,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707052173] [2025-01-10 00:48:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707052173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:32,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:32,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:48:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601097174] [2025-01-10 00:48:32,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:32,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:48:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:32,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:48:32,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:48:32,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-01-10 00:48:32,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 188 flow. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:32,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:32,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-01-10 00:48:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:33,336 INFO L124 PetriNetUnfolderBase]: 1582/2547 cut-off events. [2025-01-10 00:48:33,336 INFO L125 PetriNetUnfolderBase]: For 1097/1115 co-relation queries the response was YES. [2025-01-10 00:48:33,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 2547 events. 1582/2547 cut-off events. For 1097/1115 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 12901 event pairs, 304 based on Foata normal form. 16/2544 useless extension candidates. Maximal degree in co-relation 6546. Up to 1365 conditions per place. [2025-01-10 00:48:33,343 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 47 selfloop transitions, 8 changer transitions 41/105 dead transitions. [2025-01-10 00:48:33,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 578 flow [2025-01-10 00:48:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:48:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:48:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2025-01-10 00:48:33,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4671717171717172 [2025-01-10 00:48:33,344 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 188 flow. Second operand 9 states and 185 transitions. [2025-01-10 00:48:33,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 578 flow [2025-01-10 00:48:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 555 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 00:48:33,347 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 208 flow [2025-01-10 00:48:33,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=208, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2025-01-10 00:48:33,347 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 18 predicate places. [2025-01-10 00:48:33,347 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 208 flow [2025-01-10 00:48:33,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:33,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:33,347 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:33,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 00:48:33,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:33,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:33,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:33,549 INFO L85 PathProgramCache]: Analyzing trace with hash 864350003, now seen corresponding path program 4 times [2025-01-10 00:48:33,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:33,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120095904] [2025-01-10 00:48:33,549 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:48:33,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:33,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:33,551 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:33,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 00:48:33,602 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-01-10 00:48:33,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 30 statements. [2025-01-10 00:48:33,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:48:33,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:33,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-10 00:48:33,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:34,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:34,099 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:34,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120095904] [2025-01-10 00:48:34,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120095904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:34,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:34,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:48:34,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533576366] [2025-01-10 00:48:34,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:48:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:34,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:48:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:48:34,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 44 [2025-01-10 00:48:34,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 208 flow. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:34,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:34,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 44 [2025-01-10 00:48:34,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:34,443 INFO L124 PetriNetUnfolderBase]: 821/1545 cut-off events. [2025-01-10 00:48:34,443 INFO L125 PetriNetUnfolderBase]: For 580/628 co-relation queries the response was YES. [2025-01-10 00:48:34,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3695 conditions, 1545 events. 821/1545 cut-off events. For 580/628 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8785 event pairs, 120 based on Foata normal form. 8/1518 useless extension candidates. Maximal degree in co-relation 3677. Up to 365 conditions per place. [2025-01-10 00:48:34,450 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 50 selfloop transitions, 9 changer transitions 16/98 dead transitions. [2025-01-10 00:48:34,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 497 flow [2025-01-10 00:48:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:48:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:48:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2025-01-10 00:48:34,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5404040404040404 [2025-01-10 00:48:34,453 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 208 flow. Second operand 9 states and 214 transitions. [2025-01-10 00:48:34,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 497 flow [2025-01-10 00:48:34,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 98 transitions, 464 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-01-10 00:48:34,457 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 251 flow [2025-01-10 00:48:34,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=251, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-01-10 00:48:34,460 INFO L279 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2025-01-10 00:48:34,460 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 251 flow [2025-01-10 00:48:34,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 10 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:34,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:34,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:34,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,661 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-01-10 00:48:34,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:34,662 INFO L85 PathProgramCache]: Analyzing trace with hash 776337733, now seen corresponding path program 5 times [2025-01-10 00:48:34,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:34,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911546676] [2025-01-10 00:48:34,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:48:34,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:34,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:34,664 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:48:34,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 00:48:34,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:34,778 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:34,779 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:34,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:34,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:34,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-10 00:48:34,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-10 00:48:34,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:34,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:34,848 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:48:34,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:34,849 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-01-10 00:48:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-01-10 00:48:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-01-10 00:48:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-01-10 00:48:34,850 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-01-10 00:48:34,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-01-10 00:48:34,851 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-01-10 00:48:34,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-10 00:48:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:35,052 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2025-01-10 00:48:35,112 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:35,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:35,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:35 BasicIcfg [2025-01-10 00:48:35,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:35,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:35,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:35,119 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:35,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:27" (3/4) ... [2025-01-10 00:48:35,121 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:35,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:35,122 INFO L158 Benchmark]: Toolchain (without parser) took 8542.93ms. Allocated memory was 83.9MB in the beginning and 360.7MB in the end (delta: 276.8MB). Free memory was 58.2MB in the beginning and 136.7MB in the end (delta: -78.6MB). Peak memory consumption was 195.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:35,122 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.84ms. Allocated memory is still 83.9MB. Free memory was 57.8MB in the beginning and 33.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.42ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 31.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: Boogie Preprocessor took 46.74ms. Allocated memory is still 83.9MB. Free memory was 31.1MB in the beginning and 27.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: RCFGBuilder took 540.70ms. Allocated memory is still 83.9MB. Free memory was 27.6MB in the beginning and 44.3MB in the end (delta: -16.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: TraceAbstraction took 7534.76ms. Allocated memory was 83.9MB in the beginning and 360.7MB in the end (delta: 276.8MB). Free memory was 43.9MB in the beginning and 136.8MB in the end (delta: -92.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. [2025-01-10 00:48:35,123 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 360.7MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 22.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:35,124 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.14ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.84ms. Allocated memory is still 83.9MB. Free memory was 57.8MB in the beginning and 33.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.42ms. Allocated memory is still 83.9MB. Free memory was 33.7MB in the beginning and 31.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.74ms. Allocated memory is still 83.9MB. Free memory was 31.1MB in the beginning and 27.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 540.70ms. Allocated memory is still 83.9MB. Free memory was 27.6MB in the beginning and 44.3MB in the end (delta: -16.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7534.76ms. Allocated memory was 83.9MB in the beginning and 360.7MB in the end (delta: 276.8MB). Free memory was 43.9MB in the beginning and 136.8MB in the end (delta: -92.9MB). Peak memory consumption was 179.8MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 360.7MB. Free memory was 136.8MB in the beginning and 136.7MB in the end (delta: 22.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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1687; [L834] FCALL, FORK 0 pthread_create(&t1687, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 pthread_t t1688; [L836] FCALL, FORK 0 pthread_create(&t1688, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=0, t1688=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] 0 pthread_t t1689; [L838] FCALL, FORK 0 pthread_create(&t1689, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1687=0, t1688=1, t1689=2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L763] 2 y$w_buff1 = y$w_buff0 [L764] 2 y$w_buff0 = 2 [L765] 2 y$w_buff1_used = y$w_buff0_used [L766] 2 y$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L768] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 y$flush_delayed = weak$$choice2 [L778] 2 y$mem_tmp = y [L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = y [L787] 2 y = y$flush_delayed ? y$mem_tmp : y [L788] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] 2 __unbuffered_p1_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 3 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L749] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L794] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L796] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L797] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=0, t1688=1, t1689=2, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=0, t1688=1, t1689=2, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L852] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L853] 0 y$flush_delayed = weak$$choice2 [L854] 0 y$mem_tmp = y [L855] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L857] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L858] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L859] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L861] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L863] 0 y = y$flush_delayed ? y$mem_tmp : y [L864] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1687=0, t1688=1, t1689=2, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L866] 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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L17] 0 __assert_fail ("0", "rfi006_pso.oepc_pso.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 838]: 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 7 procedures, 68 locations, 7 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: 7.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 425 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1342 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 20 mSDtfsCounter, 1342 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=9, InterpolantAutomatonStates: 53, 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.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1070 SizeOfPredicates, 29 NumberOfNonLiveVariables, 987 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-01-10 00:48:35,147 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