./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_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/safe006_rmo.oepc_rmo.opt-thin000_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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:23:30,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:23:30,195 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:23:30,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:23:30,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:23:30,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:23:30,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:23:30,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:23:30,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:23:30,226 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:23:30,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:23:30,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:23:30,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:23:30,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:23:30,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:23:30,228 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:23:30,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:23:30,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:30,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:23:30,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:23:30,231 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2025-02-08 08:23:30,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:23:30,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:23:30,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:23:30,465 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:23:30,465 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:23:30,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:31,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8c4749ed/9701566cc8294bcf811d42a4a56a35ca/FLAGd76405248 [2025-02-08 08:23:32,002 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:23:32,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:32,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8c4749ed/9701566cc8294bcf811d42a4a56a35ca/FLAGd76405248 [2025-02-08 08:23:32,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c8c4749ed/9701566cc8294bcf811d42a4a56a35ca [2025-02-08 08:23:32,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:23:32,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:23:32,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:32,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:23:32,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:23:32,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,220 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@585f829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32, skipping insertion in model container [2025-02-08 08:23:32,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:23:32,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:32,513 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:23:32,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:32,589 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:23:32,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32 WrapperNode [2025-02-08 08:23:32,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:32,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:32,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:23:32,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:23:32,595 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:23:32" (1/1) ... [2025-02-08 08:23:32,605 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:23:32" (1/1) ... [2025-02-08 08:23:32,627 INFO L138 Inliner]: procedures = 174, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-02-08 08:23:32,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:32,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:23:32,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:23:32,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:23:32,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,650 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-08 08:23:32,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:23:32,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:23:32,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:23:32,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:23:32,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (1/1) ... [2025-02-08 08:23:32,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:32,696 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:23:32,702 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:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:23:32,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:23:32,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:23:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:23:32,719 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:23:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:23:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:23:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:23:32,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:23:32,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:23:32,720 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:23:32,816 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:23:32,818 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:23:33,113 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:23:33,113 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:23:33,364 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:23:33,364 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:23:33,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:33 BoogieIcfgContainer [2025-02-08 08:23:33,365 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:23:33,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:23:33,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:23:33,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:23:33,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:23:32" (1/3) ... [2025-02-08 08:23:33,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4c4763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:33, skipping insertion in model container [2025-02-08 08:23:33,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:32" (2/3) ... [2025-02-08 08:23:33,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b4c4763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:33, skipping insertion in model container [2025-02-08 08:23:33,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:33" (3/3) ... [2025-02-08 08:23:33,371 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:33,383 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:23:33,385 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 26 error locations. [2025-02-08 08:23:33,385 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:23:33,445 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:23:33,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 58 transitions, 124 flow [2025-02-08 08:23:33,485 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2025-02-08 08:23:33,490 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:33,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 56 events. 2/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-02-08 08:23:33,493 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 58 transitions, 124 flow [2025-02-08 08:23:33,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 56 transitions, 118 flow [2025-02-08 08:23:33,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:23:33,510 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;@1547c725, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:23:33,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 08:23:33,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:23:33,513 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-08 08:23:33,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:33,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:33,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:23:33,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:33,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 16752456, now seen corresponding path program 1 times [2025-02-08 08:23:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023199560] [2025-02-08 08:23:33,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:33,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:23:33,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:23:33,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:33,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:33,743 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:23:33,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:33,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023199560] [2025-02-08 08:23:33,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023199560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:33,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:33,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920579512] [2025-02-08 08:23:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:33,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:33,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:33,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:33,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:33,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:33,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:33,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:33,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:33,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:34,240 INFO L124 PetriNetUnfolderBase]: 1490/2629 cut-off events. [2025-02-08 08:23:34,240 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:23:34,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 2629 events. 1490/2629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15803 event pairs, 1490 based on Foata normal form. 126/2070 useless extension candidates. Maximal degree in co-relation 5026. Up to 2387 conditions per place. [2025-02-08 08:23:34,263 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 30 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-02-08 08:23:34,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 142 flow [2025-02-08 08:23:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 08:23:34,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41954022988505746 [2025-02-08 08:23:34,274 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 118 flow. Second operand 3 states and 73 transitions. [2025-02-08 08:23:34,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 142 flow [2025-02-08 08:23:34,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:34,279 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2025-02-08 08:23:34,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-02-08 08:23:34,283 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places. [2025-02-08 08:23:34,283 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2025-02-08 08:23:34,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:34,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:34,283 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:23:34,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:23:34,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:34,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:34,284 INFO L85 PathProgramCache]: Analyzing trace with hash 16752457, now seen corresponding path program 1 times [2025-02-08 08:23:34,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:34,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978187393] [2025-02-08 08:23:34,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:34,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:34,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:23:34,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:23:34,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:34,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:34,402 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:23:34,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:34,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978187393] [2025-02-08 08:23:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978187393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:34,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654306243] [2025-02-08 08:23:34,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:34,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:34,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:34,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:34,550 INFO L124 PetriNetUnfolderBase]: 695/1275 cut-off events. [2025-02-08 08:23:34,550 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:34,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1275 events. 695/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6713 event pairs, 695 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2427. Up to 1140 conditions per place. [2025-02-08 08:23:34,556 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 23 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-02-08 08:23:34,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 118 flow [2025-02-08 08:23:34,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 08:23:34,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3160919540229885 [2025-02-08 08:23:34,557 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 55 transitions. [2025-02-08 08:23:34,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 118 flow [2025-02-08 08:23:34,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:34,558 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2025-02-08 08:23:34,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-08 08:23:34,558 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2025-02-08 08:23:34,559 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2025-02-08 08:23:34,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:34,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:34,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:34,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:23:34,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:34,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash -536349916, now seen corresponding path program 1 times [2025-02-08 08:23:34,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:34,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605440780] [2025-02-08 08:23:34,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:34,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:34,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:23:34,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:23:34,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:34,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:34,707 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:23:34,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605440780] [2025-02-08 08:23:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605440780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:34,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:34,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:34,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246601479] [2025-02-08 08:23:34,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:34,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:34,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:34,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:34,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:34,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:34,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 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:23:34,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:34,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:34,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:34,865 INFO L124 PetriNetUnfolderBase]: 613/1034 cut-off events. [2025-02-08 08:23:34,866 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:34,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 1034 events. 613/1034 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5166 event pairs, 88 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2056. Up to 914 conditions per place. [2025-02-08 08:23:34,871 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 37 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-02-08 08:23:34,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 177 flow [2025-02-08 08:23:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:34,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-08 08:23:34,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3735632183908046 [2025-02-08 08:23:34,873 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 65 transitions. [2025-02-08 08:23:34,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 177 flow [2025-02-08 08:23:34,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:34,874 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2025-02-08 08:23:34,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-02-08 08:23:34,875 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2025-02-08 08:23:34,875 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2025-02-08 08:23:34,875 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:23:34,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:34,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:34,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:23:34,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1084945963, now seen corresponding path program 1 times [2025-02-08 08:23:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699154676] [2025-02-08 08:23:34,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:34,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:34,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:34,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:34,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:35,019 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:23:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:35,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699154676] [2025-02-08 08:23:35,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699154676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:35,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:35,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:35,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142875654] [2025-02-08 08:23:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:35,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:35,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:35,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:35,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:35,025 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:35,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:35,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:35,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:35,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:35,213 INFO L124 PetriNetUnfolderBase]: 564/955 cut-off events. [2025-02-08 08:23:35,213 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:23:35,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 955 events. 564/955 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4744 event pairs, 64 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2040. Up to 834 conditions per place. [2025-02-08 08:23:35,222 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-02-08 08:23:35,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 180 flow [2025-02-08 08:23:35,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:35,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-02-08 08:23:35,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30603448275862066 [2025-02-08 08:23:35,226 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 71 transitions. [2025-02-08 08:23:35,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 180 flow [2025-02-08 08:23:35,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:35,231 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2025-02-08 08:23:35,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-02-08 08:23:35,232 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2025-02-08 08:23:35,232 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2025-02-08 08:23:35,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:35,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:35,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:23:35,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash -36173832, now seen corresponding path program 1 times [2025-02-08 08:23:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289649604] [2025-02-08 08:23:35,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:35,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:35,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:35,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:35,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:35,620 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:23:35,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:35,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289649604] [2025-02-08 08:23:35,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289649604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:35,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:35,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:35,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364492004] [2025-02-08 08:23:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:35,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:35,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:35,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:35,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:35,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:35,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:35,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:35,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:35,791 INFO L124 PetriNetUnfolderBase]: 515/876 cut-off events. [2025-02-08 08:23:35,792 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:23:35,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 876 events. 515/876 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4317 event pairs, 40 based on Foata normal form. 30/904 useless extension candidates. Maximal degree in co-relation 1852. Up to 755 conditions per place. [2025-02-08 08:23:35,796 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-02-08 08:23:35,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 174 flow [2025-02-08 08:23:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-08 08:23:35,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3017241379310345 [2025-02-08 08:23:35,797 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 70 transitions. [2025-02-08 08:23:35,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 174 flow [2025-02-08 08:23:35,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:35,799 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2025-02-08 08:23:35,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-02-08 08:23:35,799 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2025-02-08 08:23:35,799 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2025-02-08 08:23:35,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:35,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:35,800 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:35,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:23:35,800 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:35,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:35,801 INFO L85 PathProgramCache]: Analyzing trace with hash -404955943, now seen corresponding path program 1 times [2025-02-08 08:23:35,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:35,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977524783] [2025-02-08 08:23:35,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:35,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:35,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:35,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:35,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:35,838 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:23:35,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977524783] [2025-02-08 08:23:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977524783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892921499] [2025-02-08 08:23:35,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:35,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:35,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:35,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:35,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 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:23:35,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:35,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:35,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:35,941 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-08 08:23:35,941 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 08:23:35,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 957 events. 515/957 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4725 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1933. Up to 852 conditions per place. [2025-02-08 08:23:35,944 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-08 08:23:35,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 109 flow [2025-02-08 08:23:35,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-08 08:23:35,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25287356321839083 [2025-02-08 08:23:35,946 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 44 transitions. [2025-02-08 08:23:35,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 109 flow [2025-02-08 08:23:35,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:35,946 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2025-02-08 08:23:35,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-02-08 08:23:35,947 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -23 predicate places. [2025-02-08 08:23:35,947 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2025-02-08 08:23:35,947 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:23:35,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:35,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:35,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:23:35,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:35,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -404953531, now seen corresponding path program 1 times [2025-02-08 08:23:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029550889] [2025-02-08 08:23:35,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:35,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:35,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:35,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:35,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:36,111 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:23:36,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:36,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029550889] [2025-02-08 08:23:36,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029550889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:36,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:36,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:36,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736391032] [2025-02-08 08:23:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:36,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:36,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:36,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:36,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:36,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:36,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:23:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:36,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:36,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:36,356 INFO L124 PetriNetUnfolderBase]: 652/1165 cut-off events. [2025-02-08 08:23:36,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:36,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1165 events. 652/1165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5918 event pairs, 279 based on Foata normal form. 0/1129 useless extension candidates. Maximal degree in co-relation 2410. Up to 740 conditions per place. [2025-02-08 08:23:36,361 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 26 selfloop transitions, 3 changer transitions 40/73 dead transitions. [2025-02-08 08:23:36,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 73 transitions, 308 flow [2025-02-08 08:23:36,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-02-08 08:23:36,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27370689655172414 [2025-02-08 08:23:36,362 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 8 states and 127 transitions. [2025-02-08 08:23:36,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 73 transitions, 308 flow [2025-02-08 08:23:36,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:36,364 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 96 flow [2025-02-08 08:23:36,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2025-02-08 08:23:36,364 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -13 predicate places. [2025-02-08 08:23:36,364 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 96 flow [2025-02-08 08:23:36,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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:23:36,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:36,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:36,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:23:36,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:36,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1021290088, now seen corresponding path program 1 times [2025-02-08 08:23:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:36,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145273685] [2025-02-08 08:23:36,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:36,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:36,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:36,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:36,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:36,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:36,528 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:23:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:36,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145273685] [2025-02-08 08:23:36,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145273685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:36,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928749700] [2025-02-08 08:23:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:36,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:36,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:36,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:36,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:36,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:36,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 27 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:23:36,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:36,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:36,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:36,721 INFO L124 PetriNetUnfolderBase]: 495/901 cut-off events. [2025-02-08 08:23:36,721 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2025-02-08 08:23:36,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2323 conditions, 901 events. 495/901 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4133 event pairs, 102 based on Foata normal form. 30/928 useless extension candidates. Maximal degree in co-relation 2309. Up to 633 conditions per place. [2025-02-08 08:23:36,725 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 28 selfloop transitions, 3 changer transitions 29/64 dead transitions. [2025-02-08 08:23:36,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 312 flow [2025-02-08 08:23:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:23:36,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:23:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-02-08 08:23:36,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.270935960591133 [2025-02-08 08:23:36,726 INFO L175 Difference]: Start difference. First operand has 48 places, 27 transitions, 96 flow. Second operand 7 states and 110 transitions. [2025-02-08 08:23:36,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 312 flow [2025-02-08 08:23:36,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 295 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:36,730 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 106 flow [2025-02-08 08:23:36,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2025-02-08 08:23:36,730 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2025-02-08 08:23:36,730 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 106 flow [2025-02-08 08:23:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:23:36,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:36,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:36,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:23:36,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:36,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash -2054318108, now seen corresponding path program 1 times [2025-02-08 08:23:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255713877] [2025-02-08 08:23:36,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:36,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 08:23:36,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 08:23:36,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:36,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255713877] [2025-02-08 08:23:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255713877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:23:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847808844] [2025-02-08 08:23:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:23:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:36,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:23:36,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:23:36,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:36,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:23:36,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:36,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:36,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:37,112 INFO L124 PetriNetUnfolderBase]: 601/1057 cut-off events. [2025-02-08 08:23:37,113 INFO L125 PetriNetUnfolderBase]: For 779/779 co-relation queries the response was YES. [2025-02-08 08:23:37,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1057 events. 601/1057 cut-off events. For 779/779 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5086 event pairs, 94 based on Foata normal form. 30/1085 useless extension candidates. Maximal degree in co-relation 2704. Up to 409 conditions per place. [2025-02-08 08:23:37,117 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 31 selfloop transitions, 3 changer transitions 41/79 dead transitions. [2025-02-08 08:23:37,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 405 flow [2025-02-08 08:23:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:37,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2025-02-08 08:23:37,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2823275862068966 [2025-02-08 08:23:37,120 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 106 flow. Second operand 8 states and 131 transitions. [2025-02-08 08:23:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 405 flow [2025-02-08 08:23:37,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 371 flow, removed 13 selfloop flow, removed 6 redundant places. [2025-02-08 08:23:37,127 INFO L231 Difference]: Finished difference. Result has 53 places, 25 transitions, 97 flow [2025-02-08 08:23:37,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=97, PETRI_PLACES=53, PETRI_TRANSITIONS=25} [2025-02-08 08:23:37,128 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -8 predicate places. [2025-02-08 08:23:37,128 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 25 transitions, 97 flow [2025-02-08 08:23:37,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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:23:37,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:37,129 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:37,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:23:37,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:37,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:37,131 INFO L85 PathProgramCache]: Analyzing trace with hash -117379353, now seen corresponding path program 1 times [2025-02-08 08:23:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068642775] [2025-02-08 08:23:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:37,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:23:37,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:23:37,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:37,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:37,850 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:23:37,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:37,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068642775] [2025-02-08 08:23:37,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068642775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:37,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:37,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:23:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745065071] [2025-02-08 08:23:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:37,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:23:37,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:37,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:23:37,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:23:37,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:37,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 25 transitions, 97 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:37,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:37,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:37,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:38,111 INFO L124 PetriNetUnfolderBase]: 303/568 cut-off events. [2025-02-08 08:23:38,111 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2025-02-08 08:23:38,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 568 events. 303/568 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2251 event pairs, 51 based on Foata normal form. 20/588 useless extension candidates. Maximal degree in co-relation 1465. Up to 325 conditions per place. [2025-02-08 08:23:38,115 INFO L140 encePairwiseOnDemand]: 52/58 looper letters, 31 selfloop transitions, 3 changer transitions 23/61 dead transitions. [2025-02-08 08:23:38,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 61 transitions, 305 flow [2025-02-08 08:23:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:23:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:23:38,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2025-02-08 08:23:38,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2478448275862069 [2025-02-08 08:23:38,117 INFO L175 Difference]: Start difference. First operand has 53 places, 25 transitions, 97 flow. Second operand 8 states and 115 transitions. [2025-02-08 08:23:38,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 61 transitions, 305 flow [2025-02-08 08:23:38,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 255 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-02-08 08:23:38,120 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 83 flow [2025-02-08 08:23:38,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=83, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2025-02-08 08:23:38,120 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -12 predicate places. [2025-02-08 08:23:38,121 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 83 flow [2025-02-08 08:23:38,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:38,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:38,121 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:23:38,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:23:38,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:38,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash -707933231, now seen corresponding path program 1 times [2025-02-08 08:23:38,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040734244] [2025-02-08 08:23:38,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:38,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 08:23:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 08:23:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:38,235 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:23:38,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:38,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040734244] [2025-02-08 08:23:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040734244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588649188] [2025-02-08 08:23:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:38,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:38,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:38,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:23:38,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:38,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:38,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:38,321 INFO L124 PetriNetUnfolderBase]: 203/405 cut-off events. [2025-02-08 08:23:38,321 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2025-02-08 08:23:38,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 405 events. 203/405 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1542 event pairs, 39 based on Foata normal form. 26/431 useless extension candidates. Maximal degree in co-relation 941. Up to 199 conditions per place. [2025-02-08 08:23:38,322 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 34 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2025-02-08 08:23:38,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 209 flow [2025-02-08 08:23:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:38,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-02-08 08:23:38,323 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3146551724137931 [2025-02-08 08:23:38,323 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 83 flow. Second operand 4 states and 73 transitions. [2025-02-08 08:23:38,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 209 flow [2025-02-08 08:23:38,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 191 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-02-08 08:23:38,325 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 95 flow [2025-02-08 08:23:38,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2025-02-08 08:23:38,325 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -18 predicate places. [2025-02-08 08:23:38,325 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 95 flow [2025-02-08 08:23:38,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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:23:38,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:38,326 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:23:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:23:38,326 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:38,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:38,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1176332866, now seen corresponding path program 1 times [2025-02-08 08:23:38,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:38,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084282092] [2025-02-08 08:23:38,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:38,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:38,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 08:23:38,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 08:23:38,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:38,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:38,457 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:23:38,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:23:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084282092] [2025-02-08 08:23:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084282092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:38,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516004368] [2025-02-08 08:23:38,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:23:38,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:38,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:38,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:38,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:38,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:38,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:38,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:38,542 INFO L124 PetriNetUnfolderBase]: 107/223 cut-off events. [2025-02-08 08:23:38,542 INFO L125 PetriNetUnfolderBase]: For 76/78 co-relation queries the response was YES. [2025-02-08 08:23:38,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 223 events. 107/223 cut-off events. For 76/78 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 646 event pairs, 27 based on Foata normal form. 16/239 useless extension candidates. Maximal degree in co-relation 567. Up to 86 conditions per place. [2025-02-08 08:23:38,544 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 29 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2025-02-08 08:23:38,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 201 flow [2025-02-08 08:23:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:23:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:23:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-02-08 08:23:38,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2689655172413793 [2025-02-08 08:23:38,545 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 95 flow. Second operand 5 states and 78 transitions. [2025-02-08 08:23:38,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 201 flow [2025-02-08 08:23:38,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 182 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 08:23:38,546 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 103 flow [2025-02-08 08:23:38,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-02-08 08:23:38,546 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places. [2025-02-08 08:23:38,546 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 103 flow [2025-02-08 08:23:38,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:38,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:38,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:38,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:23:38,547 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:38,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2014305515, now seen corresponding path program 1 times [2025-02-08 08:23:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:23:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354861249] [2025-02-08 08:23:38,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:23:38,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:38,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:38,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:23:38,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:38,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:38,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:38,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:38,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 08:23:38,720 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:23:38,721 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2025-02-08 08:23:38,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2025-02-08 08:23:38,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2025-02-08 08:23:38,722 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2025-02-08 08:23:38,723 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2025-02-08 08:23:38,724 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (20 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2025-02-08 08:23:38,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 46 remaining) [2025-02-08 08:23:38,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 46 remaining) [2025-02-08 08:23:38,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:23:38,727 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:38,799 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:23:38,799 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:23:38,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:23:38 BasicIcfg [2025-02-08 08:23:38,805 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:23:38,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:23:38,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:23:38,806 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:23:38,806 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:33" (3/4) ... [2025-02-08 08:23:38,807 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:23:38,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:23:38,809 INFO L158 Benchmark]: Toolchain (without parser) took 6595.69ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 157.4MB in the beginning and 289.4MB in the end (delta: -132.0MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2025-02-08 08:23:38,809 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 209.7MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:38,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.49ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 135.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:23:38,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.82ms. Allocated memory is still 201.3MB. Free memory was 134.8MB in the beginning and 132.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:38,810 INFO L158 Benchmark]: Boogie Preprocessor took 43.73ms. Allocated memory is still 201.3MB. Free memory was 132.9MB in the beginning and 130.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:38,810 INFO L158 Benchmark]: IcfgBuilder took 692.86ms. Allocated memory is still 201.3MB. Free memory was 130.1MB in the beginning and 139.1MB in the end (delta: -9.1MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. [2025-02-08 08:23:38,810 INFO L158 Benchmark]: TraceAbstraction took 5439.09ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 138.1MB in the beginning and 289.4MB in the end (delta: -151.3MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2025-02-08 08:23:38,810 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 419.4MB. Free memory was 289.4MB in the beginning and 289.4MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:38,811 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 209.7MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.49ms. Allocated memory is still 201.3MB. Free memory was 157.1MB in the beginning and 135.1MB in the end (delta: 22.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.82ms. Allocated memory is still 201.3MB. Free memory was 134.8MB in the beginning and 132.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.73ms. Allocated memory is still 201.3MB. Free memory was 132.9MB in the beginning and 130.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 692.86ms. Allocated memory is still 201.3MB. Free memory was 130.1MB in the beginning and 139.1MB in the end (delta: -9.1MB). Peak memory consumption was 91.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5439.09ms. Allocated memory was 201.3MB in the beginning and 419.4MB in the end (delta: 218.1MB). Free memory was 138.1MB in the beginning and 289.4MB in the end (delta: -151.3MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 419.4MB. Free memory was 289.4MB in the beginning and 289.4MB in the end (delta: 45.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L772] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 411 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 402 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 956 IncrementalHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 3 mSDtfsCounter, 956 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:23:38,830 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/safe006_rmo.oepc_rmo.opt-thin000_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 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:23:41,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:23:41,414 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:23:41,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:23:41,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:23:41,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:23:41,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:23:41,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:23:41,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:23:41,439 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:23:41,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:23:41,440 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:23:41,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:23:41,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:23:41,440 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:23:41,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:23:41,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:23:41,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:23:41,442 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:23:41,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:41,443 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:23:41,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:23:41,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:23:41,444 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 -> 15ac4e1d4eb7f123e42f66ffca6b608a72882a0faec253c9cc2d868c4bb280c3 [2025-02-08 08:23:41,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:23:41,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:23:41,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:23:41,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:23:41,692 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:23:41,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:42,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec04b6e2f/5a4f297be6d34a8cb0c4108ebb77b630/FLAG1e65c4ab5 [2025-02-08 08:23:43,246 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:23:43,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:43,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec04b6e2f/5a4f297be6d34a8cb0c4108ebb77b630/FLAG1e65c4ab5 [2025-02-08 08:23:43,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ec04b6e2f/5a4f297be6d34a8cb0c4108ebb77b630 [2025-02-08 08:23:43,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:23:43,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:23:43,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:43,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:23:43,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:23:43,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2e0827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43, skipping insertion in model container [2025-02-08 08:23:43,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:23:43,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:43,578 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:23:43,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:23:43,672 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:23:43,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43 WrapperNode [2025-02-08 08:23:43,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:23:43,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:43,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:23:43,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:23:43,682 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:23:43" (1/1) ... [2025-02-08 08:23:43,702 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:23:43" (1/1) ... [2025-02-08 08:23:43,715 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2025-02-08 08:23:43,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:23:43,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:23:43,717 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:23:43,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:23:43,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,745 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2025-02-08 08:23:43,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:23:43,774 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:23:43,774 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:23:43,774 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:23:43,775 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (1/1) ... [2025-02-08 08:23:43,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:23:43,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:43,820 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:23:43,832 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:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-02-08 08:23:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-02-08 08:23:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 08:23:43,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:23:43,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:23:43,863 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:23:43,993 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:23:43,994 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:23:44,379 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:23:44,380 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:23:44,706 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:23:44,706 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:23:44,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:44 BoogieIcfgContainer [2025-02-08 08:23:44,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:23:44,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:23:44,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:23:44,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:23:44,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:23:43" (1/3) ... [2025-02-08 08:23:44,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a540aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:44, skipping insertion in model container [2025-02-08 08:23:44,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:23:43" (2/3) ... [2025-02-08 08:23:44,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a540aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:23:44, skipping insertion in model container [2025-02-08 08:23:44,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:44" (3/3) ... [2025-02-08 08:23:44,713 INFO L128 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2025-02-08 08:23:44,724 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:23:44,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i that has 3 procedures, 57 locations, 1 initial locations, 0 loop locations, and 26 error locations. [2025-02-08 08:23:44,725 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:23:44,791 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 08:23:44,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 58 transitions, 124 flow [2025-02-08 08:23:44,862 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2025-02-08 08:23:44,864 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:44,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 56 events. 2/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 178 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2025-02-08 08:23:44,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 58 transitions, 124 flow [2025-02-08 08:23:44,869 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 56 transitions, 118 flow [2025-02-08 08:23:44,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:23:44,884 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;@5397380a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:23:44,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-02-08 08:23:44,887 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:23:44,887 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2025-02-08 08:23:44,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:44,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:44,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:23:44,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:44,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash 16814024, now seen corresponding path program 1 times [2025-02-08 08:23:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1825591195] [2025-02-08 08:23:44,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:44,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:44,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:44,901 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:23:44,903 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:23:44,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:23:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:23:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:23:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:45,035 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:23:45,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:45,036 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825591195] [2025-02-08 08:23:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825591195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:45,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:45,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:45,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036036192] [2025-02-08 08:23:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:45,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:45,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:45,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:45,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:45,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:45,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:45,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:45,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:45,621 INFO L124 PetriNetUnfolderBase]: 1490/2629 cut-off events. [2025-02-08 08:23:45,625 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:23:45,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5036 conditions, 2629 events. 1490/2629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15803 event pairs, 1490 based on Foata normal form. 126/2070 useless extension candidates. Maximal degree in co-relation 5026. Up to 2387 conditions per place. [2025-02-08 08:23:45,651 INFO L140 encePairwiseOnDemand]: 39/58 looper letters, 30 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2025-02-08 08:23:45,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 142 flow [2025-02-08 08:23:45,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-02-08 08:23:45,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41954022988505746 [2025-02-08 08:23:45,662 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 118 flow. Second operand 3 states and 73 transitions. [2025-02-08 08:23:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 142 flow [2025-02-08 08:23:45,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:45,667 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 80 flow [2025-02-08 08:23:45,669 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2025-02-08 08:23:45,672 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -17 predicate places. [2025-02-08 08:23:45,673 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 80 flow [2025-02-08 08:23:45,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:45,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:45,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:23:45,683 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:23:45,874 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:23:45,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash 16814025, now seen corresponding path program 1 times [2025-02-08 08:23:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1478384256] [2025-02-08 08:23:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:45,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:45,881 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:23:45,882 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:23:45,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:23:45,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:23:45,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:45,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:45,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:45,990 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:23:45,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:45,990 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478384256] [2025-02-08 08:23:45,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478384256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:45,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:45,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962025370] [2025-02-08 08:23:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:45,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:45,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:45,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:45,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:45,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:45,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:45,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:45,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:46,192 INFO L124 PetriNetUnfolderBase]: 695/1275 cut-off events. [2025-02-08 08:23:46,193 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:46,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 1275 events. 695/1275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6713 event pairs, 695 based on Foata normal form. 0/1194 useless extension candidates. Maximal degree in co-relation 2427. Up to 1140 conditions per place. [2025-02-08 08:23:46,207 INFO L140 encePairwiseOnDemand]: 51/58 looper letters, 23 selfloop transitions, 1 changer transitions 1/31 dead transitions. [2025-02-08 08:23:46,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 118 flow [2025-02-08 08:23:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-02-08 08:23:46,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3160919540229885 [2025-02-08 08:23:46,209 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 80 flow. Second operand 3 states and 55 transitions. [2025-02-08 08:23:46,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 118 flow [2025-02-08 08:23:46,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:46,210 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 67 flow [2025-02-08 08:23:46,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2025-02-08 08:23:46,210 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2025-02-08 08:23:46,210 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 67 flow [2025-02-08 08:23:46,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:23:46,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:46,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:46,220 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:23:46,411 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:23:46,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:46,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:46,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1168536102, now seen corresponding path program 1 times [2025-02-08 08:23:46,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:46,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1878643529] [2025-02-08 08:23:46,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:46,417 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:23:46,420 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:23:46,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:23:46,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:23:46,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:46,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:46,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:23:46,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:46,576 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:23:46,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:46,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:46,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878643529] [2025-02-08 08:23:46,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878643529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:46,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:46,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618964246] [2025-02-08 08:23:46,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:46,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:46,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:46,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:46,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 67 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:23:46,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:46,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:46,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:46,770 INFO L124 PetriNetUnfolderBase]: 613/1034 cut-off events. [2025-02-08 08:23:46,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:46,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 1034 events. 613/1034 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5166 event pairs, 88 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2056. Up to 914 conditions per place. [2025-02-08 08:23:46,776 INFO L140 encePairwiseOnDemand]: 54/58 looper letters, 37 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-02-08 08:23:46,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 45 transitions, 177 flow [2025-02-08 08:23:46,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:46,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-08 08:23:46,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3735632183908046 [2025-02-08 08:23:46,778 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 67 flow. Second operand 3 states and 65 transitions. [2025-02-08 08:23:46,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 45 transitions, 177 flow [2025-02-08 08:23:46,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:46,779 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 76 flow [2025-02-08 08:23:46,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-02-08 08:23:46,780 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2025-02-08 08:23:46,780 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 76 flow [2025-02-08 08:23:46,780 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:23:46,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:46,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:46,789 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:23:46,980 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:23:46,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1197097747, now seen corresponding path program 1 times [2025-02-08 08:23:46,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665950009] [2025-02-08 08:23:46,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:46,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:46,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:46,984 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:23:46,986 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:23:47,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:47,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:47,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:47,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:47,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:47,141 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:23:47,141 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:47,141 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665950009] [2025-02-08 08:23:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665950009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535335145] [2025-02-08 08:23:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:47,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:47,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:47,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:47,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:47,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:47,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:47,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:47,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:47,303 INFO L124 PetriNetUnfolderBase]: 564/955 cut-off events. [2025-02-08 08:23:47,303 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:23:47,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2049 conditions, 955 events. 564/955 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4728 event pairs, 64 based on Foata normal form. 0/953 useless extension candidates. Maximal degree in co-relation 2040. Up to 834 conditions per place. [2025-02-08 08:23:47,310 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 36 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2025-02-08 08:23:47,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 180 flow [2025-02-08 08:23:47,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-02-08 08:23:47,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30603448275862066 [2025-02-08 08:23:47,312 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 76 flow. Second operand 4 states and 71 transitions. [2025-02-08 08:23:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 180 flow [2025-02-08 08:23:47,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:47,314 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 72 flow [2025-02-08 08:23:47,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2025-02-08 08:23:47,314 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -21 predicate places. [2025-02-08 08:23:47,314 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 72 flow [2025-02-08 08:23:47,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:47,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:47,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:47,325 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:23:47,520 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:23:47,520 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:47,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:47,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1976749754, now seen corresponding path program 1 times [2025-02-08 08:23:47,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123319413] [2025-02-08 08:23:47,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:47,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:47,524 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:23:47,526 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:23:47,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:23:47,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:23:47,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:47,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:47,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 08:23:47,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:47,691 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:23:47,691 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:47,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123319413] [2025-02-08 08:23:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123319413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:47,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:47,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:23:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041424490] [2025-02-08 08:23:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:47,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:47,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:47,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:47,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:47,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:47,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:47,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:47,847 INFO L124 PetriNetUnfolderBase]: 515/876 cut-off events. [2025-02-08 08:23:47,847 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-02-08 08:23:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1861 conditions, 876 events. 515/876 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4317 event pairs, 40 based on Foata normal form. 30/904 useless extension candidates. Maximal degree in co-relation 1852. Up to 755 conditions per place. [2025-02-08 08:23:47,850 INFO L140 encePairwiseOnDemand]: 55/58 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-02-08 08:23:47,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 174 flow [2025-02-08 08:23:47,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-02-08 08:23:47,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3017241379310345 [2025-02-08 08:23:47,852 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 72 flow. Second operand 4 states and 70 transitions. [2025-02-08 08:23:47,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 174 flow [2025-02-08 08:23:47,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 169 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:23:47,852 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 67 flow [2025-02-08 08:23:47,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=67, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2025-02-08 08:23:47,853 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -22 predicate places. [2025-02-08 08:23:47,853 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 67 flow [2025-02-08 08:23:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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:23:47,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:47,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:47,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 08:23:48,053 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:23:48,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:48,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:48,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1279327067, now seen corresponding path program 1 times [2025-02-08 08:23:48,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:48,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [749632586] [2025-02-08 08:23:48,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:48,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:48,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:48,060 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:23:48,061 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:23:48,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:48,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:48,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:48,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:48,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-08 08:23:48,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:48,150 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:23:48,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:48,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749632586] [2025-02-08 08:23:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749632586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:23:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708259745] [2025-02-08 08:23:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:48,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:23:48,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:48,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:23:48,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:23:48,152 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 58 [2025-02-08 08:23:48,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 67 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:23:48,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:48,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 58 [2025-02-08 08:23:48,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:48,264 INFO L124 PetriNetUnfolderBase]: 515/957 cut-off events. [2025-02-08 08:23:48,264 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 08:23:48,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 957 events. 515/957 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4718 event pairs, 515 based on Foata normal form. 36/984 useless extension candidates. Maximal degree in co-relation 1933. Up to 852 conditions per place. [2025-02-08 08:23:48,267 INFO L140 encePairwiseOnDemand]: 56/58 looper letters, 20 selfloop transitions, 1 changer transitions 1/27 dead transitions. [2025-02-08 08:23:48,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 27 transitions, 109 flow [2025-02-08 08:23:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:23:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:23:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-02-08 08:23:48,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.25287356321839083 [2025-02-08 08:23:48,268 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 67 flow. Second operand 3 states and 44 transitions. [2025-02-08 08:23:48,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 27 transitions, 109 flow [2025-02-08 08:23:48,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 27 transitions, 106 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:48,269 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2025-02-08 08:23:48,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2025-02-08 08:23:48,270 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -23 predicate places. [2025-02-08 08:23:48,270 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2025-02-08 08:23:48,270 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:23:48,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:48,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:48,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:23:48,470 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:23:48,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:48,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:48,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1279329479, now seen corresponding path program 1 times [2025-02-08 08:23:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1899749771] [2025-02-08 08:23:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:48,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:48,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:48,474 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:23:48,475 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:23:48,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 08:23:48,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:23:48,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:48,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:48,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 08:23:48,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:48,635 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:23:48,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:48,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:48,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899749771] [2025-02-08 08:23:48,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899749771] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:48,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:48,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:23:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196984819] [2025-02-08 08:23:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:48,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:23:48,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:48,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:23:48,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:23:48,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:48,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:48,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:48,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:48,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:48,860 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2025-02-08 08:23:48,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:23:48,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 607 events. 303/607 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2767 event pairs, 69 based on Foata normal form. 36/640 useless extension candidates. Maximal degree in co-relation 1227. Up to 289 conditions per place. [2025-02-08 08:23:48,866 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 38 selfloop transitions, 4 changer transitions 1/48 dead transitions. [2025-02-08 08:23:48,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 198 flow [2025-02-08 08:23:48,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:23:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:23:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-08 08:23:48,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33189655172413796 [2025-02-08 08:23:48,872 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 4 states and 77 transitions. [2025-02-08 08:23:48,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 198 flow [2025-02-08 08:23:48,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:23:48,872 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 87 flow [2025-02-08 08:23:48,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-02-08 08:23:48,873 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -20 predicate places. [2025-02-08 08:23:48,873 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 87 flow [2025-02-08 08:23:48,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:48,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:48,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:48,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:23:49,078 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:23:49,078 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash -990016719, now seen corresponding path program 1 times [2025-02-08 08:23:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979318457] [2025-02-08 08:23:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:49,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:49,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:49,081 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:23:49,086 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:23:49,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:23:49,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:23:49,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:49,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:49,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 08:23:49,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:49,200 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:23:49,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:49,200 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:49,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979318457] [2025-02-08 08:23:49,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979318457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:49,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:49,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:23:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302867082] [2025-02-08 08:23:49,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:49,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:23:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:49,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:23:49,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:23:49,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:49,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:49,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:49,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:49,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:49,324 INFO L124 PetriNetUnfolderBase]: 143/287 cut-off events. [2025-02-08 08:23:49,324 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-02-08 08:23:49,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 287 events. 143/287 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 945 event pairs, 47 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 699. Up to 116 conditions per place. [2025-02-08 08:23:49,326 INFO L140 encePairwiseOnDemand]: 53/58 looper letters, 31 selfloop transitions, 6 changer transitions 1/43 dead transitions. [2025-02-08 08:23:49,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 200 flow [2025-02-08 08:23:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:23:49,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:23:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-02-08 08:23:49,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27586206896551724 [2025-02-08 08:23:49,327 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 87 flow. Second operand 5 states and 80 transitions. [2025-02-08 08:23:49,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 200 flow [2025-02-08 08:23:49,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 191 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:23:49,329 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 103 flow [2025-02-08 08:23:49,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2025-02-08 08:23:49,331 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -16 predicate places. [2025-02-08 08:23:49,331 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 103 flow [2025-02-08 08:23:49,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:23:49,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:49,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:49,339 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:23:49,531 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:23:49,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:49,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:49,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2059663413, now seen corresponding path program 1 times [2025-02-08 08:23:49,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1312564189] [2025-02-08 08:23:49,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:23:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:49,534 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:23:49,536 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:23:49,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:49,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:49,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:23:49,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 08:23:49,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:23:49,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:23:49,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:23:49,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 08:23:49,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312564189] [2025-02-08 08:23:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312564189] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:23:49,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:23:49,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 08:23:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943988024] [2025-02-08 08:23:49,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:23:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:23:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 08:23:49,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:23:49,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:23:49,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 58 [2025-02-08 08:23:49,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 103 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:23:49,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:23:49,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 58 [2025-02-08 08:23:49,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:23:49,875 INFO L124 PetriNetUnfolderBase]: 181/369 cut-off events. [2025-02-08 08:23:49,875 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2025-02-08 08:23:49,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 369 events. 181/369 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1340 event pairs, 43 based on Foata normal form. 4/371 useless extension candidates. Maximal degree in co-relation 931. Up to 139 conditions per place. [2025-02-08 08:23:49,877 INFO L140 encePairwiseOnDemand]: 50/58 looper letters, 29 selfloop transitions, 5 changer transitions 24/63 dead transitions. [2025-02-08 08:23:49,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 335 flow [2025-02-08 08:23:49,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:23:49,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:23:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2025-02-08 08:23:49,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27832512315270935 [2025-02-08 08:23:49,878 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 103 flow. Second operand 7 states and 113 transitions. [2025-02-08 08:23:49,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 335 flow [2025-02-08 08:23:49,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 278 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-02-08 08:23:49,879 INFO L231 Difference]: Finished difference. Result has 50 places, 30 transitions, 110 flow [2025-02-08 08:23:49,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2025-02-08 08:23:49,880 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, -11 predicate places. [2025-02-08 08:23:49,880 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 110 flow [2025-02-08 08:23:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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:23:49,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:23:49,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:49,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 08:23:50,080 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:23:50,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-02-08 08:23:50,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:23:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 897562657, now seen corresponding path program 2 times [2025-02-08 08:23:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 08:23:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [244920860] [2025-02-08 08:23:50,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:23:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:50,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:23:50,088 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:23:50,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:23:50,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:50,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:50,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:23:50,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:50,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 08:23:50,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 08:23:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 08:23:50,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:23:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 08:23:50,259 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 08:23:50,259 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 08:23:50,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (20 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2025-02-08 08:23:50,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 46 remaining) [2025-02-08 08:23:50,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 46 remaining) [2025-02-08 08:23:50,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:23:50,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:23:50,463 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:23:50,509 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:23:50,509 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:23:50,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:23:50 BasicIcfg [2025-02-08 08:23:50,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:23:50,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:23:50,514 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:23:50,514 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:23:50,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:23:44" (3/4) ... [2025-02-08 08:23:50,515 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 08:23:50,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:23:50,516 INFO L158 Benchmark]: Toolchain (without parser) took 7238.08ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 115.7MB in the beginning and 140.8MB in the end (delta: -25.2MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2025-02-08 08:23:50,516 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.82ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 92.6MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: Boogie Preprocessor took 56.70ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 87.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: IcfgBuilder took 932.78ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 96.1MB in the end (delta: -8.4MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: TraceAbstraction took 5804.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 95.4MB in the beginning and 141.0MB in the end (delta: -45.6MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2025-02-08 08:23:50,517 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 285.2MB. Free memory was 141.0MB in the beginning and 140.8MB in the end (delta: 134.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:23:50,518 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.18ms. Allocated memory is still 117.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.82ms. Allocated memory is still 142.6MB. Free memory was 115.5MB in the beginning and 92.6MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 92.6MB in the beginning and 90.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.70ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 87.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 932.78ms. Allocated memory is still 142.6MB. Free memory was 87.8MB in the beginning and 96.1MB in the end (delta: -8.4MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5804.80ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 95.4MB in the beginning and 141.0MB in the end (delta: -45.6MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 285.2MB. Free memory was 141.0MB in the beginning and 140.8MB in the end (delta: 134.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L772] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] [L18] 0 __assert_fail ("0", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 91 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 512 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 6 mSDtfsCounter, 512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 544 SizeOfPredicates, 13 NumberOfNonLiveVariables, 928 ConjunctsInSsa, 39 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:23:50,536 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