./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe026_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 48c9605d 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/safe026_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 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:26:17,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:26:17,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:26:17,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:26:17,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:26:17,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:26:17,102 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:26:17,102 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:26:17,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:26:17,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:26:17,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:26:17,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:26:17,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:26:17,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:26:17,104 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:26:17,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:26:17,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:26:17,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:26:17,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:26:17,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:26:17,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:26:17,107 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 -> 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac [2025-02-08 08:26:17,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:26:17,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:26:17,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:26:17,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:26:17,380 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:26:17,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:18,567 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddcb81612/7ebb2e6ca33240058fe333c65eae99ba/FLAGb960d5e3a [2025-02-08 08:26:18,897 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:26:18,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:18,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddcb81612/7ebb2e6ca33240058fe333c65eae99ba/FLAGb960d5e3a [2025-02-08 08:26:19,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ddcb81612/7ebb2e6ca33240058fe333c65eae99ba [2025-02-08 08:26:19,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:26:19,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:26:19,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:26:19,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:26:19,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:26:19,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2c206a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19, skipping insertion in model container [2025-02-08 08:26:19,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:26:19,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:26:19,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:26:19,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:26:19,506 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:26:19,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19 WrapperNode [2025-02-08 08:26:19,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:26:19,511 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:26:19,511 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:26:19,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:26:19,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,540 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 118 [2025-02-08 08:26:19,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:26:19,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:26:19,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:26:19,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:26:19,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:26:19,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,562 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:26:19,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:26:19,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:26:19,567 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:26:19,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (1/1) ... [2025-02-08 08:26:19,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:26:19,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:19,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:26:19,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:26:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:26:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:26:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:26:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:26:19,626 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:26:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:26:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:26:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:26:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:26:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:26:19,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:26:19,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:26:19,628 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:26:19,724 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:26:19,725 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:26:20,047 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:26:20,047 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:26:20,203 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:26:20,203 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:26:20,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:20 BoogieIcfgContainer [2025-02-08 08:26:20,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:26:20,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:26:20,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:26:20,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:26:20,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:26:19" (1/3) ... [2025-02-08 08:26:20,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ad2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:26:20, skipping insertion in model container [2025-02-08 08:26:20,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:19" (2/3) ... [2025-02-08 08:26:20,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@370ad2b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:26:20, skipping insertion in model container [2025-02-08 08:26:20,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:20" (3/3) ... [2025-02-08 08:26:20,210 INFO L128 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:20,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:26:20,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:26:20,221 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:26:20,265 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:26:20,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-02-08 08:26:20,312 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-02-08 08:26:20,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:20,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-08 08:26:20,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-02-08 08:26:20,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2025-02-08 08:26:20,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:26:20,349 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;@1e93143f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:26:20,349 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:26:20,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:26:20,355 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:26:20,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:20,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:20,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:26:20,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:20,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash 11369548, now seen corresponding path program 1 times [2025-02-08 08:26:20,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:20,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439918546] [2025-02-08 08:26:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:20,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:26:20,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:26:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:20,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:20,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439918546] [2025-02-08 08:26:20,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439918546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:20,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:20,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:26:20,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943712119] [2025-02-08 08:26:20,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:20,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:26:20,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:20,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:26:20,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:26:20,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:20,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:20,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:20,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:20,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:21,855 INFO L124 PetriNetUnfolderBase]: 4369/6366 cut-off events. [2025-02-08 08:26:21,855 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 08:26:21,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12687 conditions, 6366 events. 4369/6366 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35646 event pairs, 469 based on Foata normal form. 360/6725 useless extension candidates. Maximal degree in co-relation 12676. Up to 5461 conditions per place. [2025-02-08 08:26:21,892 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-08 08:26:21,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 233 flow [2025-02-08 08:26:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:26:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:26:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:26:21,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:26:21,905 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:26:21,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 233 flow [2025-02-08 08:26:21,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:26:21,912 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-02-08 08:26:21,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-02-08 08:26:21,919 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-02-08 08:26:21,920 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-02-08 08:26:21,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:21,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:21,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:21,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:26:21,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:21,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:21,922 INFO L85 PathProgramCache]: Analyzing trace with hash 187341129, now seen corresponding path program 1 times [2025-02-08 08:26:21,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:21,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632625960] [2025-02-08 08:26:21,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:21,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:21,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:26:21,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:26:21,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:21,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:22,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:22,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632625960] [2025-02-08 08:26:22,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632625960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:22,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:22,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:26:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868202741] [2025-02-08 08:26:22,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:22,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:26:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:22,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:26:22,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:26:22,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:22,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:22,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:22,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:22,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:22,504 INFO L124 PetriNetUnfolderBase]: 3925/6169 cut-off events. [2025-02-08 08:26:22,505 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-08 08:26:22,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6169 events. 3925/6169 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 36007 event pairs, 3925 based on Foata normal form. 180/6342 useless extension candidates. Maximal degree in co-relation 12137. Up to 5618 conditions per place. [2025-02-08 08:26:22,536 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 26 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-02-08 08:26:22,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 134 flow [2025-02-08 08:26:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:26:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:26:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 08:26:22,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2025-02-08 08:26:22,539 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 56 transitions. [2025-02-08 08:26:22,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 134 flow [2025-02-08 08:26:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:26:22,540 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-02-08 08:26:22,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-08 08:26:22,540 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-02-08 08:26:22,540 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-02-08 08:26:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:22,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:22,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:26:22,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 187342172, now seen corresponding path program 1 times [2025-02-08 08:26:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668865477] [2025-02-08 08:26:22,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:22,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:26:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:26:22,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:22,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:22,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:22,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668865477] [2025-02-08 08:26:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668865477] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:22,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:22,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:26:22,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784203507] [2025-02-08 08:26:22,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:22,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:26:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:22,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:26:22,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:26:22,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:22,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:22,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:22,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:22,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:23,737 INFO L124 PetriNetUnfolderBase]: 4791/7215 cut-off events. [2025-02-08 08:26:23,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:23,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14197 conditions, 7215 events. 4791/7215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 39975 event pairs, 684 based on Foata normal form. 0/7058 useless extension candidates. Maximal degree in co-relation 14191. Up to 4121 conditions per place. [2025-02-08 08:26:23,766 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 38 selfloop transitions, 2 changer transitions 65/110 dead transitions. [2025-02-08 08:26:23,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 110 transitions, 438 flow [2025-02-08 08:26:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:26:23,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:26:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2025-02-08 08:26:23,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5203488372093024 [2025-02-08 08:26:23,771 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 8 states and 179 transitions. [2025-02-08 08:26:23,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 110 transitions, 438 flow [2025-02-08 08:26:23,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 110 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:26:23,775 INFO L231 Difference]: Finished difference. Result has 53 places, 32 transitions, 87 flow [2025-02-08 08:26:23,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=87, PETRI_PLACES=53, PETRI_TRANSITIONS=32} [2025-02-08 08:26:23,776 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-02-08 08:26:23,776 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 32 transitions, 87 flow [2025-02-08 08:26:23,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:23,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:23,777 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:23,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:26:23,777 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:23,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:23,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1265720485, now seen corresponding path program 1 times [2025-02-08 08:26:23,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:23,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918559898] [2025-02-08 08:26:23,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:23,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:26:23,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:26:23,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:23,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918559898] [2025-02-08 08:26:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918559898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:23,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:23,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:26:23,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392257252] [2025-02-08 08:26:23,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:23,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:26:23,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:23,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:26:23,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:26:23,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:23,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 32 transitions, 87 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:23,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:23,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:24,828 INFO L124 PetriNetUnfolderBase]: 5981/9003 cut-off events. [2025-02-08 08:26:24,828 INFO L125 PetriNetUnfolderBase]: For 1994/1994 co-relation queries the response was YES. [2025-02-08 08:26:24,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19919 conditions, 9003 events. 5981/9003 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 53250 event pairs, 379 based on Foata normal form. 246/9249 useless extension candidates. Maximal degree in co-relation 19907. Up to 4459 conditions per place. [2025-02-08 08:26:24,866 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 56 selfloop transitions, 7 changer transitions 67/135 dead transitions. [2025-02-08 08:26:24,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 135 transitions, 589 flow [2025-02-08 08:26:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:26:24,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:26:24,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 223 transitions. [2025-02-08 08:26:24,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5186046511627908 [2025-02-08 08:26:24,868 INFO L175 Difference]: Start difference. First operand has 53 places, 32 transitions, 87 flow. Second operand 10 states and 223 transitions. [2025-02-08 08:26:24,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 135 transitions, 589 flow [2025-02-08 08:26:24,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 135 transitions, 553 flow, removed 14 selfloop flow, removed 6 redundant places. [2025-02-08 08:26:24,975 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 134 flow [2025-02-08 08:26:24,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2025-02-08 08:26:24,976 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2025-02-08 08:26:24,976 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 134 flow [2025-02-08 08:26:24,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:24,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:24,976 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-02-08 08:26:24,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:26:24,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:24,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:24,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2133676486, now seen corresponding path program 1 times [2025-02-08 08:26:24,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292113719] [2025-02-08 08:26:24,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:24,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:26:24,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:26:24,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:24,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:25,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292113719] [2025-02-08 08:26:25,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292113719] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:25,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:25,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:26:25,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547812604] [2025-02-08 08:26:25,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:25,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:26:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:25,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:26:25,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:26:25,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:25,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:25,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:25,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:25,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:26,185 INFO L124 PetriNetUnfolderBase]: 8213/12415 cut-off events. [2025-02-08 08:26:26,185 INFO L125 PetriNetUnfolderBase]: For 7355/7359 co-relation queries the response was YES. [2025-02-08 08:26:26,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30639 conditions, 12415 events. 8213/12415 cut-off events. For 7355/7359 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 76382 event pairs, 1781 based on Foata normal form. 220/12635 useless extension candidates. Maximal degree in co-relation 30623. Up to 5849 conditions per place. [2025-02-08 08:26:26,253 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 48 selfloop transitions, 5 changer transitions 41/99 dead transitions. [2025-02-08 08:26:26,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 513 flow [2025-02-08 08:26:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:26:26,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:26:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2025-02-08 08:26:26,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5542635658914729 [2025-02-08 08:26:26,255 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 134 flow. Second operand 6 states and 143 transitions. [2025-02-08 08:26:26,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 513 flow [2025-02-08 08:26:26,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 99 transitions, 501 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 08:26:26,305 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 146 flow [2025-02-08 08:26:26,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2025-02-08 08:26:26,306 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-02-08 08:26:26,306 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 146 flow [2025-02-08 08:26:26,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:26,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:26,307 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-02-08 08:26:26,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:26:26,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1471342022, now seen corresponding path program 2 times [2025-02-08 08:26:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312276578] [2025-02-08 08:26:26,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:26:26,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:26,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:26:26,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:26:26,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:26:26,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:26,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312276578] [2025-02-08 08:26:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312276578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:26:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062467960] [2025-02-08 08:26:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:26,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:26:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:26,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:26:26,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:26:26,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:26,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:26,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:26,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:26,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:26,878 INFO L124 PetriNetUnfolderBase]: 4034/6400 cut-off events. [2025-02-08 08:26:26,878 INFO L125 PetriNetUnfolderBase]: For 3520/3522 co-relation queries the response was YES. [2025-02-08 08:26:26,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15883 conditions, 6400 events. 4034/6400 cut-off events. For 3520/3522 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 37572 event pairs, 597 based on Foata normal form. 266/6664 useless extension candidates. Maximal degree in co-relation 15866. Up to 3560 conditions per place. [2025-02-08 08:26:26,908 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 63 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-02-08 08:26:26,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 422 flow [2025-02-08 08:26:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:26:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:26:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-08 08:26:26,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-02-08 08:26:26,910 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 146 flow. Second operand 4 states and 100 transitions. [2025-02-08 08:26:26,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 422 flow [2025-02-08 08:26:26,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 393 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-02-08 08:26:26,921 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 159 flow [2025-02-08 08:26:26,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2025-02-08 08:26:26,922 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-02-08 08:26:26,922 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 159 flow [2025-02-08 08:26:26,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:26,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:26,922 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] [2025-02-08 08:26:26,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:26:26,922 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:26,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:26,923 INFO L85 PathProgramCache]: Analyzing trace with hash -566206105, now seen corresponding path program 1 times [2025-02-08 08:26:26,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:26,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024264274] [2025-02-08 08:26:26,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:26,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:26,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:26:26,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:26:26,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:26,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:27,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:27,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024264274] [2025-02-08 08:26:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024264274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:27,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:26:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683659403] [2025-02-08 08:26:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:27,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:26:27,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:27,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:26:27,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:26:27,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:27,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:27,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:27,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:27,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:27,410 INFO L124 PetriNetUnfolderBase]: 2413/3863 cut-off events. [2025-02-08 08:26:27,410 INFO L125 PetriNetUnfolderBase]: For 2368/2370 co-relation queries the response was YES. [2025-02-08 08:26:27,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10242 conditions, 3863 events. 2413/3863 cut-off events. For 2368/2370 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 20268 event pairs, 305 based on Foata normal form. 208/4069 useless extension candidates. Maximal degree in co-relation 10227. Up to 1341 conditions per place. [2025-02-08 08:26:27,427 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 77 selfloop transitions, 8 changer transitions 2/92 dead transitions. [2025-02-08 08:26:27,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 530 flow [2025-02-08 08:26:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:26:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:26:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-08 08:26:27,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-02-08 08:26:27,429 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 159 flow. Second operand 5 states and 127 transitions. [2025-02-08 08:26:27,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 530 flow [2025-02-08 08:26:27,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 520 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:26:27,434 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 199 flow [2025-02-08 08:26:27,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-08 08:26:27,436 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-02-08 08:26:27,436 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 199 flow [2025-02-08 08:26:27,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:27,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:27,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:27,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:26:27,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:27,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1522540305, now seen corresponding path program 1 times [2025-02-08 08:26:27,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:27,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561466408] [2025-02-08 08:26:27,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:27,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:27,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:26:27,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:26:27,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:27,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:27,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561466408] [2025-02-08 08:26:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561466408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:26:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473922115] [2025-02-08 08:26:27,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:27,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:26:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:27,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:26:27,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:26:27,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:27,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:27,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:27,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:27,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:27,973 INFO L124 PetriNetUnfolderBase]: 1435/2261 cut-off events. [2025-02-08 08:26:27,974 INFO L125 PetriNetUnfolderBase]: For 2590/2592 co-relation queries the response was YES. [2025-02-08 08:26:27,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6602 conditions, 2261 events. 1435/2261 cut-off events. For 2590/2592 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10518 event pairs, 229 based on Foata normal form. 92/2351 useless extension candidates. Maximal degree in co-relation 6585. Up to 784 conditions per place. [2025-02-08 08:26:27,982 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 64 selfloop transitions, 11 changer transitions 3/83 dead transitions. [2025-02-08 08:26:27,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 494 flow [2025-02-08 08:26:27,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:26:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:26:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-02-08 08:26:27,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2025-02-08 08:26:27,987 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 199 flow. Second operand 6 states and 130 transitions. [2025-02-08 08:26:27,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 494 flow [2025-02-08 08:26:27,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 444 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-02-08 08:26:27,995 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 200 flow [2025-02-08 08:26:27,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=200, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-02-08 08:26:27,996 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2025-02-08 08:26:27,996 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 200 flow [2025-02-08 08:26:27,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:27,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:27,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:27,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:26:27,996 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:27,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -690308688, now seen corresponding path program 1 times [2025-02-08 08:26:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:27,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708781260] [2025-02-08 08:26:27,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:27,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:28,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:28,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:28,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:28,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:26:28,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708781260] [2025-02-08 08:26:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708781260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:26:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049300269] [2025-02-08 08:26:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:28,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 08:26:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:26:28,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 08:26:28,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:26:28,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:28,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 200 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:28,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:28,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:28,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:29,332 INFO L124 PetriNetUnfolderBase]: 1861/2926 cut-off events. [2025-02-08 08:26:29,332 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2025-02-08 08:26:29,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 2926 events. 1861/2926 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14300 event pairs, 630 based on Foata normal form. 8/2933 useless extension candidates. Maximal degree in co-relation 8386. Up to 1275 conditions per place. [2025-02-08 08:26:29,341 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 45 selfloop transitions, 4 changer transitions 72/126 dead transitions. [2025-02-08 08:26:29,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 126 transitions, 844 flow [2025-02-08 08:26:29,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:26:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:26:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2025-02-08 08:26:29,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-02-08 08:26:29,343 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 200 flow. Second operand 9 states and 172 transitions. [2025-02-08 08:26:29,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 126 transitions, 844 flow [2025-02-08 08:26:29,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 126 transitions, 650 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-02-08 08:26:29,354 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 171 flow [2025-02-08 08:26:29,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=171, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2025-02-08 08:26:29,356 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 15 predicate places. [2025-02-08 08:26:29,356 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 171 flow [2025-02-08 08:26:29,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:29,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:29,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:29,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:26:29,357 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1297562648, now seen corresponding path program 2 times [2025-02-08 08:26:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:26:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237247406] [2025-02-08 08:26:29,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:26:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:26:29,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:29,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:29,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:26:29,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:26:29,426 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:26:29,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:26:29,511 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:26:29,511 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:26:29,512 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:26:29,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:26:29,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:26:29,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:26:29,513 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:26:29,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:26:29,514 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:26:29,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:26:29,514 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:29,582 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:26:29,582 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:26:29,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:26:29 BasicIcfg [2025-02-08 08:26:29,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:26:29,586 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:26:29,586 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:26:29,586 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:26:29,587 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:20" (3/4) ... [2025-02-08 08:26:29,588 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:26:29,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:26:29,589 INFO L158 Benchmark]: Toolchain (without parser) took 10440.59ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 110.1MB in the beginning and 566.5MB in the end (delta: -456.4MB). Peak memory consumption was 194.1MB. Max. memory is 16.1GB. [2025-02-08 08:26:29,589 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:29,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.07ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 86.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:26:29,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.73ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:29,589 INFO L158 Benchmark]: Boogie Preprocessor took 25.21ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:29,590 INFO L158 Benchmark]: IcfgBuilder took 636.59ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 94.7MB in the end (delta: -13.4MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2025-02-08 08:26:29,590 INFO L158 Benchmark]: TraceAbstraction took 9380.43ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 94.0MB in the beginning and 566.6MB in the end (delta: -472.7MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2025-02-08 08:26:29,590 INFO L158 Benchmark]: Witness Printer took 2.25ms. Allocated memory is still 788.5MB. Free memory was 566.6MB in the beginning and 566.5MB in the end (delta: 165.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:26:29,595 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 125.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.07ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 86.8MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.73ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.21ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 82.0MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 636.59ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 94.7MB in the end (delta: -13.4MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9380.43ms. Allocated memory was 142.6MB in the beginning and 788.5MB in the end (delta: 645.9MB). Free memory was 94.0MB in the beginning and 566.6MB in the end (delta: -472.7MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. * Witness Printer took 2.25ms. Allocated memory is still 788.5MB. Free memory was 566.6MB in the beginning and 566.5MB in the end (delta: 165.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-2, t2394=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-2, t2394=-1, t2395=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-2, t2394=-1, t2395=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-2, t2394=-1, t2395=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-2, t2394=-1, t2395=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 829]: 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: 833]: 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: 831]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1438 IncrementalHoareTripleChecker+Invalid, 1462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 3 mSDtfsCounter, 1438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=8, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 08:26:29,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe026_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 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:26:31,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:26:31,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-02-08 08:26:31,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:26:31,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:26:31,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:26:31,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:26:31,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:26:31,854 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:26:31,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:26:31,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:26:31,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:26:31,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:26:31,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:26:31,859 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:26:31,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:26:31,859 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:26:31,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:26:31,860 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:26:31,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:26:31,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:26:31,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:26:31,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:26:31,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:26:31,861 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 -> 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac [2025-02-08 08:26:32,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:26:32,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:26:32,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:26:32,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:26:32,141 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:26:32,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:33,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3315b57a3/d569943644e046a8ad8530897bbaa657/FLAGbaacb0ced [2025-02-08 08:26:33,673 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:26:33,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:33,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3315b57a3/d569943644e046a8ad8530897bbaa657/FLAGbaacb0ced [2025-02-08 08:26:33,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3315b57a3/d569943644e046a8ad8530897bbaa657 [2025-02-08 08:26:33,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:26:33,714 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:26:33,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:26:33,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:26:33,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:26:33,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:26:33" (1/1) ... [2025-02-08 08:26:33,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c295f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:33, skipping insertion in model container [2025-02-08 08:26:33,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:26:33" (1/1) ... [2025-02-08 08:26:33,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:26:34,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:26:34,022 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:26:34,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:26:34,119 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:26:34,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34 WrapperNode [2025-02-08 08:26:34,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:26:34,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:26:34,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:26:34,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:26:34,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,168 INFO L138 Inliner]: procedures = 176, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2025-02-08 08:26:34,170 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:26:34,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:26:34,171 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:26:34,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:26:34,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,198 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 08:26:34,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:26:34,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:26:34,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:26:34,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:26:34,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (1/1) ... [2025-02-08 08:26:34,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:26:34,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:34,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:26:34,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:26:34,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:26:34,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:26:34,267 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-02-08 08:26:34,267 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-02-08 08:26:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:26:34,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:26:34,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:26:34,269 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:26:34,376 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:26:34,378 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:26:34,687 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:26:34,687 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:26:34,912 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:26:34,912 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:26:34,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:34 BoogieIcfgContainer [2025-02-08 08:26:34,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:26:34,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:26:34,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:26:34,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:26:34,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:26:33" (1/3) ... [2025-02-08 08:26:34,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d1c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:26:34, skipping insertion in model container [2025-02-08 08:26:34,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:26:34" (2/3) ... [2025-02-08 08:26:34,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d1c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:26:34, skipping insertion in model container [2025-02-08 08:26:34,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:34" (3/3) ... [2025-02-08 08:26:34,919 INFO L128 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-02-08 08:26:34,929 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:26:34,930 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 42 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2025-02-08 08:26:34,931 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:26:34,968 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:26:34,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 98 flow [2025-02-08 08:26:35,004 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-02-08 08:26:35,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:35,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 2/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-02-08 08:26:35,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 43 transitions, 98 flow [2025-02-08 08:26:35,010 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 40 transitions, 89 flow [2025-02-08 08:26:35,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:26:35,021 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;@511ad2c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:26:35,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-08 08:26:35,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:26:35,024 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-02-08 08:26:35,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:35,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:35,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:26:35,024 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:35,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 11431116, now seen corresponding path program 1 times [2025-02-08 08:26:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26848406] [2025-02-08 08:26:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:35,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:35,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:35,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:26:35,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:26:35,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:26:35,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:35,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:35,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:26:35,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:35,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:35,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:35,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26848406] [2025-02-08 08:26:35,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26848406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:35,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:35,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:26:35,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562162656] [2025-02-08 08:26:35,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:35,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:26:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:35,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:26:35,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:26:35,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:35,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:35,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:35,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:35,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:36,027 INFO L124 PetriNetUnfolderBase]: 4369/6366 cut-off events. [2025-02-08 08:26:36,027 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 08:26:36,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12687 conditions, 6366 events. 4369/6366 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 35696 event pairs, 469 based on Foata normal form. 360/6725 useless extension candidates. Maximal degree in co-relation 12676. Up to 5461 conditions per place. [2025-02-08 08:26:36,068 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 47 selfloop transitions, 2 changer transitions 2/58 dead transitions. [2025-02-08 08:26:36,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 58 transitions, 233 flow [2025-02-08 08:26:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:26:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:26:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2025-02-08 08:26:36,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-08 08:26:36,077 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 89 flow. Second operand 3 states and 86 transitions. [2025-02-08 08:26:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 58 transitions, 233 flow [2025-02-08 08:26:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:26:36,086 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2025-02-08 08:26:36,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2025-02-08 08:26:36,095 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2025-02-08 08:26:36,095 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2025-02-08 08:26:36,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:36,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:36,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:36,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:26:36,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:36,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:36,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -419356789, now seen corresponding path program 1 times [2025-02-08 08:26:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [810583261] [2025-02-08 08:26:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:36,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:36,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:36,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:36,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:26:36,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:26:36,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:26:36,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:36,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:36,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:26:36,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:36,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:36,417 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:36,417 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810583261] [2025-02-08 08:26:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810583261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:36,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:36,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:26:36,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419124318] [2025-02-08 08:26:36,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:36,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:26:36,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:36,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:26:36,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:26:36,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2025-02-08 08:26:36,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:36,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:36,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2025-02-08 08:26:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:36,968 INFO L124 PetriNetUnfolderBase]: 3925/6169 cut-off events. [2025-02-08 08:26:36,969 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-02-08 08:26:36,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12147 conditions, 6169 events. 3925/6169 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 35948 event pairs, 3925 based on Foata normal form. 180/6342 useless extension candidates. Maximal degree in co-relation 12137. Up to 5618 conditions per place. [2025-02-08 08:26:36,998 INFO L140 encePairwiseOnDemand]: 41/43 looper letters, 26 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2025-02-08 08:26:36,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 134 flow [2025-02-08 08:26:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:26:36,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:26:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-02-08 08:26:36,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43410852713178294 [2025-02-08 08:26:36,999 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 3 states and 56 transitions. [2025-02-08 08:26:36,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 134 flow [2025-02-08 08:26:37,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:26:37,000 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2025-02-08 08:26:37,001 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-02-08 08:26:37,001 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2025-02-08 08:26:37,001 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2025-02-08 08:26:37,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:37,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:37,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:37,010 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-02-08 08:26:37,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:37,202 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:37,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash -419355746, now seen corresponding path program 1 times [2025-02-08 08:26:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [404469735] [2025-02-08 08:26:37,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:37,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:37,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:26:37,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:26:37,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:26:37,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:37,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:37,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:26:37,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:37,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:37,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404469735] [2025-02-08 08:26:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404469735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:26:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930588191] [2025-02-08 08:26:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:37,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:26:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:37,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:26:37,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:26:37,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:37,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:37,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:37,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:37,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:37,709 INFO L124 PetriNetUnfolderBase]: 2929/4741 cut-off events. [2025-02-08 08:26:37,709 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:26:37,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9153 conditions, 4741 events. 2929/4741 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27930 event pairs, 411 based on Foata normal form. 180/4916 useless extension candidates. Maximal degree in co-relation 9147. Up to 2593 conditions per place. [2025-02-08 08:26:37,725 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 52 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2025-02-08 08:26:37,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 64 transitions, 256 flow [2025-02-08 08:26:37,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:26:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:26:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-02-08 08:26:37,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-02-08 08:26:37,727 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 4 states and 100 transitions. [2025-02-08 08:26:37,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 64 transitions, 256 flow [2025-02-08 08:26:37,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 64 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:26:37,728 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 107 flow [2025-02-08 08:26:37,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2025-02-08 08:26:37,729 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-02-08 08:26:37,729 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 107 flow [2025-02-08 08:26:37,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:37,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:37,729 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-02-08 08:26:37,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:26:37,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:37,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:37,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1783958358, now seen corresponding path program 1 times [2025-02-08 08:26:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:37,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394607448] [2025-02-08 08:26:37,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:37,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:37,933 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:37,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:26:37,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:26:37,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:26:37,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:37,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:37,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:26:37,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:38,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:38,025 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394607448] [2025-02-08 08:26:38,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394607448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:38,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:38,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:26:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966861692] [2025-02-08 08:26:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:38,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:26:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:38,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:26:38,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:26:38,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:38,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:38,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:38,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:38,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:38,309 INFO L124 PetriNetUnfolderBase]: 1665/2709 cut-off events. [2025-02-08 08:26:38,309 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2025-02-08 08:26:38,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 2709 events. 1665/2709 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 13763 event pairs, 253 based on Foata normal form. 132/2836 useless extension candidates. Maximal degree in co-relation 6131. Up to 913 conditions per place. [2025-02-08 08:26:38,319 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 66 selfloop transitions, 8 changer transitions 1/81 dead transitions. [2025-02-08 08:26:38,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 81 transitions, 368 flow [2025-02-08 08:26:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:26:38,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:26:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-08 08:26:38,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5906976744186047 [2025-02-08 08:26:38,322 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 107 flow. Second operand 5 states and 127 transitions. [2025-02-08 08:26:38,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 81 transitions, 368 flow [2025-02-08 08:26:38,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 81 transitions, 358 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:26:38,324 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 147 flow [2025-02-08 08:26:38,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2025-02-08 08:26:38,325 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2025-02-08 08:26:38,325 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 147 flow [2025-02-08 08:26:38,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:38,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:38,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:38,333 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-02-08 08:26:38,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:38,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:38,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash -438387301, now seen corresponding path program 1 times [2025-02-08 08:26:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:38,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683047497] [2025-02-08 08:26:38,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:38,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:38,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:38,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:38,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:26:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 08:26:38,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 08:26:38,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:38,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:38,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 08:26:38,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:38,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:38,630 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:38,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683047497] [2025-02-08 08:26:38,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683047497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:38,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:38,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:26:38,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697818041] [2025-02-08 08:26:38,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:38,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:26:38,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:38,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:26:38,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:26:38,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:38,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:38,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:38,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:38,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:38,857 INFO L124 PetriNetUnfolderBase]: 981/1549 cut-off events. [2025-02-08 08:26:38,857 INFO L125 PetriNetUnfolderBase]: For 1038/1038 co-relation queries the response was YES. [2025-02-08 08:26:38,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3922 conditions, 1549 events. 981/1549 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6774 event pairs, 223 based on Foata normal form. 52/1596 useless extension candidates. Maximal degree in co-relation 3911. Up to 556 conditions per place. [2025-02-08 08:26:38,862 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 56 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2025-02-08 08:26:38,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 363 flow [2025-02-08 08:26:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:26:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 08:26:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2025-02-08 08:26:38,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5038759689922481 [2025-02-08 08:26:38,864 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 147 flow. Second operand 6 states and 130 transitions. [2025-02-08 08:26:38,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 363 flow [2025-02-08 08:26:38,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 338 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 08:26:38,869 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 161 flow [2025-02-08 08:26:38,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2025-02-08 08:26:38,870 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2025-02-08 08:26:38,870 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 161 flow [2025-02-08 08:26:38,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:38,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:38,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:38,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:26:39,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:39,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:39,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1160161574, now seen corresponding path program 1 times [2025-02-08 08:26:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338569838] [2025-02-08 08:26:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:26:39,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:39,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:39,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:39,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:26:39,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:39,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:39,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:39,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:39,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:26:39,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:39,267 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:39,267 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:39,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338569838] [2025-02-08 08:26:39,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338569838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:39,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:39,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:26:39,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129623229] [2025-02-08 08:26:39,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:39,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:26:39,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:39,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:26:39,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:26:39,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:39,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 161 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:39,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:39,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:39,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:39,556 INFO L124 PetriNetUnfolderBase]: 1349/2135 cut-off events. [2025-02-08 08:26:39,556 INFO L125 PetriNetUnfolderBase]: For 1650/1650 co-relation queries the response was YES. [2025-02-08 08:26:39,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5569 conditions, 2135 events. 1349/2135 cut-off events. For 1650/1650 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10060 event pairs, 269 based on Foata normal form. 8/2139 useless extension candidates. Maximal degree in co-relation 5557. Up to 913 conditions per place. [2025-02-08 08:26:39,562 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 58 selfloop transitions, 10 changer transitions 24/98 dead transitions. [2025-02-08 08:26:39,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 98 transitions, 545 flow [2025-02-08 08:26:39,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:26:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:26:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-02-08 08:26:39,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48546511627906974 [2025-02-08 08:26:39,563 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 161 flow. Second operand 8 states and 167 transitions. [2025-02-08 08:26:39,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 98 transitions, 545 flow [2025-02-08 08:26:39,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 98 transitions, 436 flow, removed 20 selfloop flow, removed 8 redundant places. [2025-02-08 08:26:39,570 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 149 flow [2025-02-08 08:26:39,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-02-08 08:26:39,571 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2025-02-08 08:26:39,571 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 149 flow [2025-02-08 08:26:39,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:39,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:39,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:39,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 08:26:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:39,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:39,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1661200130, now seen corresponding path program 2 times [2025-02-08 08:26:39,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:39,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1149975999] [2025-02-08 08:26:39,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:26:39,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:39,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:26:39,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:26:39,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:39,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:39,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:26:39,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:39,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:26:39,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:39,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-02-08 08:26:39,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:39,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149975999] [2025-02-08 08:26:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149975999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:39,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:26:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18599261] [2025-02-08 08:26:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:26:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:39,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:26:39,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:26:39,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:39,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 149 flow. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:39,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:39,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:39,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:40,260 INFO L124 PetriNetUnfolderBase]: 1063/1709 cut-off events. [2025-02-08 08:26:40,261 INFO L125 PetriNetUnfolderBase]: For 468/469 co-relation queries the response was YES. [2025-02-08 08:26:40,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4093 conditions, 1709 events. 1063/1709 cut-off events. For 468/469 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7382 event pairs, 213 based on Foata normal form. 9/1718 useless extension candidates. Maximal degree in co-relation 4081. Up to 731 conditions per place. [2025-02-08 08:26:40,268 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 7 changer transitions 28/95 dead transitions. [2025-02-08 08:26:40,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 489 flow [2025-02-08 08:26:40,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:26:40,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:26:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-02-08 08:26:40,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4850498338870432 [2025-02-08 08:26:40,270 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 149 flow. Second operand 7 states and 146 transitions. [2025-02-08 08:26:40,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 489 flow [2025-02-08 08:26:40,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 456 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:26:40,273 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 187 flow [2025-02-08 08:26:40,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2025-02-08 08:26:40,274 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2025-02-08 08:26:40,274 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 187 flow [2025-02-08 08:26:40,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:40,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:40,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:40,281 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-02-08 08:26:40,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:40,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1944323396, now seen corresponding path program 3 times [2025-02-08 08:26:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035649982] [2025-02-08 08:26:40,476 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:26:40,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:40,479 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-02-08 08:26:40,480 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-02-08 08:26:40,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:40,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:40,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:26:40,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:26:40,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:26:40,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:26:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:26:40,847 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:26:40,847 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:26:40,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035649982] [2025-02-08 08:26:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035649982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:26:40,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:26:40,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 08:26:40,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222331838] [2025-02-08 08:26:40,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:26:40,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 08:26:40,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:26:40,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 08:26:40,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 08:26:40,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2025-02-08 08:26:40,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 187 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:40,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:26:40,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2025-02-08 08:26:40,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:26:41,211 INFO L124 PetriNetUnfolderBase]: 869/1413 cut-off events. [2025-02-08 08:26:41,212 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-02-08 08:26:41,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 1413 events. 869/1413 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6078 event pairs, 98 based on Foata normal form. 8/1421 useless extension candidates. Maximal degree in co-relation 3533. Up to 670 conditions per place. [2025-02-08 08:26:41,217 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 4 changer transitions 46/110 dead transitions. [2025-02-08 08:26:41,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 110 transitions, 617 flow [2025-02-08 08:26:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:26:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 08:26:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2025-02-08 08:26:41,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4116279069767442 [2025-02-08 08:26:41,218 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 187 flow. Second operand 10 states and 177 transitions. [2025-02-08 08:26:41,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 110 transitions, 617 flow [2025-02-08 08:26:41,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 571 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-02-08 08:26:41,220 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 166 flow [2025-02-08 08:26:41,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=166, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-02-08 08:26:41,222 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2025-02-08 08:26:41,222 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 166 flow [2025-02-08 08:26:41,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:26:41,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:26:41,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:26:41,232 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-02-08 08:26:41,423 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-02-08 08:26:41,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2025-02-08 08:26:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:26:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 244455040, now seen corresponding path program 4 times [2025-02-08 08:26:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:26:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [11977828] [2025-02-08 08:26:41,425 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:26:41,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:26:41,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:26:41,427 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-02-08 08:26:41,428 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-02-08 08:26:41,481 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-02-08 08:26:41,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:41,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 08:26:41,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:26:41,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:26:41,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 08:26:41,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 08:26:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:26:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:26:41,581 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:26:41,581 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:26:41,582 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2025-02-08 08:26:41,583 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2025-02-08 08:26:41,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2025-02-08 08:26:41,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-02-08 08:26:41,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-02-08 08:26:41,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-02-08 08:26:41,584 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2025-02-08 08:26:41,591 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-02-08 08:26:41,784 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-02-08 08:26:41,785 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2025-02-08 08:26:41,849 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:26:41,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:26:41,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:26:41 BasicIcfg [2025-02-08 08:26:41,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:26:41,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:26:41,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:26:41,856 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:26:41,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:26:34" (3/4) ... [2025-02-08 08:26:41,858 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:26:41,858 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:26:41,859 INFO L158 Benchmark]: Toolchain (without parser) took 8144.34ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 88.6MB in the beginning and 159.3MB in the end (delta: -70.7MB). Peak memory consumption was 239.9MB. Max. memory is 16.1GB. [2025-02-08 08:26:41,859 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:41,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.35ms. Allocated memory is still 117.4MB. Free memory was 88.4MB in the beginning and 65.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:26:41,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.26ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:41,861 INFO L158 Benchmark]: Boogie Preprocessor took 38.13ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 60.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:41,861 INFO L158 Benchmark]: IcfgBuilder took 703.09ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 82.0MB in the end (delta: -22.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-02-08 08:26:41,861 INFO L158 Benchmark]: TraceAbstraction took 6941.27ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 81.4MB in the beginning and 159.5MB in the end (delta: -78.2MB). Peak memory consumption was 233.3MB. Max. memory is 16.1GB. [2025-02-08 08:26:41,861 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 427.8MB. Free memory was 159.5MB in the beginning and 159.3MB in the end (delta: 205.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:26:41,862 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.26ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.35ms. Allocated memory is still 117.4MB. Free memory was 88.4MB in the beginning and 65.1MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.26ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 63.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.13ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 60.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 703.09ms. Allocated memory is still 117.4MB. Free memory was 60.0MB in the beginning and 82.0MB in the end (delta: -22.0MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6941.27ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 81.4MB in the beginning and 159.5MB in the end (delta: -78.2MB). Peak memory consumption was 233.3MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 427.8MB. Free memory was 159.5MB in the beginning and 159.3MB in the end (delta: 205.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, t2394=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L787] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393=-1, t2394=0, t2395=1, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L17] 0 __assert_fail ("0", "safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that 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: 829]: 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: 833]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 461 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 6 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 193 NumberOfCodeBlocks, 193 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 23 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 56 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-02-08 08:26:41,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample