./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:00,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:00,430 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:00,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:00,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:00,458 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:00,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:00,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:00,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:00,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:00,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:00,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:00,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:00,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:00,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:00,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:00,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:00,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:00,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:00,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:00,464 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2025-01-10 00:48:00,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:00,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:00,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:00,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:00,693 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:00,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:01,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3f87b80/71d81f4d2bef46648d03f90ed5135c32/FLAGb1e53e345 [2025-01-10 00:48:02,145 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:02,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:02,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3f87b80/71d81f4d2bef46648d03f90ed5135c32/FLAGb1e53e345 [2025-01-10 00:48:02,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f3f87b80/71d81f4d2bef46648d03f90ed5135c32 [2025-01-10 00:48:02,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:02,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:02,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:02,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:02,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:02,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:02" (1/1) ... [2025-01-10 00:48:02,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a26738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:02, skipping insertion in model container [2025-01-10 00:48:02,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:02" (1/1) ... [2025-01-10 00:48:02,222 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:02,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:02,498 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:02,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:02,566 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:02,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:02 WrapperNode [2025-01-10 00:48:02,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:02,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:02,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:02,570 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:02,574 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:02" (1/1) ... [2025-01-10 00:48:02,590 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:02" (1/1) ... [2025-01-10 00:48:02,608 INFO L138 Inliner]: procedures = 174, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 115 [2025-01-10 00:48:02,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:02,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:02,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:02,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:02,618 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:02" (1/1) ... [2025-01-10 00:48:02,618 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:02" (1/1) ... [2025-01-10 00:48:02,621 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:02" (1/1) ... [2025-01-10 00:48:02,634 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:02,634 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:02" (1/1) ... [2025-01-10 00:48:02,634 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:02" (1/1) ... [2025-01-10 00:48:02,639 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:02" (1/1) ... [2025-01-10 00:48:02,639 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:02" (1/1) ... [2025-01-10 00:48:02,641 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:02" (1/1) ... [2025-01-10 00:48:02,642 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:02" (1/1) ... [2025-01-10 00:48:02,642 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:02" (1/1) ... [2025-01-10 00:48:02,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:02,644 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:02,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:02,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:02,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:02" (1/1) ... [2025-01-10 00:48:02,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:02,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:02,681 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:02,686 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:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:02,705 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:02,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:02,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:48:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:02,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:02,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:02,707 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:02,808 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:02,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:03,009 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:03,009 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:03,171 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:03,172 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:03,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:03 BoogieIcfgContainer [2025-01-10 00:48:03,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:03,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:03,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:03,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:03,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:02" (1/3) ... [2025-01-10 00:48:03,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bf4a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:03, skipping insertion in model container [2025-01-10 00:48:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:02" (2/3) ... [2025-01-10 00:48:03,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44bf4a07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:03, skipping insertion in model container [2025-01-10 00:48:03,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:03" (3/3) ... [2025-01-10 00:48:03,179 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:03,204 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:03,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:48:03,206 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:03,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:03,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:48:03,313 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-01-10 00:48:03,315 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:03,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 00:48:03,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:48:03,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-01-10 00:48:03,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:03,343 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;@1f4e7c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:03,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:48:03,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:03,351 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 00:48:03,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:03,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:03,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:48:03,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:03,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:03,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1606187755, now seen corresponding path program 1 times [2025-01-10 00:48:03,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959378867] [2025-01-10 00:48:03,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:03,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:03,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:48:03,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:48:03,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:03,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:03,709 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:03,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:03,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959378867] [2025-01-10 00:48:03,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959378867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:03,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:03,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729184097] [2025-01-10 00:48:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:03,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:03,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:03,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:03,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:03,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 38 [2025-01-10 00:48:03,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 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:03,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:03,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 38 [2025-01-10 00:48:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:03,904 INFO L124 PetriNetUnfolderBase]: 129/354 cut-off events. [2025-01-10 00:48:03,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:03,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 354 events. 129/354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2062 event pairs, 18 based on Foata normal form. 24/370 useless extension candidates. Maximal degree in co-relation 588. Up to 184 conditions per place. [2025-01-10 00:48:03,910 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2025-01-10 00:48:03,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 138 flow [2025-01-10 00:48:03,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 00:48:03,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2025-01-10 00:48:03,922 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-01-10 00:48:03,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 138 flow [2025-01-10 00:48:03,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:03,927 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-01-10 00:48:03,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-01-10 00:48:03,932 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 00:48:03,932 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-01-10 00:48:03,933 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:03,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:03,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:03,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:48:03,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:03,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 255726720, now seen corresponding path program 1 times [2025-01-10 00:48:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:03,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025142756] [2025-01-10 00:48:03,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:03,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:03,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:03,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:04,005 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:04,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:04,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025142756] [2025-01-10 00:48:04,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025142756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:04,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956108809] [2025-01-10 00:48:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:04,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:04,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:04,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-01-10 00:48:04,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:04,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:04,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-01-10 00:48:04,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:04,063 INFO L124 PetriNetUnfolderBase]: 112/283 cut-off events. [2025-01-10 00:48:04,063 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 00:48:04,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 283 events. 112/283 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1599 event pairs, 112 based on Foata normal form. 12/278 useless extension candidates. Maximal degree in co-relation 509. Up to 203 conditions per place. [2025-01-10 00:48:04,064 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 13 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-01-10 00:48:04,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 98 flow [2025-01-10 00:48:04,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-10 00:48:04,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-01-10 00:48:04,066 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 67 transitions. [2025-01-10 00:48:04,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 98 flow [2025-01-10 00:48:04,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:04,067 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-01-10 00:48:04,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-10 00:48:04,067 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-01-10 00:48:04,067 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-01-10 00:48:04,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:04,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:04,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:04,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:48:04,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 255726796, now seen corresponding path program 1 times [2025-01-10 00:48:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334139957] [2025-01-10 00:48:04,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:04,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:04,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:04,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:04,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:04,246 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:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:04,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334139957] [2025-01-10 00:48:04,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334139957] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:04,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:04,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112230354] [2025-01-10 00:48:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:04,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:04,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:04,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:48:04,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:04,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:04,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:48:04,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:04,407 INFO L124 PetriNetUnfolderBase]: 161/368 cut-off events. [2025-01-10 00:48:04,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:04,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 368 events. 161/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1858 event pairs, 24 based on Foata normal form. 20/377 useless extension candidates. Maximal degree in co-relation 676. Up to 166 conditions per place. [2025-01-10 00:48:04,409 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 28 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2025-01-10 00:48:04,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 164 flow [2025-01-10 00:48:04,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:04,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 00:48:04,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 00:48:04,412 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 4 states and 95 transitions. [2025-01-10 00:48:04,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 164 flow [2025-01-10 00:48:04,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:04,414 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 89 flow [2025-01-10 00:48:04,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-01-10 00:48:04,414 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-10 00:48:04,414 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 89 flow [2025-01-10 00:48:04,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:04,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:04,415 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:04,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:48:04,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:04,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:04,415 INFO L85 PathProgramCache]: Analyzing trace with hash -153727061, now seen corresponding path program 1 times [2025-01-10 00:48:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401148934] [2025-01-10 00:48:04,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:04,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:04,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:04,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:04,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:04,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:04,614 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:04,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:04,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401148934] [2025-01-10 00:48:04,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401148934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:04,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:04,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:04,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017430350] [2025-01-10 00:48:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:04,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:04,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:04,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:04,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:04,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:48:04,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:04,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:04,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:48:04,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:04,713 INFO L124 PetriNetUnfolderBase]: 84/195 cut-off events. [2025-01-10 00:48:04,714 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-10 00:48:04,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 195 events. 84/195 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 668 event pairs, 16 based on Foata normal form. 14/200 useless extension candidates. Maximal degree in co-relation 442. Up to 71 conditions per place. [2025-01-10 00:48:04,715 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 24 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-01-10 00:48:04,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 180 flow [2025-01-10 00:48:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 00:48:04,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2025-01-10 00:48:04,717 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 89 flow. Second operand 5 states and 108 transitions. [2025-01-10 00:48:04,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 180 flow [2025-01-10 00:48:04,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:04,718 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 105 flow [2025-01-10 00:48:04,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-01-10 00:48:04,719 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-10 00:48:04,719 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 105 flow [2025-01-10 00:48:04,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:04,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:04,719 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] [2025-01-10 00:48:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:48:04,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 210563934, now seen corresponding path program 1 times [2025-01-10 00:48:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92169875] [2025-01-10 00:48:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:04,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:04,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:04,978 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:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92169875] [2025-01-10 00:48:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92169875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:48:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100344615] [2025-01-10 00:48:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:04,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:04,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:48:04,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:04,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:04,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:48:04,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:05,093 INFO L124 PetriNetUnfolderBase]: 108/286 cut-off events. [2025-01-10 00:48:05,094 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-01-10 00:48:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 286 events. 108/286 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1232 event pairs, 55 based on Foata normal form. 4/276 useless extension candidates. Maximal degree in co-relation 602. Up to 127 conditions per place. [2025-01-10 00:48:05,095 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 18 selfloop transitions, 2 changer transitions 11/45 dead transitions. [2025-01-10 00:48:05,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 201 flow [2025-01-10 00:48:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:05,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-01-10 00:48:05,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5631578947368421 [2025-01-10 00:48:05,098 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 105 flow. Second operand 5 states and 107 transitions. [2025-01-10 00:48:05,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 201 flow [2025-01-10 00:48:05,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 167 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-01-10 00:48:05,100 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 89 flow [2025-01-10 00:48:05,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-01-10 00:48:05,100 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2025-01-10 00:48:05,100 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 89 flow [2025-01-10 00:48:05,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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:05,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:05,100 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] [2025-01-10 00:48:05,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:48:05,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1188297130, now seen corresponding path program 2 times [2025-01-10 00:48:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255755466] [2025-01-10 00:48:05,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:05,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:05,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:05,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:05,709 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:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255755466] [2025-01-10 00:48:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255755466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:48:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973987779] [2025-01-10 00:48:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:05,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 00:48:05,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:05,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 00:48:05,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 00:48:05,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-01-10 00:48:05,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 89 flow. Second operand has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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:05,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:05,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-01-10 00:48:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:05,887 INFO L124 PetriNetUnfolderBase]: 65/187 cut-off events. [2025-01-10 00:48:05,888 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:48:05,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 187 events. 65/187 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 657 event pairs, 8 based on Foata normal form. 4/184 useless extension candidates. Maximal degree in co-relation 365. Up to 37 conditions per place. [2025-01-10 00:48:05,890 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 16 selfloop transitions, 4 changer transitions 14/50 dead transitions. [2025-01-10 00:48:05,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 199 flow [2025-01-10 00:48:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 00:48:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 00:48:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-01-10 00:48:05,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5497076023391813 [2025-01-10 00:48:05,893 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 89 flow. Second operand 9 states and 188 transitions. [2025-01-10 00:48:05,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 199 flow [2025-01-10 00:48:05,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 185 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 00:48:05,896 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 97 flow [2025-01-10 00:48:05,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=97, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2025-01-10 00:48:05,896 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2025-01-10 00:48:05,897 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 97 flow [2025-01-10 00:48:05,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.625) internal successors, (149), 8 states have internal predecessors, (149), 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:05,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:05,898 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] [2025-01-10 00:48:05,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:48:05,898 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1066881696, now seen corresponding path program 3 times [2025-01-10 00:48:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096573311] [2025-01-10 00:48:05,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:48:05,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:05,907 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:05,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:05,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:48:05,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:06,129 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:06,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:48:06,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096573311] [2025-01-10 00:48:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096573311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:06,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:48:06,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476522979] [2025-01-10 00:48:06,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:06,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:48:06,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:48:06,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:48:06,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:48:06,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-10 00:48:06,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 97 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:06,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:06,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-10 00:48:06,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:06,274 INFO L124 PetriNetUnfolderBase]: 105/270 cut-off events. [2025-01-10 00:48:06,274 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-01-10 00:48:06,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 270 events. 105/270 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1078 event pairs, 42 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 570. Up to 100 conditions per place. [2025-01-10 00:48:06,275 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 20 selfloop transitions, 5 changer transitions 13/50 dead transitions. [2025-01-10 00:48:06,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 226 flow [2025-01-10 00:48:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:06,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2025-01-10 00:48:06,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-01-10 00:48:06,276 INFO L175 Difference]: Start difference. First operand has 51 places, 31 transitions, 97 flow. Second operand 7 states and 130 transitions. [2025-01-10 00:48:06,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 226 flow [2025-01-10 00:48:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 202 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-01-10 00:48:06,277 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 120 flow [2025-01-10 00:48:06,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2025-01-10 00:48:06,281 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2025-01-10 00:48:06,281 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 120 flow [2025-01-10 00:48:06,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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:06,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:06,281 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] [2025-01-10 00:48:06,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:48:06,281 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:06,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2015636892, now seen corresponding path program 4 times [2025-01-10 00:48:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:48:06,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860358437] [2025-01-10 00:48:06,281 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:48:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:48:06,289 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 00:48:06,319 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:06,319 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-10 00:48:06,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:06,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:06,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:06,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:06,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:06,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:48:06,370 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:06,370 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:48:06,371 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:48:06,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:48:06,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:48:06,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:48:06,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:48:06,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:48:06,372 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-01-10 00:48:06,426 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:06,429 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:06,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:06 BasicIcfg [2025-01-10 00:48:06,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:06,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:06,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:06,434 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:06,434 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:03" (3/4) ... [2025-01-10 00:48:06,435 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:06,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:06,436 INFO L158 Benchmark]: Toolchain (without parser) took 4254.11ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 112.5MB in the beginning and 138.3MB in the end (delta: -25.7MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2025-01-10 00:48:06,437 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:06,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.23ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 90.3MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-10 00:48:06,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:06,439 INFO L158 Benchmark]: Boogie Preprocessor took 34.69ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:06,439 INFO L158 Benchmark]: RCFGBuilder took 527.78ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 43.9MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-10 00:48:06,439 INFO L158 Benchmark]: TraceAbstraction took 3258.28ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 43.4MB in the beginning and 138.3MB in the end (delta: -94.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:06,439 INFO L158 Benchmark]: Witness Printer took 1.99ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 138.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:06,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.23ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 90.3MB in the end (delta: 22.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.69ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 85.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 527.78ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 43.9MB in the end (delta: 41.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3258.28ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 43.4MB in the beginning and 138.3MB in the end (delta: -94.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 1.99ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 138.3MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. 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; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((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, t1633=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((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, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-2, t1634=-1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 159 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 13 mSDtfsCounter, 518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:06,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:48:08,750 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:48:08,838 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:08,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:48:08,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:48:08,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:48:08,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:48:08,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:48:08,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:48:08,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:48:08,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:48:08,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:48:08,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-10 00:48:08,909 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:48:08,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:08,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:48:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:08,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:48:08,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:48:08,913 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-10 00:48:08,914 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-10 00:48:08,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:48:08,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:48:08,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:48:08,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:48:08,914 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 -> 5b81d744fec4d4b48b220b63eb6337c45e4be951600681981b2881c9432ed2ae [2025-01-10 00:48:09,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:48:09,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:48:09,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:48:09,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:48:09,176 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:48:09,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:10,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/976f4a68c/f53edbabcc7f41b888a5be6cc357b314/FLAGc93350413 [2025-01-10 00:48:10,713 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:48:10,713 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:10,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/976f4a68c/f53edbabcc7f41b888a5be6cc357b314/FLAGc93350413 [2025-01-10 00:48:10,997 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/976f4a68c/f53edbabcc7f41b888a5be6cc357b314 [2025-01-10 00:48:10,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:48:11,000 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:48:11,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:11,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:48:11,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:48:11,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:10" (1/1) ... [2025-01-10 00:48:11,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3de1e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:11, skipping insertion in model container [2025-01-10 00:48:11,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:48:10" (1/1) ... [2025-01-10 00:48:11,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:48:11,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:11,473 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:48:11,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:48:11,566 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:48:11,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:11 WrapperNode [2025-01-10 00:48:11,567 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:48:11,568 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:11,568 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:48:11,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:48:11,572 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:11" (1/1) ... [2025-01-10 00:48:11,593 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:11" (1/1) ... [2025-01-10 00:48:11,615 INFO L138 Inliner]: procedures = 175, calls = 40, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 116 [2025-01-10 00:48:11,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:48:11,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:48:11,618 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:48:11,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:48:11,625 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:11" (1/1) ... [2025-01-10 00:48:11,626 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:11" (1/1) ... [2025-01-10 00:48:11,630 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:11" (1/1) ... [2025-01-10 00:48:11,653 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:11,653 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:11" (1/1) ... [2025-01-10 00:48:11,653 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:11" (1/1) ... [2025-01-10 00:48:11,661 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:11" (1/1) ... [2025-01-10 00:48:11,662 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:11" (1/1) ... [2025-01-10 00:48:11,667 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:11" (1/1) ... [2025-01-10 00:48:11,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:11" (1/1) ... [2025-01-10 00:48:11,680 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:11" (1/1) ... [2025-01-10 00:48:11,686 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:48:11,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:48:11,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:48:11,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:48:11,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:11" (1/1) ... [2025-01-10 00:48:11,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:48:11,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:11,716 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:11,726 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:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:48:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:48:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-10 00:48:11,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-01-10 00:48:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-01-10 00:48:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-01-10 00:48:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-01-10 00:48:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:48:11,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:48:11,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:48:11,746 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:11,868 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:48:11,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:48:12,077 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:48:12,077 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:48:12,193 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:48:12,193 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:48:12,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:12 BoogieIcfgContainer [2025-01-10 00:48:12,193 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:48:12,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:48:12,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:48:12,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:48:12,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:48:10" (1/3) ... [2025-01-10 00:48:12,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b9acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:12, skipping insertion in model container [2025-01-10 00:48:12,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:48:11" (2/3) ... [2025-01-10 00:48:12,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7b9acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:48:12, skipping insertion in model container [2025-01-10 00:48:12,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:48:12" (3/3) ... [2025-01-10 00:48:12,201 INFO L128 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-01-10 00:48:12,211 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:48:12,212 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 37 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-01-10 00:48:12,212 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:48:12,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 00:48:12,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:48:12,333 INFO L124 PetriNetUnfolderBase]: 2/36 cut-off events. [2025-01-10 00:48:12,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:12,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 36 events. 2/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-01-10 00:48:12,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 84 flow [2025-01-10 00:48:12,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 36 transitions, 78 flow [2025-01-10 00:48:12,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:48:12,363 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;@237a5dbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:48:12,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-01-10 00:48:12,369 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:48:12,369 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-01-10 00:48:12,369 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:12,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:12,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 00:48:12,370 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1665354667, now seen corresponding path program 1 times [2025-01-10 00:48:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:12,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1408377257] [2025-01-10 00:48:12,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:12,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:12,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:12,397 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:12,398 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:12,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 00:48:12,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 00:48:12,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:12,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:12,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 00:48:12,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:12,513 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:12,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:12,514 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408377257] [2025-01-10 00:48:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408377257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:12,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401265666] [2025-01-10 00:48:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:12,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:12,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:12,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 38 [2025-01-10 00:48:12,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 78 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:12,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:12,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 38 [2025-01-10 00:48:12,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:12,684 INFO L124 PetriNetUnfolderBase]: 129/354 cut-off events. [2025-01-10 00:48:12,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:12,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 354 events. 129/354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2062 event pairs, 18 based on Foata normal form. 24/370 useless extension candidates. Maximal degree in co-relation 588. Up to 184 conditions per place. [2025-01-10 00:48:12,688 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 21 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2025-01-10 00:48:12,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 138 flow [2025-01-10 00:48:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2025-01-10 00:48:12,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7368421052631579 [2025-01-10 00:48:12,698 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 78 flow. Second operand 3 states and 84 transitions. [2025-01-10 00:48:12,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 138 flow [2025-01-10 00:48:12,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:12,702 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2025-01-10 00:48:12,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-01-10 00:48:12,706 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2025-01-10 00:48:12,707 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2025-01-10 00:48:12,707 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:12,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:12,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:12,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:12,907 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:12,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:12,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1940009730, now seen corresponding path program 1 times [2025-01-10 00:48:12,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:12,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396730703] [2025-01-10 00:48:12,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:12,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:12,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:12,912 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:12,913 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:12,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:12,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:12,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:12,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:12,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 00:48:12,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:48:12,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:12,994 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:12,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396730703] [2025-01-10 00:48:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396730703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:12,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:12,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:48:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620012462] [2025-01-10 00:48:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:12,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:48:12,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:12,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:48:12,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:48:12,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2025-01-10 00:48:12,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:12,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:12,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2025-01-10 00:48:12,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:13,075 INFO L124 PetriNetUnfolderBase]: 112/283 cut-off events. [2025-01-10 00:48:13,075 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-01-10 00:48:13,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 283 events. 112/283 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1570 event pairs, 112 based on Foata normal form. 12/278 useless extension candidates. Maximal degree in co-relation 509. Up to 203 conditions per place. [2025-01-10 00:48:13,077 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 13 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2025-01-10 00:48:13,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 98 flow [2025-01-10 00:48:13,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:48:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:48:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-01-10 00:48:13,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-01-10 00:48:13,079 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 67 transitions. [2025-01-10 00:48:13,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 98 flow [2025-01-10 00:48:13,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:13,080 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2025-01-10 00:48:13,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-10 00:48:13,080 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2025-01-10 00:48:13,080 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2025-01-10 00:48:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:48:13,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:13,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:48:13,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:48:13,281 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:13,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:13,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1940009806, now seen corresponding path program 1 times [2025-01-10 00:48:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [954424988] [2025-01-10 00:48:13,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:13,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:13,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:13,285 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:13,287 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:13,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:48:13,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:48:13,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:13,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:13,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:48:13,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:13,386 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:13,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:13,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:13,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954424988] [2025-01-10 00:48:13,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954424988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:13,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:13,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:48:13,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636244505] [2025-01-10 00:48:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:48:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:48:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:48:13,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:48:13,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:13,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:13,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:48:13,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:13,506 INFO L124 PetriNetUnfolderBase]: 161/368 cut-off events. [2025-01-10 00:48:13,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:48:13,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 368 events. 161/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1859 event pairs, 24 based on Foata normal form. 20/377 useless extension candidates. Maximal degree in co-relation 676. Up to 166 conditions per place. [2025-01-10 00:48:13,509 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 28 selfloop transitions, 4 changer transitions 1/45 dead transitions. [2025-01-10 00:48:13,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 164 flow [2025-01-10 00:48:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:48:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:48:13,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-10 00:48:13,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-01-10 00:48:13,510 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 4 states and 95 transitions. [2025-01-10 00:48:13,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 164 flow [2025-01-10 00:48:13,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 163 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:48:13,514 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 89 flow [2025-01-10 00:48:13,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-01-10 00:48:13,514 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-01-10 00:48:13,514 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 89 flow [2025-01-10 00:48:13,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:13,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:13,515 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:13,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:13,715 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:13,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:13,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:13,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1537004909, now seen corresponding path program 1 times [2025-01-10 00:48:13,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:13,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34963303] [2025-01-10 00:48:13,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:13,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:13,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:13,719 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:13,720 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:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:48:13,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:48:13,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:13,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:13,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 00:48:13,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:13,840 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:13,840 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:13,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:13,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34963303] [2025-01-10 00:48:13,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34963303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:13,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:13,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:48:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125868173] [2025-01-10 00:48:13,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:13,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:48:13,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:13,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:48:13,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:48:13,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 38 [2025-01-10 00:48:13,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:13,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:13,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 38 [2025-01-10 00:48:13,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:13,949 INFO L124 PetriNetUnfolderBase]: 84/195 cut-off events. [2025-01-10 00:48:13,950 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-01-10 00:48:13,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 195 events. 84/195 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 677 event pairs, 16 based on Foata normal form. 14/200 useless extension candidates. Maximal degree in co-relation 442. Up to 71 conditions per place. [2025-01-10 00:48:13,954 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 24 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-01-10 00:48:13,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 180 flow [2025-01-10 00:48:13,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:48:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:48:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-01-10 00:48:13,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2025-01-10 00:48:13,955 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 89 flow. Second operand 5 states and 108 transitions. [2025-01-10 00:48:13,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 180 flow [2025-01-10 00:48:13,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 171 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:48:13,957 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 105 flow [2025-01-10 00:48:13,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-01-10 00:48:13,957 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2025-01-10 00:48:13,957 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 105 flow [2025-01-10 00:48:13,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:13,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:13,957 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] [2025-01-10 00:48:13,967 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:14,163 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:14,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:14,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -11659618, now seen corresponding path program 1 times [2025-01-10 00:48:14,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:14,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [525716994] [2025-01-10 00:48:14,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:48:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:14,169 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:14,170 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:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:14,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:14,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 00:48:14,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:14,376 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:14,376 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:14,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525716994] [2025-01-10 00:48:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525716994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-10 00:48:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231876415] [2025-01-10 00:48:14,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 00:48:14,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:14,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 00:48:14,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-10 00:48:14,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 38 [2025-01-10 00:48:14,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 105 flow. Second operand has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 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:14,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:14,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 38 [2025-01-10 00:48:14,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:14,743 INFO L124 PetriNetUnfolderBase]: 185/422 cut-off events. [2025-01-10 00:48:14,745 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2025-01-10 00:48:14,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 422 events. 185/422 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1842 event pairs, 51 based on Foata normal form. 8/424 useless extension candidates. Maximal degree in co-relation 992. Up to 129 conditions per place. [2025-01-10 00:48:14,746 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 24 selfloop transitions, 7 changer transitions 40/80 dead transitions. [2025-01-10 00:48:14,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 397 flow [2025-01-10 00:48:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:48:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:48:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 217 transitions. [2025-01-10 00:48:14,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4758771929824561 [2025-01-10 00:48:14,748 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 105 flow. Second operand 12 states and 217 transitions. [2025-01-10 00:48:14,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 397 flow [2025-01-10 00:48:14,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 331 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-01-10 00:48:14,750 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 117 flow [2025-01-10 00:48:14,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=117, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2025-01-10 00:48:14,751 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2025-01-10 00:48:14,751 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 117 flow [2025-01-10 00:48:14,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.8) internal successors, (138), 10 states have internal predecessors, (138), 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:14,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:14,751 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] [2025-01-10 00:48:14,757 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:14,952 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:14,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash -529276984, now seen corresponding path program 2 times [2025-01-10 00:48:14,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365241090] [2025-01-10 00:48:14,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:48:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:14,957 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:14,958 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:15,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:15,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:15,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:15,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:15,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 00:48:15,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:15,326 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,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:15,326 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365241090] [2025-01-10 00:48:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365241090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-10 00:48:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260260883] [2025-01-10 00:48:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:15,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-10 00:48:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:15,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-10 00:48:15,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 00:48:15,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 38 [2025-01-10 00:48:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 117 flow. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:15,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 38 [2025-01-10 00:48:15,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:15,498 INFO L124 PetriNetUnfolderBase]: 76/207 cut-off events. [2025-01-10 00:48:15,499 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-10 00:48:15,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 207 events. 76/207 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 721 event pairs, 10 based on Foata normal form. 4/207 useless extension candidates. Maximal degree in co-relation 458. Up to 44 conditions per place. [2025-01-10 00:48:15,500 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 17 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2025-01-10 00:48:15,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 248 flow [2025-01-10 00:48:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:48:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:48:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-01-10 00:48:15,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5236842105263158 [2025-01-10 00:48:15,501 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 117 flow. Second operand 10 states and 199 transitions. [2025-01-10 00:48:15,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 248 flow [2025-01-10 00:48:15,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 210 flow, removed 14 selfloop flow, removed 10 redundant places. [2025-01-10 00:48:15,503 INFO L231 Difference]: Finished difference. Result has 54 places, 31 transitions, 101 flow [2025-01-10 00:48:15,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=101, PETRI_PLACES=54, PETRI_TRANSITIONS=31} [2025-01-10 00:48:15,504 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2025-01-10 00:48:15,504 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 31 transitions, 101 flow [2025-01-10 00:48:15,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 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,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:15,504 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] [2025-01-10 00:48:15,511 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:15,708 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:15,708 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:15,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:15,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1289105248, now seen corresponding path program 3 times [2025-01-10 00:48:15,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:15,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140377697] [2025-01-10 00:48:15,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 00:48:15,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:15,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:15,711 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:15,713 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:15,780 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:15,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:15,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-10 00:48:15,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:15,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 00:48:15,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:15,981 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,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:15,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140377697] [2025-01-10 00:48:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140377697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:15,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:15,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 00:48:15,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611524224] [2025-01-10 00:48:15,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 00:48:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:15,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 00:48:15,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-01-10 00:48:16,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 38 [2025-01-10 00:48:16,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 31 transitions, 101 flow. Second operand has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:16,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 38 [2025-01-10 00:48:16,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:16,268 INFO L124 PetriNetUnfolderBase]: 116/279 cut-off events. [2025-01-10 00:48:16,269 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-01-10 00:48:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 279 events. 116/279 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 994 event pairs, 32 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 638. Up to 107 conditions per place. [2025-01-10 00:48:16,269 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 23 selfloop transitions, 4 changer transitions 27/62 dead transitions. [2025-01-10 00:48:16,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 62 transitions, 303 flow [2025-01-10 00:48:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 00:48:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 00:48:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2025-01-10 00:48:16,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4342105263157895 [2025-01-10 00:48:16,270 INFO L175 Difference]: Start difference. First operand has 54 places, 31 transitions, 101 flow. Second operand 10 states and 165 transitions. [2025-01-10 00:48:16,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 62 transitions, 303 flow [2025-01-10 00:48:16,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 62 transitions, 271 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-01-10 00:48:16,272 INFO L231 Difference]: Finished difference. Result has 55 places, 31 transitions, 110 flow [2025-01-10 00:48:16,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=31} [2025-01-10 00:48:16,272 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2025-01-10 00:48:16,272 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 31 transitions, 110 flow [2025-01-10 00:48:16,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.727272727272727) internal successors, (140), 11 states have internal predecessors, (140), 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,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:16,272 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] [2025-01-10 00:48:16,282 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:16,477 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:16,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:16,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash 824300136, now seen corresponding path program 4 times [2025-01-10 00:48:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:16,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1226481659] [2025-01-10 00:48:16,482 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-10 00:48:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:16,483 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:16,484 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:16,526 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-10 00:48:16,535 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 26 statements. [2025-01-10 00:48:16,535 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-10 00:48:16,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:48:16,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 00:48:16,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:48:16,593 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,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 00:48:16,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-10 00:48:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226481659] [2025-01-10 00:48:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226481659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:48:16,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:48:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 00:48:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704669108] [2025-01-10 00:48:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:48:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:48:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-10 00:48:16,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:48:16,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:48:16,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 38 [2025-01-10 00:48:16,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 31 transitions, 110 flow. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:48:16,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 38 [2025-01-10 00:48:16,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:48:16,713 INFO L124 PetriNetUnfolderBase]: 98/259 cut-off events. [2025-01-10 00:48:16,713 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-01-10 00:48:16,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 259 events. 98/259 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 989 event pairs, 36 based on Foata normal form. 4/252 useless extension candidates. Maximal degree in co-relation 590. Up to 102 conditions per place. [2025-01-10 00:48:16,714 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 19 selfloop transitions, 1 changer transitions 18/50 dead transitions. [2025-01-10 00:48:16,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 236 flow [2025-01-10 00:48:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:48:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:48:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2025-01-10 00:48:16,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48872180451127817 [2025-01-10 00:48:16,716 INFO L175 Difference]: Start difference. First operand has 55 places, 31 transitions, 110 flow. Second operand 7 states and 130 transitions. [2025-01-10 00:48:16,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 236 flow [2025-01-10 00:48:16,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 208 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-01-10 00:48:16,717 INFO L231 Difference]: Finished difference. Result has 52 places, 31 transitions, 101 flow [2025-01-10 00:48:16,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2025-01-10 00:48:16,718 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2025-01-10 00:48:16,718 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 31 transitions, 101 flow [2025-01-10 00:48:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 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,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:48:16,718 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] [2025-01-10 00:48:16,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 00:48:16,918 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:16,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] === [2025-01-10 00:48:16,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:48:16,919 INFO L85 PathProgramCache]: Analyzing trace with hash 95035610, now seen corresponding path program 5 times [2025-01-10 00:48:16,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-10 00:48:16,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1990102150] [2025-01-10 00:48:16,919 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-10 00:48:16,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:48:16,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:48:16,925 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:16,926 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:16,968 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:16,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:16,982 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:48:16,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:16,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:48:16,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-10 00:48:17,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-10 00:48:17,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:48:17,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:48:17,046 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-10 00:48:17,046 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:48:17,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining) [2025-01-10 00:48:17,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2025-01-10 00:48:17,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining) [2025-01-10 00:48:17,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-01-10 00:48:17,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-01-10 00:48:17,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2025-01-10 00:48:17,056 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:17,254 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:17,254 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2025-01-10 00:48:17,330 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 00:48:17,330 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 00:48:17,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:48:17 BasicIcfg [2025-01-10 00:48:17,339 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 00:48:17,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 00:48:17,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 00:48:17,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 00:48:17,340 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:12" (3/4) ... [2025-01-10 00:48:17,341 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 00:48:17,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 00:48:17,344 INFO L158 Benchmark]: Toolchain (without parser) took 6344.01ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 89.6MB in the beginning and 98.2MB in the end (delta: -8.6MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2025-01-10 00:48:17,344 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:17,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.05ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 66.9MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 00:48:17,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.95ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:17,345 INFO L158 Benchmark]: Boogie Preprocessor took 68.29ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:17,345 INFO L158 Benchmark]: RCFGBuilder took 506.35ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 52.9MB in the end (delta: 9.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2025-01-10 00:48:17,346 INFO L158 Benchmark]: TraceAbstraction took 5143.64ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 52.4MB in the beginning and 98.3MB in the end (delta: -45.9MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. [2025-01-10 00:48:17,346 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 234.9MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 00:48:17,347 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.19ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.05ms. Allocated memory is still 117.4MB. Free memory was 89.5MB in the beginning and 66.9MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.95ms. Allocated memory is still 117.4MB. Free memory was 66.9MB in the beginning and 64.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.29ms. Allocated memory is still 117.4MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 506.35ms. Allocated memory is still 117.4MB. Free memory was 62.2MB in the beginning and 52.9MB in the end (delta: 9.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5143.64ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 52.4MB in the beginning and 98.3MB in the end (delta: -45.9MB). Peak memory consumption was 70.6MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 234.9MB. Free memory was 98.3MB in the beginning and 98.2MB in the end (delta: 69.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. 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; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1633; [L814] FCALL, FORK 0 pthread_create(&t1633, ((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, t1633=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L815] 0 pthread_t t1634; [L816] FCALL, FORK 0 pthread_create(&t1634, ((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, t1633=-1, t1634=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L782] 2 y = 1 VAL [\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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L741] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-1, t1634=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-1, t1634=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1633=-1, t1634=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L18] 0 __assert_fail ("0", "rfi003_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 57 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 271 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1332 IncrementalHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 7 mSDtfsCounter, 1332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 181 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 621 SizeOfPredicates, 27 NumberOfNonLiveVariables, 673 ConjunctsInSsa, 59 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:17,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample